On the error exponent and capacity games of private watermarking systems

IEEE Transactions on Information Theory

Volumn 49, Issue 3, 2003, Pages 537-562

  Somekh Baruch, Anelia ^a   Merhav, Neri ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Capacity; Coding with side information; Error exponents; Information hiding; Maximum mutual information (MMI) decoder; Private watermarking; Randomized code; Steganography; Universal decoding; Watermarking

Indexed keywords

ASYMPTOTIC STABILITY; COMPUTER SIMULATION; CRYPTOGRAPHY; DECODING; ENCODING (SYMBOLS); GAME THEORY; INFORMATION THEORY; OPTIMIZATION;

ERROR EXPONENT; INFORMATION HIDING; MAXIMUM MUTUAL INFORMATION DECODER; PRIVATE WATERMARKING SYSTEMS; RANDOMIZED CODE; STEGANOGRAPHY; UNIVERSAL DECODING;

DIGITAL WATERMARKING;

EID: 0037353685     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.808132     Document Type: Article

References (24)

1. A. Cohen and A. Lapidoth, "The Gaussian watermarking game," IEEE Trans. Inform. Theory, vol. 48, pp. 1639-1667, June 2002.
2. ____, "The capacity of the vector Gaussian watermarking game," in Proc. IEEE Int. Symp. Information Theory, Sorrento, Italy, June 2000, p. 48.
3. I. J. Cox, M. L. Miller, and A. L. McKellips, "Watermarking as communications with side information," Proc. IEEE, vol. 87, pp. 1127-1141, July 1999.
4. S. Craver, N. Memon, B.-L. Yeo, and M. M. Yeung, "Resolving rightful ownerships with invisible watermarking techniques: limitations, attacks, and implications," IEEE J. Select. Areas Commun., vol. 16, pp. 573-586, May 1998.
5. I. Csiszár and J. Kórner, Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
6. A. G. D'yachkov, "Lower bound for ensemble-average error probability for a discrete memoryless channel," Probl. Inform. Transm. (IPPI), pp. 93-98, Apr.-June 1980.
7. ____, "Bounds on the average error probability for code ensemble with fixed composition," Probl. Inform. Transm. (IPPI), pp. 255-259, July 1981.
8. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
9. ____, "The random coding bound is tight for the average code," IEEE Trans. Inform. Theory, vol. IT-19, pp. 244-246, Mar. 1973.
10. S. Karlin, Mathematical Methods and Theory in Game, Programming and Economics. Reading, MA: Addison-Wesley, 1959.
11. A. Lapidoth and N. Narayan, "Reliable communication under channel uncertainty," IEEE Trans. Inform. Theory, vol. 44, pp. 2148-2177, Oct. 1998.
12. N. Merhav, "How many information bits does a decoder need about the channel statistics?," IEEE Trans. Inform. Theory, vol. 43, pp. 1707-1714, Sept. 1997.
13. N. Merhav, "On random coding error exponents of watermarking systems," IEEE Trans. Inform. Theory, vol. 46, pp. 420-430, Mar. 2000.
14. ____, "Universal detection of messages via finite-state channels," IEEE Trans. Inform. Theory, vol. 46, pp. 2242-2246, Sept. 2000.
15. P. Moulin and J. A. O'Sullivan, "Information-theoretic analysis of information hiding," IEEE Trans. Inform. Theory, vol. 49, pp. 563-593, Mar. 2003.
16. ____, "Information-theoretic analysis of information hiding," in Proc. IEEE Int. Symp. Information Theory, Sorrento, Italy, 2000, p. 19.
17. J. A. O'Sullivan, P. Moulin, and J. M. Ettinger, "Information theoretic analysis of steganography," in Proc. IEEE Int. Symp. Information Theory, Cambridge, MA, Aug. 1998, p. 297.
18. F. A. P. Petitculas, R. J. Anderson, and M. G. Kuhn, "Information hiding - A survey," Proc. IEEE, vol. 87, pp. 1062-1078, July 1999.
19. A. Somekh-Baruch and N. Merhav. (2001) On the Error Exponent and Capacity Games of Private Watermarking Systems. Technion-Israel Inst. Technol., Elec. Eng. Dept., Haifa. [Online]. Available: http://tiger.technion.ac.il/users/merhav
20. Y. Steinberg and N. Merhav, "Identification in the presence of side information with application to watermarking," IEEE Trans. Inform. Theory, vol. 47, pp. 1410-1422, May 2001.
21. I. G. Stiglitz, "Coding for a class of unknown channels," IEEE Trans. Inform. Theory, vol. IT-13, pp. 189-195, Apr. 1966.
22. ____, "A coding theorem for a class of unknown channels," IEEE Trans. Inform. Theory, vol. IT-13, pp. 217-220, Apr. 1967.
23. A. J. Viterbi and J. K. Omura, Principles of Digital Communication and Coding. New York: McGraw-Hill, 1979.
24. J. Ziv, "Universal decoding for finite-state channels," IEEE Trans. Inform. Theory, vol. IT-33, pp. 453-460, July 1985.