Common randomness and secret key generation with a helper

IEEE Transactions on Information Theory

Volumn 46, Issue 2, 2000, Pages 344-366

  Csiszár, Imre ^a,b   Narayan, Prakash ^a,c  

^a IEEE

^b INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^c UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL CAPACITY; CONSTRAINT THEORY; CORRELATION THEORY; DATA PRIVACY; RANDOM PROCESSES; SECURITY OF DATA;

DISCRETE MEMORYLESS MULTIPLE SOURCES; MULTIUSER INFORMATION THEORY; WIRETAPPER;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 0033891095     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.825796     Document Type: Article

References (14)

1. R. Ahlswede and V. B. Balakirsky, "Identification under random processes," Probl. Pered. Inform. (Special issue devoted to M. S. Pinsker), vol. 32, no. 1, pp. 144-160, 1996.
2. R. Ahlswede and I. Csisza"r, "Common randomness in information theory and cryptography, Part I: Secret sharing," IEEE Trans. Inform. Theory, vol. 39, pp. 1121-1132, July 1993.
3. _, "Common randomness in information theory and cryptography, Part II: CR capacity," IEEE Trans. Inform. Theory, vol. 44, pp. 225-240, Jan. 1998.
4. C. H. Bennett, G. Brassard, C. Crépeau, and U. M. Maurer, "Generalized privacy amplification," IEEE Trans. Inform. Theory, vol. 41, pp. 1915-1923, Nov. 1995.
5. I. Csiszár, "Almost independence and secrecy capacity," Probl. Pered. Inform. (Special issue devoted to M. S. Pinsker), vol. 32, no. 1, pp. 48-57, 1996.
6. I. Csiszâr and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York, NY: Academic, 1981.
7. P. Gács and J. Körner, "Common information is far less than mutual information," Probl. Contr. Inform. Theory, vol. 21, pp. 149-162, 1973.
8. U. M. Maurer, "Secret key agreement by public discussion from common information," IEEE Trans. Inform. Theory, vol. 39, pp. 733-742, May 1993.
9. _, "The strong secret key rate of discrete random triples," in Communications and Cryptography: Two Sides of One Tapestry, R. E. Blahut et al., Eds. Norwell, MA: Kluwer, 1994, ch. 26, pp. 271-285.
10. _, "Information-theoretically secure secret-key agreement by NOT authenticated public discusion," in Advances in Cryptology-EURO-CRYPT '97 Lecture Notes in Computer Science, W. Fumy, Ed. New York, NY: Springer, 1997, pp. 209-225.
11. U. Maurer and S. Wolf, "Privacy amplification secure against active adversaries," in Advances in Cryptology-CRYPTO '97 Lecture Notes in Computer Science, B. Kaliski, Ed. New York, NY: Springer, 1997, pp. 307-321.
12. S. Venkatesan and V. Anantharam, "The common radomness capacity of a pair of independent discrete memoryless channels," IEEE Trans. Inform. Theory, vol. 44, pp. 215-224, Jan. 1998.
13. _, "The common randomness capacity of a network of discrete memoryless channels," IEEE Trans. Inform. Theory, to appear.
14. H. S. Witsenhausen, "On sequences of pairs of dependent random variables," SIAM J. Appl. Math., vol. 38, pp. 100-113, 1975.