Coded Cooperative Data Exchange for a Secret Key

IEEE Transactions on Information Theory

Volumn 62, Issue 7, 2016, Pages 3785-3795

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

^a UNIVERSITY OF CALIFORNIA   (United States)

^b TRELLISWARE TECHNOLOGIES INC   (United States)

^c WPL Inc   (United States)

Author keywords

Coded cooperative data exchange; Network coding; secrecy; universal recovery

Indexed keywords

ACCESS CONTROL; CODES (SYMBOLS); ELECTRONIC DATA INTERCHANGE; NETWORK CODING; POLYNOMIAL APPROXIMATION;

EXCHANGE PROBLEMS; INTEGER NUMBERS; LINEAR CODES; LINEAR CODING; LINEAR TRANSMISSION; POLYNOMIAL-TIME; SECRECY; SECRET KEY GENERATIONS;

CRYPTOGRAPHY;

EID: 84976384048     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2016.2539347     Document Type: Conference Paper

References (32)

1. T. A. Courtade and T. R. Halford, "Coded cooperative data exchange for a secret key," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jun./Jul. 2014, pp. 776-780.
2. I. Csiszár and P. Narayan, "Secrecy capacities for multiple terminals," IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 3047-3061, Dec. 2004.
3. S. El Rouayheb, A. Sprintson, P. Sadeghi, "On coding for cooperative data exchange," in Proc. IEEE Inf. Theory Workshop (ITW), Jan. 2010, pp. 1-5.
4. T. A. Courtade and R. D. Wesel, "Coded cooperative data exchange in multihop networks," IEEE Trans. Inf. Theory, vol. 60, no. 2, pp. 1136-1158, Feb. 2014.
5. A. Sprintson, P. Sadeghi, G. Booker, S. El Rouayheb, "A randomized algorithm and performance bounds for coded cooperative data exchange," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jun. 2010, pp. 1888-1892.
6. A. Sprintson, P. Sadeghi, G. Booker, S. El Rouayheb, "Deterministic algorithm for coded cooperative data exchange," in Proc. ICST QShine, Nov. 2010, pp. 282-289.
7. T. A. Courtade and R. D. Wesel, "Efficient universal recovery in broadcast networks," in Proc. 48th Annu. Allerton Conf. Commun., Control, Comput. (Allerton), Oct. 2010, pp. 1542-1549.
8. T. A. Courtade and R. D. Wesel, "Weighted universal recovery, practical secrecy, an efficient algorithm for solving both," in Proc. 49th Annu. Allerton Conf. Commun., Control, Comput. (Allerton), Sep. 2011, pp. 1349-1357.
9. M. Gonen and M. Langberg, "Coded cooperative data exchange problem for general topologies," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jul. 2012, pp. 2606-2610.
10. N. Milosavljevic, S. Pawar, S. El Rouayheb, M. Gastpar, K. Ramchandran. (2012). "Data exchange problem with helpers." [Online]. Available: http://arxiv.org/abs/1202.1612
11. N. Milosavljevic, S. Pawar, S. El Rouayheb, M. Gastpar, K. Ramchandran. (Apr. 2011). "Optimal deterministic polynomialtime data exchange for omniscience." [Online]. Available: http://arxiv.org/abs/1108.6046
12. S. E. Tajbakhsh, P. Sadeghi, R. Shams, "A generalized model for cost and fairness analysis in coded cooperative data exchange," in Proc. Int. Symp. Netw. Coding (NetCod), Beijing, China, Jul. 2011, pp. 1-6.
13. D. Ozgul and A. Sprintson, "An algorithm for cooperative data exchange with cost criterion," in Proc. Inf. Theory Appl. Workshop (ITA), Feb. 2011, pp. 1-4.
14. I.-H. Hou, Y.-P. Hsu, A. Sprintson, "Truthful and non-monetary mechanism for direct data exchange," in Proc. 51st Annu. Allerton Conf. Commun., Control, Comput. (Allerton), Monticello, IL, USA, Oct. 2013, pp. 406-412.
15. C. Chan and L. Zheng, "Mutual dependence for secret key agreement," in Proc. 44th Annu. Conf. Inf. Sci. Syst. (CISS), Mar. 2010, pp. 1-6.
16. C. Chan, "Generating secret in a network," Ph.D. dissertation, Dept. Elect. Eng. Comput. Sci., Massachusetts Inst. Technol., Cambridge, MA, USA, 2010.
17. C. Chan, "Linear perfect secret key agreement," in Proc. IEEE Inf. Theory Workshop Process. (ITW), Oct. 2011, pp. 723-726.
18. H. Tyagi, "Common information and secret key capacity," IEEE Trans. Inf. Theory, vol. 59, no. 9, pp. 5627-5640, Sep. 2013.
19. M. Mukherjee and N. Kashyap. (2014). "On the communication complexity of secret key generation in the multiterminal source model." [Online]. Available: http://arxiv.org/abs/1401.1117
20. M. Yan and A. Sprintson, "Algorithms for weakly secure data exchange," in Proc. Int. Symp. Netw. Coding (NetCod), 2013, pp. 1-6.
21. S. H. Dau, W. Song, C. Yuen. (2014). "On the existence of MDS codes over small fields with constrained generator matrices." [Online]. Available: http://arxiv.org/abs/1401.3807
22. T. R. Halford, T. A. Courtade, K. M. Chugg, X. Li, G. Thatte, "Energy-efficient group key agreement for wireless networks," IEEE Trans. Wireless Comms., vol. 14, no. 10, pp. 5552-5564, Oct. 2015.
23. S. Jaggi et al., "Polynomial time algorithms for multicast network code construction," IEEE Trans. Inf. Theory, vol. 51, no. 6, pp. 1973-1982, Jun. 2005.
24. M. Effros, S. El Rouayheb, M. Langberg. "An equivalence between network coding and index coding," IEEE Trans. Inf. Theory, vol. 61, no. 5, pp. 2478-2487, 2015.
25. N. Alon, E. Lubetzky, U. Stav, A. Weinstein, A. Hassidim, "Broadcasting with side information," in Proc. IEEE 49th Annu. IEEE Symp. Found. Comput. Sci. (FOCS), Oct. 2008, pp. 823-832.
26. E. Lubetzky and U. Stav, "Nonlinear index coding outperforming the linear optimum," IEEE Trans. Inf. Theory, vol. 55, no. 8, pp. 3544-3551, Aug. 2009.
27. A. Blasiak, R. Kleinberg, E. Lubetzky, "Lexicographic products and the power of non-linear network coding," in Proc. IEEE 52nd Annu. Symp. Found. Comput. Sci. (FOCS), Oct. 2011, pp. 609-618.
28. S. Nitinawarat and P. Narayan, "Perfect omniscience, perfect secrecy, Steiner tree packing," IEEE Trans. Inf. Theory, vol. 56, no. 12, pp. 6490-6500, Dec. 2010.
29. C. S. J. A. Nash-Williams, "Edge-disjoint spanning trees of finite graphs," J. London Math. Soc., vol. 1, no. 1, pp. 445-450, 1961.
30. W. T. Tutte, "On the problem of decomposing a graph into n connected factors," J. London Math. Soc., vol. 1, no. 1, pp. 221-230, 1961.
31. A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency. Berlin, Germany: Springer-Verlag, 2003.
32. H. Tyagi, N. Kashyap, Y. Sankarasubramaniam, K. Viswanathan, "Fault-tolerant secret key generation," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jul. 2012, pp. 1787-1791.