Digital watermarking models for resolving rightful ownership and authenticating legitimate customer
Journal of Systems and Software
Cyber warfare: steganography vs. steganalysis
Communications of the ACM - Voting systems
A novel data hiding scheme for color images using a BSP tree
Journal of Systems and Software
A robust content-based digital image watermarking scheme
Signal Processing
Human visual system based adaptive digital image watermarking
Signal Processing
A high quality steganographic method with pixel-value differencing and modulus function
Journal of Systems and Software
Adaptive watermark mechanism for rightful ownership protection
Journal of Systems and Software
An embedding technique based upon block prediction
Journal of Systems and Software
Embedding capacity raising in reversible data hiding based on prediction of difference expansion
Journal of Systems and Software
A high quality image sharing with steganography and adaptive authentication scheme
Journal of Systems and Software
An efficient image interpolation increasing payload in reversible data hiding
Expert Systems with Applications: An International Journal
Adjustable prediction-based reversible data hiding
Digital Signal Processing
Histogram-shifting-imitated reversible data hiding
Journal of Systems and Software
Hi-index | 0.01 |
Four criteria are generally used to evaluate the performance of data hiding scheme: the embedding capacity, the visual quality of the stego-image, the security, and the complexity of the data-embedding algorithm. However, data hiding schemes seldom take all these factors into consideration. This paper proposes a novel data hiding scheme that uses a simple modulus function to address all the performance criteria listed above. According to the input secret keys, the encoder and decoder use the same set-generation functions H"r() and H"c() to first generate two sets Kr and Kc. A variant Cartesian product is then created using Kr and Kc. Each cover pixel then forms a pixel group with its neighboring pixels by exploiting an efficient modulus function; the secret data are then embedded or extracted via a mapping process between the variant of the Cartesian product and each pixel group. The proposed scheme offers several advantages, namely (1) the embedding capacity can be scaled, (2) a good visual quality of the stego-image can be achieved, (3) the computational cost of embedding or extracting the secret data is low and requires little memory space, (4) secret keys are used to protect the secret data and (5) the problem of overflow or underflow does not occur, regardless of the nature of the cover pixels. We tested the performance of the proposed scheme by comparing it with Mielikainen's and Zhang and Wang's schemes for gray-scale images. The experimental results showed that our proposed scheme outperforms Mielikainen's in three respects, namely scalable embedding capacity, embedding rate, and level of security. Our data hiding scheme also achieved a higher embedding capacity than Zhang and Wang's. The proposed scheme can easily be applied to both gray-scale and color images. Analyses of its performance showed that our proposed scheme outperforms Tsai and Wang's in terms of its time complexity and memory space requirement.