Secrecy capacities for multiple terminals

IEEE Transactions on Information Theory

Volumn 50, Issue 12, 2004, Pages 3047-3061

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

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

Common randomness; Multiple source; Private key; Public discussion; Secrecy capacity; Security index; Slepian Wolf constraints; Wiretap

Indexed keywords

CONSTRAINT THEORY; CRYPTOGRAPHY; DATA PRIVACY; MATHEMATICAL MODELS; SECURITY OF DATA;

COMMON RANDOMNESS; MULTIPLE SOURCE; PRIVATE KEY; PUBLIC DISCUSSION; SECRECY CAPACITY; SECURITY INDEX; SLEPIAN-WOLF CONSTRAINTS; WIRETAP;

DATA COMMUNICATION SYSTEMS;

EID: 10644270917     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.838380     Document Type: Article

References (14)

1. R. Ahlswede and I. Csiszár, "Common randomness in information theory and cryptography, part I: Secret sharing," IEEE Trans. Inform. Theory, vol. 39, pp. 1121-1132, July 1993.
2. R. Ahlswede and I. Csiszár, "Common randomness in information theory and cryptography, part II: CR capacity," IEEE Trans. Inform. Theory vol. 44, pp. 225-240, Jan. 1998.
3. T. M. Cover, "A proof of the data compression theorem of Slepian and Wolf for ergodic sources," IEEE Trans. Inform. Theory, vol. IT-21, pp. 226-228, Mar. 1975.
4. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1982.
5. I. Csiszár, "Almost independence and secrecy capacity," Probl. Pered. Inform., vol. 32, no. 1, pp. 48-57, 1996.
6. I. Csiszár and P. Narayan, "Common randomness and secret key generation with a helper," IEEE Trans. Inform. Theory, vol. 46, pp. 344-366, Mar. 2000.
7. H. O. Georgii, Gibbs Measures and Phase Transitions. Berlin, Germany: de Gruyter, 1988.
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. U. M. Maurer, "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. 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: Springer-Verlag, 1997, pp. 307-321.
11. U. M. Maurer and S. Wolf, "Information-theoretic key agreement: From weak to strong secrecy for free," in Proc. EUROCRYPT 2000 (Lecture notes in Computer Science). Berlin, Germany: Springer-Verlag, 2000, pp. 352-368.
12. R. Renner and S. Wolf, "New bounds in secret-key agreement: The gap between formation and secrecy extraction," in Proc. EUROCRYPT 2003 (Lecture notes in Computer Science). Berlin, Germany: Springer-Verlag, 2003.
13. A. Schrijver, Theory of Linear and Integer Programming. New York: Wiley, 1986.
14. A. D. Wyner, J. K. Wolf, and F. M. J. Willems, "Communicating via a processing broadcast satellite," IEEE Trans. Inform. Theory, vol. 48, pp. 1243-1249, June 2002.