Coded cooperative data exchange for a secret key

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2014, Pages 776-780

  Courtade, Thomas A ^a   Halford, Thomas R ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b TRELLISWARE TECHNOLOGIES INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY; POLYNOMIAL APPROXIMATION;

EXCHANGE PROBLEMS; LINEAR CODES; LINEAR CODING; LINEAR TRANSMISSION; NP-HARD; POLYNOMIAL-TIME; SECRET KEY; SECRET KEY GENERATIONS;

ELECTRONIC DATA INTERCHANGE;

EID: 84906536511     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2014.6874938     Document Type: Conference Paper

References (9)

1. I. Csiszar and P. Narayan, "Secrecy capacities for multiple terminals, " IEEE Trans. on Inf. Theory, vol. 50, no. 12, pp. 3047 - 3061, Dec. 2004.
2. S. El-Rouayheb, A. Sprintson, and P. Sadeghi, "On coding for cooperative data exchange, " in IEEE Information Theory Workshop (ITW), Jan. 2010.
3. N. Milosavljevic, S. Pawar, S. El-Rouayheb, M. Gastpar, and K. Ramchandran, "Optimal deterministic polynomial-time data exchange for omniscience, " arXiv preprint:1108.6046 [cs.IT], Aug. 2011.
4. M. Gonen and M. Langberg, "Coded cooperative data exchange problem for general topologies, " in Proc. of IEEE International Symposium on Information Theory (ISIT), July 2012, pp. 2606-2610.
5. T. Courtade and R. Wesel, "Coded cooperative data exchange in multihop networks, " IEEE Trans. Inf. Theory, vol. 60, no. 2, pp. 1136-1158, 2014.
6. H. Tyagi, "Common information and secret key capacity, " IEEE Trans. on Inf. Theory, vol. 59, no. 9, pp. 5627-5640, 2013.
7. M. Yan and A. Sprintson, "Algorithms for weakly secure data exchange, " in Network Coding (NetCod), 2013 Intl. Symp. on IEEE, 2013, pp. 1-6.
8. M. Effros, S. El-Rouayheb, and M. Langberg, "An equivalence between network coding and index coding, " arXiv:1211.6660, Nov. 2012.
9. W. Ren and Q. Zhao, "A note on 'Algorithms for connected set cover problem and fault-tolerant connected set cover problem', " Theoretical Computer Science, vol. 412, no. 45, pp. 6451-6454, 2011.