Skip to main content
SpringerLink
Log in

Watermarking Identification Codes with Related Topics on Common Randomness

  • Chapter
  • First Online:
Identification and Other Probabilistic Models

Part of the book series: Foundations in Signal Processing, Communications and Networking ((SIGNAL,volume 16))

Abstract

Watermarking identification codes were introduced by Steinberg and Merhav.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 89.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. R. Ahlswede, Channels with arbitrarily varying channel probability functions in the presence of noiseless feedback, Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 25, 239-252, (1973)

    Article  MathSciNet  Google Scholar 

  2. R. Ahlswede, Elimination of correlation in random codes for arbitrarily varying channels. Zeitschrift Wahrscheinlichkeitstheorie und verw. Geb. 33, 159–175 (1978)

    Article  MathSciNet  Google Scholar 

  3. R. Ahlswede, General theory of information trannsfer, Preprint 97-118, SFB 343 Diskrete Strukturen in der Mathematik, 1997, this volume pages

    Google Scholar 

  4. R. Ahlswede, V.B. Balakirsky, Identification under random processes, Preprint 95–098, SFB 343, “Diskrete Strukturen in der Mathematik”, Universität Bielefeld, Problemy peredachii informatsii (special issue devoted to M.S. Pinsker), vol. 32, no. 1 (1996), pp. 144–160

    Google Scholar 

  5. R. Ahlswede, N. Cai, The AVC with noiseless feedback and maximal error probability: a capacity formula with a trichotomy, in Numbers, Information, and Complexity (Festschrift for Rudolf Ahlswede), ed. by I. Althöfer, N. Cai, G. Dueck, L. Khachatrian, M. Pinsker, A. Sarkozy, I. Wegener, Z. Zhang (Kluwer, 2000), pp. 151–176

    Google Scholar 

  6. R. Ahlswede, N. Cai, Watermarking identification codes with related topics in common randomness, in General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, vol. 4123 (Springer, 2006), pp. 107–153

    Google Scholar 

  7. R. Ahlswede, I. Csiszár, Common randomness in information theory and cryptography, Part I: Secret sharing. IEEE Trans. Inform. Theory 39, 1121–1132 (1993)

    MathSciNet  MATH  Google Scholar 

  8. R. Ahlswede, I. Csiszár, Common randomness in information theory and cryptography, Part II: CR capacity. IEEE Trans. Inform. Theory 44(1), 225 (1998)

    Google Scholar 

  9. R. Ahlswede, G. Dueck, Identification via channels. IEEE Trans. Inform. Theory 35, 15–29 (1989)

    Article  MathSciNet  Google Scholar 

  10. R. Ahlswede, G. Dueck, Identification in the presence of feedback — a discovery of new capacity formulas. IEEE Trans. Inf. Theory 35, 30–39 (1989)

    Article  MathSciNet  Google Scholar 

  11. R. Ahlswede, J. Körner, Source coding with side information and a converse for degraded broadcast channels. IEEE Trans. Inf. Theory IT-21(6), 629–637 (1975)

    Article  MathSciNet  Google Scholar 

  12. R. Ahlswede, C. Kleinewächter, Pathological examples with different common randomness and (second order) identification capacities, this volume pages

    Google Scholar 

  13. R. Ahlswede, Z. Zhang, New directions in the theory of identification via channels, Preprint 94–010, SFB 343 “Diskrete Strukturen in der Mathematik”, Universität Bielefeld. IEEE Trans. Inform. Theory 41(4), 1040–1050 (1995)

    Article  Google Scholar 

  14. M. Barni, F. Bartolini, A. De Rosa, A. Piva, Capactiy of the watermark channel: how many bits can be hidden within a digital image? in, Proceedings of SPIE, SPIE, vol. 3657, pp. 437–448, San Jose, Jan (1999)

    Google Scholar 

  15. M. Burnashav, On identification capacity of infinite alphabets or continuous time channel. IEEE Trans. Inf. Theory IT–46, 2407–2414 (2000)

    Google Scholar 

  16. N. Cai, K.Y. Lam, On identification secret sharing schemes. Inf. Comput. 184(2), 298–310 (2003)

    Article  MathSciNet  Google Scholar 

  17. I.J. Cox, M.L. Miller, A. Mckellips, Watermarking as communications with side information. Proc. IEEE 87(7), 1127–1141 (1999)

    Article  Google Scholar 

  18. I. Csiszár, J. K”orner, Information Theory: Coding Theorem for Discrete Memoryless Systems (Academic, New York, 1982)

    Google Scholar 

  19. I. Csiszár, P. Narayan, Common randomness and secret key generation with a helper. IEEE Trans. Inf. Theory 46(2), 344–366 (2000)

    Article  MathSciNet  Google Scholar 

  20. S.I. Gelfand, M.S. Pinsker, Coding for channels with random parameters. Probl. Control Inform. Theory 9, 19–31 (1980)

    MathSciNet  Google Scholar 

  21. U.M. Maurer, Secret key agreement by public discussion from common information. IEEE Trans. Inform. Theory. 39(3), 733–742 (1993)

    Article  MathSciNet  Google Scholar 

  22. N. Merhav, On random coding error exponents of watermarking codes. IEEE Trans. Inform. Theory 46(2), 420–430 (2000)

    Article  MathSciNet  Google Scholar 

  23. P. Moulin, J.A. O’Sulliovan, Information-theoretic analysis of information hiding, preprint (1999)

    Google Scholar 

  24. J.A. O’Sullivan, P. Moulin, J.M. Ettinger, Information theoretic analysis of steganography, in Proceedings of ISIT ‘98 297 (1998)

    Google Scholar 

  25. S.D. Servetto, C.I. Podilchuk, K. Ramchandran, Capacity issues in digital image watermarking, in Proceedings of ICIP ‘98 (1998)

    Google Scholar 

  26. Y. Steinberg, New converses in the theory of identification via channels. IEEE Trans. Inform. Theory 44, 984–998 (1998)

    Article  MathSciNet  Google Scholar 

  27. Y. Steinberg, N. Merhav, Indentification in the presence of side infromation with application to watermarking. IEEE Trans. Inform. Theory 47, 1410–1422 (2001)

    Article  MathSciNet  Google Scholar 

  28. S. Venkatesan, V. Anantharam, The common randomness capacity of a pair of independent dicrete memoryless channels. IEEE Trans. Inform. Theory 44, 215–224 (1998)

    Article  MathSciNet  Google Scholar 

  29. S. Venkatesan, V. Anantharam, The common randomness capacity of network of discret mamoryless channels. IEEE Trans. Inform. Theory IT-46, 367–387 (2000)

    Article  Google Scholar 

  30. R.W. Yeung, A First Course in Information Theory (Kluwer Academic, 2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bielefeld, Germany

    Rudolf Ahlswede

Authors
  1. Rudolf Ahlswede
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Bielefeld, Germany

    Alexander Ahlswede

  2. Faculty Mathematics and Computer Science, Friedrich-Schiller-University Jena, Jena, Germany

    Ingo Althöfer

  3. Institute for Communications Engineering, Technical University of Munich, München, Germany

    Christian Deppe

  4. Fachbereich Wirtschaft und Gesundheit, Fachhochschule Bielefeld, Bielefeld, Germany

    Ulrich Tamm

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Ahlswede, R. (2021). Watermarking Identification Codes with Related Topics on Common Randomness. In: Ahlswede, A., Althöfer, I., Deppe, C., Tamm, U. (eds) Identification and Other Probabilistic Models. Foundations in Signal Processing, Communications and Networking, vol 16. Springer, Cham. https://doi.org/10.1007/978-3-030-65072-8_16

Download citation

Publish with us

Policies and ethics

Search

Navigation