Simultaneously generating multiple keys and multi-commodity flow in networks

2012 IEEE Information Theory Workshop, ITW 2012

Volumn , Issue , 2012, Pages 627-631

  Lai, Lifeng ^a   Ho, Siu Wai ^b  

^a University of Arkansas at Little Rock   (United States)

^b UNIVERSITY OF SOUTH AUSTRALIA   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ACHIEVABLE SUM RATES; CAPACITY REGIONS; CONSTANT FACTORS; KEY DISTRIBUTION; MIN-CUT; MULTI-COMMODITY FLOW; MULTICUTS; MULTIPLE KEYS; MULTIPLE PAIRS; SECRET KEY; SECURE COMMUNICATIONS; SECURE ROUTING; SUM-RATE; UPPER BOUND;

INFORMATION THEORY;

GRAPH THEORY;

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

References (11)

1. L. Lai, Y. Liang, and H. V. Poor, "A unified framework for key agreement over wireless fading channels," IEEE Trans. Inform. Forensics and Security, vol. 7, pp. 480-490, Apr. 2012.
2. R. Wilson, D. Tse, and R. A. Scholtz, "Channel identification: Secret sharing using reciprocity in ultrawideband channels," IEEE Trans. Inform. Forensics and Security, vol. 2, pp. 364-375, Sept. 2007.
3. T.-H. Chou, A. M. Sayeed, and S. C. Draper, "Minimum energy per bit for secret key acquisition over multipath wireless channels," in Proc. IEEE Intl. Symposium on Inform. Theory, (Seoul, Korea), Jun. 2009.
4. C. Ye, S. Mathur, A. Reznik, W. Trappe, and N. Mandayam, "Information-theoretic key generation from wireless channels," IEEE Trans. Inform. Forensics and Security, vol. 5, pp. 240-254, Jun. 2010.
5. I. Csiszár and P. Narayan, "Secrecy capacities for multiple terminals," IEEE Trans. Inform. Theory, vol. 50, pp. 3047-3061, Dec. 2004.
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, 2010.
7. C. Ye and A. Reznik, "Group secret key generation algorithms," in Proc. IEEE Intl. Symposium on Inform. Theory, (Nice, France), pp. 2896-2900, Jun. 2007.
8. R. Ahuja, T. Magnanti, and J. Orlin, Network Flows. Upper Saddle River, NJ: Prentice Hall, 1993.
9. 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.
10. T. Hu, "Multi-commodity network flows," Operations Research, vol. 11, pp. 344-360, May 1963.
11. N. Garg, V. Vazirani, and M. Yannakakis, "Appoximate max-flow min-(multi)cut theorems and their applications," SIAM Journal on Computing, vol. 25, pp. 235-251, Apr. 1996.