Linear perfect secret key agreement

2011 IEEE Information Theory Workshop, ITW 2011

Volumn , Issue , 2011, Pages 723-726

  Chan, Chung ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK LENGTHS; FINITE BLOCK LENGTH; MULTI TERMINALS; SECRECY CAPACITY; SECRET KEY AGREEMENT; SOURCE MODELS; UPPER BOUND;

INFORMATION THEORY;

EID: 83655191085     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2011.6089530     Document Type: Conference Paper

References (25)

1. C. Chan, publications. http://chungc.net63.net/pub, http://goo.gl/4YZLT.
2. I. Csiszár and P. Narayan, "Secrecy capacities for multiple terminals," IEEE Transactions on Information Theory, vol. 50, no. 12, Dec. 2004.
3. C. E. Shannon, "Communication theory of secrecy systems," Bell System Technical Journal, vol. 28, no. 4, pp. 656-715, 1949.
4. I. Csiszár and P. Narayan, "Secrecy capacities for multiterminal channel models," IEEE Transactions on Information Theory, vol. 54, no. 6, pp. 2437-2452, June 2008.
5. -, "Secrecy generation for multiple input multiple output channel models," in Proceedings of 2009 IEEE International Symposium on Information Theory, June 2009, pp. 2447-2451.
6. C. Chan, "Generating secret in a network," Ph. D. dissertation, Massachusetts Institute of Technology, 2010, see [1].
7. -, "Universal secure network coding by secret key agreement," see [1].
8. R. W. Yeung, Information Theory and Network Coding. Springer, 2008.
9. G. B. Dantzig and M. N. Thapa, Linear Programming. 1: Introduction. Springer-Verlag New York, 1997-2003.
10. S. Nitinawarat and P. Narayan, "Perfect omniscience, perfect secrecy, and steiner tree packing," IEEE Transactions on Information Theory, vol. 56, no. 12, pp. 6490-6500, December 2010.
11. C. Chan and L. Zheng, "Mutual dependence for secret key agreement," in Proceedings of 44th Annual Conference on Information Sciences and Systems, 2010, see [1].
12. T. Ho and D. S. Lun, Network Coding: An Introduction. Cambridge University Press, 2008.
13. A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency. Springer, 2002.
14. A. Frank, T. Király, and M. Kriesell, "On decomposing a hypergraph into k-connected sub-hypergraphs," Discrete Applied Mathematics, vol. 131, no. 2, pp. 373-383, September 2003.
15. J. Bang-Jensen and S. Thomassé, "Decompositions and orientations of hypergraphs," Preprint no. 10, Department of Mathematics and Computer Science, University of Southern Denmark, May 2001.
16. A. S. Avestimehr, S. N. Diggavi, and D. N. C. Tse, "Wireless network information flow: A deterministic approach," CoRR, vol. Abs/cs/0906.5394, 2009.
17. C. Chan, "The hidden flow of information," in 2011 IEEE International Symposium on Information Theory Proceedings (ISIT2011), St. Petersburg, Russia, Jul. 2011, see [1].
18. -, "Agreement of a restricted secret key," see [1].
19. M. Goemans, S. Iwata, and R. Zenklusen, "An algorithmic framework for wireless information flow," in Communication, Control, and Computing, 2009. Allerton 2009. 47th Annual Allerton Conference on, 30 2009-oct. 2 2009, pp. 294-300.
20. A. Schrijver, "Matroids and linking systems," Journal of Combinatorial Theory, Series B, vol. 26, no. 3, pp. 349-369, 1979.
21. T. Ho, M. Medard, R. Koetter, D. Karger, M. Effros, J. Shi, and B. Leong, "A random linear network coding approach to multicast," Information Theory, IEEE Transactions on, vol. 52, no. 10, pp. 4413-4430, oct. 2006.
22. C. Chan, "Delay of linear perfect secret key agreement," see [1].
23. H. Tyagi, P. Narayan, and P. Gupta, "When is a function securely computable?" CoRR, vol. Abs/1007.2945, 2010.
24. C. Chan, "Multiterminal secure source coding," see [1].
25. U. M. Maurer, "Conditionally-perfect secrecy and a provably-secure randomized cipher," J. Cryptol., vol. 5, pp. 53-66, January 1992.