Delay of linear perfect secret key agreement

2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011

Volumn , Issue , 2011, Pages 1128-1135

  Chan, Chung ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK LENGTHS; CODE CONSTRUCTION; SECRECY CAPACITY; SECRET KEY AGREEMENT; UPPER BOUND;

COMMUNICATION;

COMPUTATIONAL COMPLEXITY;

EID: 84856114829     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/Allerton.2011.6120294     Document Type: Conference Paper

References (18)

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. -, "Secrecy capacities for multiterminal channel models," IEEE Transactions on Information Theory, vol. 54, no. 6, pp. 2437-2452, June 2008.
4. -, "Secrecy generation for multiple input multiple output channel models," in Proceedings of 2009 IEEE International Symposium on Information Theory, June 2009, pp. 2447-2451.
5. C. Chan, "Generating secret in a network," Ph.D. dissertation, Massachusetts Institute of Technology, 2010, see [1].
6. -, "Linear perfect secret key agreement," in 2011 IEEE Information Theory Workshop Proceedings (ITW2011), Paraty, Brazil, Oct. 2011, see [1].
7. R. W. Yeung, Information Theory and Network Coding. Springer, 2008.
8. C. Chan, "Multiterminal secure source coding," see [1].
9. 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.
10. 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].
11. C. Chan, "The hidden flow of information," in 2011 IEEE International Symposium on Information Theory Proceedings (ISIT2011), St. Petersburg, Russia, Jul. 2011, see [1].
12. 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.
13. A. Schrijver, "Matroids and linking systems," Journal of Combinatorial Theory, Series B, vol. 26, no. 3, pp. 349-369, 1979.
14. 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.
15. A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency. Springer, 2002.
16. E. W. Weisstein, "Cramer's rule," From MathWorld-A Wolfram Web Resource. [Online]. Available: http://mathworld.wolfram.com/CramersRule.html
17. -, "Hadamard's maximum determinant problem," From MathWorld - A Wolfram Web Resource. [Online]. Available: http://mathworld.wolfram.com/ HadamardsMaximumDeterminantProblem.html
18. G. B. Dantzig and M. N. Thapa, Linear Programming. 1: Introduction. Springer-Verlag New York, 1997-2003.