Abstract
We analyze wire-tape channels with secure feedback from the legitimate receiver. We present a lower bound on the transmission capacity (Theorem 1), which we conjecture to be tight and which is proved to be tight (Corollary 1) for Wyner’s original (degraded) wire-tape channel and also for the reversely degraded wire-tape channel for which the legitimate receiver gets a degraded version from the enemy (Corollary 2).
Somewhat surprisingly we completely determine the capacities of secure common randomness (Theorem 2) and secure identification (Theorem 3 and Corollary 3). Unlike for the DMC, these quantities are different here, because identification is linked to non-secure common randomness.
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
Ahlswede, R.: Universal coding. In: The 7th Hawai International Conference on System Science (January 1974); Published in [A21]
Ahlswede, R.: Coloring hypergraphs: A new approach to multi-user source coding, Part I. J. Comb. Inform. Syst. Sci. 4(1), 76–115 (1979); Part II 5(3), 220–268 (1980)
Ahlswede, R., Csiszár, I.: Common randomness in information theory and cryptography, Part I: Secret sharing. IEEE Trans. Inf. Theory 39(4), 1121–1132 (1993); Part II: CR capacity 44(1), 55–62 (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–39 (1989)
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., Zhang, Z.: New directions in the theory of identification via channels. IEEE Trans. Inform. Theory 41(4), 1040–1050 (1995)
Burnashev, M.: On identification capacity of infinite alphabets or continuous time. IEEE Trans. Inform. Theory 46, 2407–2414 (2000)
Cai, N., Lam, K.-Y.: On identification secret sharing scheme. Inform. and Comp. 184, 298–310 (2002)
Csiszár, I.: Almost independence and secrecy capacity. Probl. Inform. Trans. 32, 40–47 (1996)
Csiszár, I., Körner, J.: Broadcast channel with confidential message. IEEE Trans. Inform. Theory 24, 339–348 (1978)
Csiszár, I., Narayan, P.: Common randomness and secret key generation with a helper. IEEE Trans. Inform. Theory 46(2), 344–366 (2000)
Shannon, C.E.: A mathematical theory of communication. Bell. Sys. Tech. J. 27, 379–423 (1948)
Steinberg, Y.: New converses in the theory of identification via channels. IEEE Trans. Inform. Theory 44, 984–998 (1998)
Venkatesh, S., Anantharam, V.: The common randomness capacity of a network of discrete memoryless channels. IEEE Trans. Inform. Theory 46, 367–387 (2000)
Wyner, A.D.: The wiretape channel. Bell. Sys. Tech. J. 54, 1355–1387 (1975)
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). Transmission, Identification and Common Randomness Capacities for Wire-Tape Channels with Secure Feedback from the Decoder. 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_13
Download citation
DOI: https://doi.org/10.1007/11889342_13
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)