Perfect secrecy, perfect omniscience and steiner tree packing

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 1288-1292

  Nitinawarat, S ^a   Barg, A ^a   Narayan, P ^a   Ye, C ^b   Reznik, A ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b INTERDIGITAL COMMUNICATIONS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL PROBLEM; CORRELATED SOURCES; MULTIGRAPHS; NETWORK MODELS; NOISELESS CHANNELS; NON-INTERACTIVE; PERFECT SECRECY; SECRET KEY; STEINER TREE PACKING; UPPER BOUND;

INFORMATION THEORY;

COMMUNICATION;

EID: 70449513070     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5205948     Document Type: Conference Paper

References (16)

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. I. Csiszár and P. Narayan, "Common randomness and secret key generation with a helper," IEEE Trans. Inform. Theory,vol. 46, pp. 344-366, March 2000.
3. I. Csiszár and P. Narayan, "Secrecy capacities for multiple terminals," IEEE Trans. Inform. Theory,vol. 50, pp. 3047-3061, December 2004.
4. I. Csiszár and P.Narayan, "Secrecy capacities for multiterminal channel models," Special Issue ofthe IEEE Trans. Inform. Theory on Information Theoretic Security,vol. 54, pp. 2437-2452, June 2008.
5. M. Grötschel, A. Martin and R. Weismantel, "Packing Steiner trees: A cutting plane algorithm and computational results," Mathematical Programming,vol. 72, pp. 125-145, February 1996.
6. Z. Li and B. Li, "Network coding in undirected networks," Proceedings of the 38th Annual Conference on Information Sciences and Systems,pp. 257-242, Princeton, NJ, March 2004.
7. U. M. Maurer, "Provably secure key distribution based on independent channels," presented at the IEEE Workshop Inform. Theory,Eindhoven, The Netherlands, June 1990.
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. C. St. J. A. Nash-Williams, "Edge disjoint spanning trees of finite graphs," J London Math. Soc.,36, pp. 445-450, 1961.
10. S. Nitinawarat, C. Ye, A. Barg, P. Narayan and A. Reznik,"Secret key generation for a pairwise independent network model," Proceedings of the IEEE International Symposium on Information Theory,pp. 10151019, Toronto, Ontario, Canada, July 2008.
11. S. Nitinawarat, C. Ye, A. Barg, P. Narayan and A. Reznik,"Common randomness, multiuser secrecy and tree packing," Proceedings of the 46th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, September 2008.
12. W. T. Tutte, "On the problem of decomposing a graph into nconnected factors," J London Math. Soc.,36, pp. 221-230, 1961.
13. Y. Wu, K. Jain and S.-Y. Kung, "A unification of network coding and tree-packing (routing) theorems," IEEE Trans. Inform. Theory,vol. 52, pp. 2398-2409, June 2006.
14. C. Ye and P. Narayan, "Secret key and private key constructions for simple multiterminal source models," Proceedings of the IEEE International Symposium on Information Theory,pp. 2133-2137, Adelaide, Australia, September 2005.
15. C. Ye and A. Reznik, "Group secret key generation algorithms," Proceedings of the IEEE International Symposium on Information Theory,pp. 2596-2600, Nice, France, June 2007.
16. C. Ye, A. Reznik and Y. Shah, "Extracting secrecy from jointly Gaussian random variables," Proceedings ofthe IEEE International Symposium on Information Theory,pp. 2593-2597, Seattle, USA, July 2006.