Security Analysis of Scalar Costa Scheme Against Known Message Attack in DCT-Domain Image Watermarking
Journal Title: Journal of Information Systems and Telecommunication - Year 2014, Vol 2, Issue 4
Abstract
This paper proposes an accurate information-theoretic security analysis of Scalar Costa Scheme (SCS) when the SCS is employed in the embedding layer of digital image watermarking. For this purpose, Discrete Cosine Transform (DCT) coefficients are extracted from the cover images. Then, the SCS is used to embed watermarking messages into mid-frequency DCT coefficients. To prevent unauthorized embedding and/or decoding, the SCS codebook is randomized using the pseudorandom dither signal which plays the role of the secret key. A passive attacker applies Known Message Attack (KMA) on the watermarked messages to practically estimate the secret key. The security level is measured using residual entropy (equivocation) of the secret key provided that the attacker’s observations are available. It can be seen that the practical security level of the SCS depends on the host statistics which has contradiction with previous theoretical result. Furthermore, the practical security analysis of the SCS leads to the different values of the residual entropy in comparison with previous theoretical equation. It will be shown that these differences are mainly due to existence of uniform regions in images that cannot be captured by previous theoretical analysis. Another source of such differences is ignoring the dependencies between the observations of non-uniform regions in previous theoretical analysis. To provide an accurate reformulation, the theoretical equation for the uniform regions and the empirical equation for the non-uniform regions are proposed. Then, by combining these equations a new equation is presented for the whole image which considers both host statistics and observations dependencies. Finally, accuracy of the proposed formulations is examined through exhaustive simulations.
Authors and Affiliations
Reza Samadi, Seyed Alireza Seyedin
Keywords
Related Articles
- EP ID EP185877
- DOI 10.7508/jist.2014.04.006
- Views 114
- Downloads 0
Analysis of expert finding algorithms in social network in order to rank the top algorithms
The ubiquity of Internet and social networks have turned question and answer communities into an environment suitable for users to ask their questions about anything or to share their knowledge by providing answers to ot...
Fusion Infrared and Visible Images Using Optimal Weights
Image fusion is a process in which different images recorded by several sensors from one scene are combined to provide a final image with higher quality compared to each individual input image. In fact, combination of di...
A Learning Automata Approach to Cooperative Particle Swarm Optimizer
This paper presents a modification of Particle Swarm Optimization (PSO) technique based on cooperative behavior of swarms and learning ability of an automaton. The approach is called Cooperative Particle Swarm Optimizati...
Defense against SYN Flooding Attacks: A Scheduling Approach
The TCP connection management protocol sets a position for a classic Denial of Service (DoS) attack, called the SYN flooding attack. In this attack attacker sends a large number of TCP SYN segments, without completing th...
A Study on Clustering for Clustering Based Image De-noising
In this paper, the problem of de-noising of an image contaminated with Additive White Gaussian Noise (AWGN) is studied. This subject is an open problem in signal processing for more than 50 years. In the present paper, w...