Perturbed quantization steganography with wet paper codes
Proceedings of the 2004 workshop on Multimedia and security
MM&Sec '06 Proceedings of the 8th workshop on Multimedia and security
Fast communication: Steganography and error-correcting codes
Signal Processing
A Fragile Document Watermarking Technique Based on Wet Paper Code
IIH-MSP '08 Proceedings of the 2008 International Conference on Intelligent Information Hiding and Multimedia Signal Processing
Linear codes for high payload steganography
Discrete Applied Mathematics
How Reed-Solomon codes can improve steganographic schemes
EURASIP Journal on Information Security - Special issue on secure steganography in multimedia content
Asymptotic behavior of the ZZW embedding construction
IEEE Transactions on Information Forensics and Security
Generalization of the ZZW embedding construction for steganography
IEEE Transactions on Information Forensics and Security
Constructing good covering codes for applications in steganography
Transactions on data hiding and multimedia security III
IH'05 Proceedings of the 7th international conference on Information Hiding
IEEE Transactions on Signal Processing - Part II
Wet paper codes with improved embedding efficiency
IEEE Transactions on Information Forensics and Security
Matrix embedding for large payloads
IEEE Transactions on Information Forensics and Security
Interpolation of steganographic schemes
Signal Processing
Hi-index | 0.00 |
Wet paper codes (WPCs) are designed for steganography, in which the sender and recipient do not need to share the changeable positions. In this paper, we propose the N-page construction for wet paper coding, which can generate a family of WPCs following the upper bound on embedding efficiency from one single WPC. The Paper Folding method, one of our previous methods, is a special case of the N-page construction with N = 2k. We deduce recursions for calculating embedding efficiency of N-page construction, and obtain explicit expression on embedding efficiency of 2k-page construction. Furthermore, we derive the limit of distance between the embedding efficiency of 2k -page construction and the upper bound of embedding efficiency as k tends to infinity. Based on the limit, we analyze how the embedding efficiency is influenced by the proportion of wet pixels (wet ratio) in the cover, showing that embedding efficiency only drops about 0.32 as the wet ratio increases to 0.9999.