Abstract
Watermarking identification codes were introduced by Y. Steinberg and N. Merhav. In their model they assumed that
(1) the attacker uses a single channel to attack the watermark and both,the information hider and the decoder, know the attack channel;
(2) the decoder either completely he knows the covertext or knows nothing about it.
Then instead of the first assumption they suggested to study more robust models and instead of the second assumption they suggested to consider the case where the information hider is allowed to send a secret key to the decoder according to the covertext.
In response to the first suggestion in this paper we assume that the attacker chooses an unknown (for both information hider and decoder) channel from a set of channels or a compound channel, to attack the watermark. In response to the second suggestion we present two models. In the first model according to the output sequence of covertext the information hider generates side information componentwise as the secret key. In the second model the only constraint to the key space is an upper bound for its rate.
We present lower bounds for the identification capacities in the above models, which include the Steinberg and Merhav results on lower bounds. To obtain our lower bounds we introduce the corresponding models of common randomness. For the models with a single channel, we obtain the capacities of common randomness. For the models with a compound channel, we have lower and upper bounds and the differences of lower and upper bounds are due to the exchange and different orders of the max–min operations.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ahlswede, R.: Channels with arbitrarily varying channel probability functions in the presence of noiseless feedback. Z. Wahrsch. verw. Gebiete 25, 239–252 (1973)
Ahlswede, R.: Elimination of correlation in random codes for arbitrarily varying channels. Z. Wahrsch. verw. Gebiete 44(2), 159–175 (1978)
Ahlswede, R.: Coloring hypergraphs: a new approach to multi-user source coding I. J. Combin. Inform. System Sci. 4(1), 76–115 (1979)
Ahlswede, R.: Coloring hypergraphs: a new approach to multi-user source coding II. J. Combin. Inform. System Sci. 5(3), 220–268 (1980)
Ahlswede, R.: General theory of information transfer, Preprint 97–118, SFB 343 Diskrete Strukturen in der Mathematik, Universität Bielefeld (1997); General theory of information transfer:updated, General Theory of Information Transfer and Combinatorics, a Special Issue of Discrete Applied Mathematics (to appear)
Ahlswede, R., Balakirsky, V.B.: Balakirsky, Identification by means of a random process (Russian). Problemy Peredachi Informatsii 32(1), 144–160 (1996); Translation in Problems Inform. Transmission 32(1), 123–138 (1996)
Ahlswede, R., Cai, N.: Information and control: matching channels. IEEE Trans. Inform. Theory 44(2), 542–563 (1998)
Ahlswede, R., Cai, N.: The AVC with noiseless feedback and maximal error probability: a capacity formula with a trichotomy. In: Althöfer, I., Cai, N., Dueck, G., Khachatrian, L., Pinsker, M.S., Sárközy, A., Wegener, I., Zhang, Z. (eds.) Numbers, Information and Complexity, special volume in honour of R. Ahlswede on occasion of his 60th birthday, pp. 151–176. Kluwer Academic Publishers, Boston (2000)
Ahlswede, R., Csiszár, I.: Common randomness in information theory and cryptography I, Secret sharing. IEEE Trans. Inform. Theory 39(4), 1121–1132 (1993)
Ahlswede, R., Csiszár, I.: Common randomness in information theory and cryptograpy II, CR capacity. IEEE Trans. Inform. Theory 44(1), 225–240 (1998)
Ahlswede, R., Dueck, G.: Identification via channels. IEEE Trans. Inform. Theory 35(1), 15–29 (1989)
Ahlswede, R., Dueck, G.: Identification in the presence of feedback - a discovery of new capacity formulas. IEEE Trans. Inform. Theory 35(1), 30–36 (1989)
Ahlswede, R., K”orner, J.: Source coding with side information and a converse for degraded broadcast channels. IEEE Trans. Information Theory 21(6), 629–637 (1975)
Kleinewächter, C.: On Identification. In: Ahlswede, R., Bäumer, L., Cai, N., Aydinian, H., Blinovsky, V., Deppe, C., Mashurian, H. (eds.) General Theory of Information Transfer and Combinatorics. LNCS, vol. 4123, pp. 62–83. Springer, Heidelberg (2006)
Ahlswede, R., Zhang, Z.: New directions in the theory of identification via channels. IEEE Trans. Inform. Theory 41(4), 1040–1050 (1995)
Barni, M., Bartolini, F., De Rosa, A., Piva, A.: Capactiy of the watermark channel: how many bits can be hidden within a digital image? In: Proc. SPIE, San Jose, CA, January 1999, vol. 3657, pp. 437–448 (1999)
Burnashav, M.: On identification capacity of infinite alphabets or continuous time channel. IEEE Trans. Inf. Theory 46, 2407–2414 (2000)
Cai, N., Lam, L.Y.: On identification secret sharing schemes. Information and Computation (to appear)
Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley, Chichester (1991)
Cox, I.J., Miller, M.L., Mckellips, A.: Watermarking as communications with side information. Proc. of IEEE 87(7), 1127–1141 (1999)
Csiszár, I.: Almost independence and secrecy capacity. Probl. Inform. Trans. 32, 40–47 (1996)
Csiszár, I., K”orner, J.: Information Theory: Coding Theorems for Discrete Memoryless Systems, Academic (1981)
Csiszár, I., Narayan, P.: Common randomness and secret key generation with a helper. IEEE Trans. Inform. Theory 46(2), 344–366 (2000)
Gelfand, S.I., Pinsker, M.S.: Coding for channels with random parameters. Problems of Control and Inform. Theory 9, 19–31 (1980)
Han, T.S., Verdú, S.: New results in the theory of identification via channels. IEEE Trans. Inform. Theory 38, 14–25 (1992)
Maurer, U.M.: Secret key argreenent by public discussion from common information. IEEE Trans. Inform. Theory 39, 733–742 (1993)
Merhav, N.: On random coding error exponents of watermarking codes. IEEE Trans. Inform. Theory 46(2), 420–430 (2000)
Moulin, P., O’Sulliovan, J.A.: Information-theoretic analysis of information hiding. IEEE Trans. Inform. Theory 49(3), 563–593 (2003)
O’Sullivan, J.A., Moulin, P., Ettinger, J.M.: Information theoretic analysis of steganography. In: Proc. ISIT 1998, p. 297 (1998)
Servetto, S.D., Podilchuk, C.I., Ramchandran, K.: Capacity issues in digital image watermarking. In: Proc. ICIP 1998 (1998)
Steinberg, Y.: New converses in the theory of identification via channels. IEEE Trans. Inform. Theory 44, 984–998 (1998)
Steinberg, Y., Merhav, N.: Indentification in the presence of side infromation with application to watermarking. IEEE Trans. Inform. Theory 47, 1410–1422 (2001)
Venkatesan, S., Anantharam, V.: The common randomness capacity of a pair of independent dicrete memoryless channels. IEEE Trans. Inform. Theory 44(1), 215–224 (1998)
Venkatesan, S., Anantharam, V.: The common randomness capacity of network of discret mamoryless channels. IEEE Trans. Inform. Theory 46(2), 367–387 (2000)
Yeung, R.W.: A First Course in Information Theory. Kluwer Academic, Dordrecht (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ahlswede, R., Cai, N. (2006). Watermarking Identification Codes with Related Topics on Common Randomness. In: Ahlswede, R., et al. General Theory of Information Transfer and Combinatorics. Lecture Notes in Computer Science, vol 4123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889342_7
Download citation
DOI: https://doi.org/10.1007/11889342_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46244-6
Online ISBN: 978-3-540-46245-3
eBook Packages: Computer ScienceComputer Science (R0)