Fault-tolerant secret key generation

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2012, Pages 1787-1791

  Tyagi, Himanshu ^a   Kashyap, Navin ^b   Sankarasubramaniam, Yogesh ^c   Viswanathan, Kapali ^c  

^a UNIVERSITY OF MARYLAND   (United States)

^b INDIAN INSTITUTE OF SCIENCE   (India)

^c HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIDIRECTIONAL SWITCH; COMPLETE GRAPHS; CORRELATED DATA; DROP-OUT; FAULT-TOLERANT; MOBILE NODES; NETWORK MODELS; NON-INTERACTIVE PROTOCOLS; SECRET KEY; UPPER BOUND;

INFORMATION THEORY;

DATA PROCESSING;

EID: 84867537040     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2012.6283586     Document Type: Conference Paper

References (7)

1. C. Chan and L. Zheng, "Mutual dependence for secret key agreement," in Proceedings of 44th Annual Conference on Information Sciences and Systems (CISS), 2010.
2. I. Csiszár and J. Körner, Information theory: Coding Theorems for Discrete Memoryless Channels. 2nd Edition. Cambridge University Press, 2011.
3. I. Csiszár and P. Narayan, "Secrecy capacities for multiple terminals," IEEE Trans. Inform. Theory, vol. 50, no. 12, pp. 3047-3061, 2004.
4. M. Loéve, Probability Theory. D. Van Nostrand Company, Inc, 1960.
5. S. Nitinawarat and P. Narayan, "Perfect omniscience, perfect secrecy, and Steiner tree packing," IEEE Trans. Inform. Theory, vol. 56, no. 12, pp. 6490 - 6500, December 2010.
6. S. Nitinawarat, C. Ye, A.Barg, P. Narayan, and A. Reznik, "Secret key generation for a pairwise independent network model," IEEE Trans. Inform. Theory, vol. 56, no. 12, pp. 6482 - 6489, December 2010.
7. M. Steiner, G. Tsudik, and M. Waidner, "Key agreement in dynamic peer groups," IEEE Trans. on Parallel and Distributed Systems, vol. 11, no. 8, pp. 769-780, 2000.