Abstract
In continuation to earlier works where the problem of joint information embedding and lossless compression (of the composite signal) was studied in the absence [6] and in the presence [7] of attacks, here we consider the additional ingredient of protecting the secrecy of the watermark against an unauthorized party, which has no access to a secret key shared by the legitimate parties. In other words, we study the problem of joint coding for three objectives: information embedding, compression, and encryption. Our main result is a coding theorem that provides a single–letter characterization of the best achievable tradeoffs among the following parameters: the distortion between the composite signal and the covertext, the distortion in reconstructing the watermark by the legitimate receiver, the compressibility of the composite signal (with and without the key), and the equivocation of the watermark, as well as its reconstructed version, given the composite signal. In the attack–free case, if the key is independent of the covertext, this coding theorem gives rise to a threefold separation principle that tells that asymptotically, for long block codes, no optimality is lost by first applying a rate–distortion code to the watermark source, then encrypting the compressed codeword, and finally, embedding it into the covertext using the embedding scheme of [6]. In the more general case, however, this separation principle is no longer valid, as the key plays an additional role of side information used by the embedding unit.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adelsbach, A., Katzenbeisser, S., Sadeghi, A.-R.: Cryptography meets watermarking: detecting watermarks with minimal or zero knowledge disclosure (preprint 2002), Available on-line at: http://www-krypt.cs.uni-sb.de/download/papers
Cheung, S.C., Chiu, D.K.W.: A watermark infrastructure for enterprise document management. In: Proc. 36th Hawaii International Conference on System Sciences (HICSS 2003), Hawaii (2003)
Gel’fand, S.I., Pinsker, M.S.: Coding for channel with random parameters. Problems of Information and Control 9(1), 19–31 (1980)
Jayawardena, A., Murison, B., Lenders, P.: Embedding multiresolution binary images into multiresolution watermark channels in wavelet domain (preprint 2000), Available on-line at: http://www.tsi.enst.fr/~maitre/tatouage/icassp00/articles
Kuroda, K., Nishigaki, M., Soga, M., Takubo, A., Nakamura, I.: A digital watermark using public–key cryptography for open algorithm. In: Proc. ICITA 2002 (2002), Also available on-line at: http://charybdis.mit.csu.edu.au/~mantolov/CD/ICITA2002/papers/131-21.pdf
Maor, A., Merhav, N.: On joint information embedding and lossy compression. Submitted to IEEE Trans. Inform. Theory (July 2003), Available on-line at: http://www.ee.technion.ac.il/people/merhav
Maor, A., Merhav, N.: On joint information embedding and lossy compression in the presence of a stationary memoryless attack channel. Submitted to IEEE Trans. Inform. Theory (January 2004), Available on-line at: http://www.ee.technion.ac.il/people/merhav
Merhav, N.: On joint coding for watermarking and encryption. Submitted to IEEE Trans. Inform. Theory (May 2004), Available at: http://www.ee.technion.ac.il/people/merhav
Moulin, P., Wang, Y.: New results on steganographic capacity. In: Proc. CISS 2004, pp. 813–818. Princeton University (March 2004)
Slepian, D., Wolf, J.K.: Noiseless coding of correlated information sources. IEEE Trans. Inform. Theory IT-19, 471–480 (1973)
Steinder, M., Iren, S., Amer, P.D.: Progressively authenticated image transmission (preprint 1999), Available on-line at, http://www.cis.udel.edu/amer/PEL/poc/pdf/milcom99-steiner.pdf
Yamamoto, H.: Rate–distortion theory for the Shannon cipher system. IEEE Trans. Inform. Theory 43(3), 827–835 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Merhav, N. (2005). On Joint Coding for Watermarking and Encryption. In: Barni, M., Herrera-Joancomartí, J., Katzenbeisser, S., Pérez-González, F. (eds) Information Hiding. IH 2005. Lecture Notes in Computer Science, vol 3727. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11558859_1
Download citation
DOI: https://doi.org/10.1007/11558859_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29039-1
Online ISBN: 978-3-540-31481-3
eBook Packages: Computer ScienceComputer Science (R0)