On joint coding for watermarking and encryption
Neri Merhav

TL;DR
This paper develops a theoretical framework for joint coding that combines watermarking, compression, and encryption, providing optimal tradeoffs and revealing a separation principle in attack-free scenarios.
Contribution
It introduces a coding theorem characterizing the best tradeoffs among distortion, compression, and secrecy in joint watermarking and encryption, extending previous work to include security considerations.
Findings
Single-letter characterization of achievable tradeoffs
Separation principle in attack-free case with independent key
Role of key as side information in general case
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 \cite{MM03} and in the presence \cite{MM04} 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsWireless Communication Security Techniques · Advanced Steganography and Watermarking Techniques · Chaos-based Image/Signal Encryption
