Transmission, Identification and Common Randomness Capacities for Wire-Tape Channels with Secure Feedback from the Decoder
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.
KeywordsTransmission Capacity Secret Sharing Scheme Legal User Input Alphabet Security Criterion
Unable to display preview. Download preview PDF.
- 1.Ahlswede, R.: Universal coding. In: The 7th Hawai International Conference on System Science (January 1974); Published in [A21]Google Scholar
- 2.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)Google Scholar
- 3.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)Google Scholar
- 6.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)Google Scholar
- 10.Csiszár, I.: Almost independence and secrecy capacity. Probl. Inform. Trans. 32, 40–47 (1996)Google Scholar