Energy-Efficient Group Key Agreement for Wireless Networks

IEEE Transactions on Wireless Communications

Volumn 14, Issue 10, 2015, Pages 5552-5564

  Halford, Thomas R ^a,b   Courtade, Thomas A ^c,d,e   Chugg, Keith M ^a,f   Li, Xiaochen ^a   Thatte, Gautam ^a  

^a TRELLISWARE TECHNOLOGIES INC   (United States)

^b WPL Inc   (United States)

^c STANFORD UNIVERSITY   (United States)

^d Purdue University   (United States)

^e UNIVERSITY OF CALIFORNIA   (United States)

^f University of Southern California   (United States)

Author keywords

Ad hoc wireless networks; public key cryptography; wireless sensor networks

Indexed keywords

ALGORITHMS; CRYPTOGRAPHY; ENERGY EFFICIENCY; INFORMATION THEORY; MULTICASTING; POLYNOMIAL APPROXIMATION; PUBLIC KEY CRYPTOGRAPHY; WIRELESS NETWORKS; WIRELESS SENSOR NETWORKS;

AD HOC AND SENSOR NETWORKS; AD HOC WIRELESS NETWORKS; ARBITRARY DISTRIBUTION; COMPUTATIONAL REQUIREMENTS; DIFFIE-HELLMAN KEY EXCHANGE; LATTICE-BASED CRYPTOGRAPHY; MULTICAST TRANSMISSIONS; PUBLIC KEY ALGORITHMS;

WIRELESS AD HOC NETWORKS;

EID: 84959262661     PISSN: 15361276     EISSN: None     Source Type: Journal    
DOI: 10.1109/TWC.2015.2439675     Document Type: Article

References (44)

1. T. R. Halford, T. A. Courtade, and K. M. Chugg, "Energy-efficient, secure group key agreement for ad hoc networks," in Proc. IEEE Commun. Netw. Security Conf., Washington, DC, USA, Oct. 2013, pp. 181-188.
2. P. Sakarindr and N. Ansari, "Security services in group communications over wireless infrastructure, mobile ad hoc, and wireless sensor networks," IEEE Wireless Commun., vol. 14, no. 5, pp. 8-20, Oct. 2007.
3. K. Ren, W. Lou, B. Zhu, and S. Jajodia, "Secure and efficient multicast in wireless sensor networks allowing ad hoc group formation," IEEE Trans. Veh. Technol., vol. 58, no. 4, pp. 2018-2029, May 2009.
4. T. R. Halford, "Secure many-to-some communications," in Proc. IEEE Mil. Commyn. Conf., San Diego, CA, USA, Nov. 2013, pp. 243-247.
5. A. C. Atici, L. Batina, J. Fan, I. Verbauwhede, and S. B. Ors, "Lowcost implementation of NTRU for pervasive security," in Proc. Int. Conf. Appl.-Spec. Syst., Architect. Process., Leuven, Belgium, Jul. 2008, pp. 79-84.
6. J. E.Wieselthier, G. D. Nguyen, and A. Ephremides, "On the construction of energy-efficient broadcast and multicast trees in wireless networks," in Proc. IEEE Conf. Comput. Commun., Tel Aviv, Israel, Mar. 2000, pp. 585-594.
7. M. Steiner, G. Tsudik, and M. Waidner, "Key agreement in dynamic peer groups," IEEE Trans. Parallel Distrib. Syst., vol. 11, no. 8, pp. 769-780, Aug. 2000.
8. Y. Amir, Y. Kim, C. Nita-Rotaru, J. L. Schultz, and G. Tsudik, "Secure group communication using robust contributory key agreement," IEEE Trans. Parallel Distrib. Syst., vol. 15, no. 5, pp. 468-480, May 2004.
9. S. Jarecki, J. Kim, and G. Tsudik, "Flexible robust group key agreement," IEEE Trans. Parallel Distrib. Syst., vol. 22, no. 5, pp. 879-886, May 2011.
10. C. Boyd and A. Mathuria, Protocols for Authentication and Key Establishment. Berlin, Germany: Springer-Verlag, 2003.
11. W. Diffie and M. E. Hellman, "New directions in cryptography," IEEE Trans. Inf. Theory, vol. 22, no. 6, pp. 644-654, Nov. 1976.
12. M. Burmester and Y. Desmedt, "A secure and efficient conference key distribution system," in Advances in Cryptology - EUROCRYPT, vol. 950. Berlin, Germany: Springer-Verlag, 1995, pp. 275-286, ser. Lecture Notes in Computer Science.
13. J.-W. Ho, M. Wright, and S. K. Das, "ZoneTrust: Fast zone-based node compromise detection and revocation in wireless sensor networks using sequential hypothesis testing," IEEE Trans. Dependable Secure Comput., vol. 9, no. 4, pp. 494-511, Jul./Aug. 2012.
14. 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.
15. T. A. Courtade and T. R. Halford, "Coded cooperative data exchange for a secrect key," in Proc. IEEE Int. Symp. Inf. Theory, Honolulu, HI, USA, Jul. 2014, pp. 776-780.
16. T. T. Mapoka, "Group key management protocols for secure mobile multicast communication: A comprehensive survey," Int. J. Comput. Appl., vol. 84, no. 12, pp. 28-38, Dec. 2013.
17. B. E. Jung, "An efficient group key agreement protocol," IEEE Commun. Lett., vol. 10, no. 2, pp. 106-107, Feb. 2006.
18. I. Csiszár and P. Narayan, "Secrecy capacities for multiple terminals," IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 3047-3061, Dec. 2004.
19. C. Chan, "Linear perfect secret key agreement," in Proc. IEEE Inf. Theory Workshop, Paraty, Brazil, Oct. 2011, pp. 723-726.
20. M. Mukherjee and N. Kashyap, "On the communication complexity of secret key generation in the multiterminal source model," in Proc. IEEE Int. Symp. Inf. Theory, Honolulu, HI, USA, Jul. 2014, pp. 1151-1155.
21. S. Nitinawarat and P. Narayan, "Perfect omniscience, perfect secrecy and Steiner tree packing," IEEE Trans. Inf. Theory, vol. 56, no. 12, pp. 6490-6500, Dec. 2010.
22. H. Tyagi, "Common information and secret key capacity," IEEE Trans. Inf. Theory, vol. 59, no. 9, pp. 5627-5640, Sep. 2013.
23. S. Nitinawarat, C. Ye, A. Barg, P. Narayan, and A. Reznik, "Secret key generation for a pairwise independent network model," IEEE Trans. Inf. Theory, vol. 56, no. 12, pp. 6482-6489, Dec. 2010.
24. H. Tyagi, N. Kashyap, Y. Sankarasubramaniam, and K. Viswanathan, "Fault-tolerant secret key generation," in Proc. IEEE Int. Symp. Inf. Theory, Cambridge, MA, USA, Jul. 2012, pp. 1787-1791.
25. O. Goldreich, S. Goldwasser, and S. Micali, "How to construct random functions," J. ACM, vol. 33, no. 4, pp. 792-807, Oct. 1986.
26. S. El Rouayheb, A. Sprintson, and P. Sadeghi, "On coding for cooperative data exchange," in Proc. IEEE Inf. Theory Workshop, Cairo, Egypt, Jan. 2010, pp. 1-5.
27. M. Gonen and M. Langberg, "Coded cooperative data exchange problem for general topologies," in Proc. IEEE Int. Symp. Inf. Theory, Cambridge, MA, USA, Jul. 2012, pp. 2606-2610.
28. T. A. Courtade and R. D. Wesel, "Weighted universal recovery, practical secrecy, and an efficient algorithm for solving both," in Proc. Allerton Conf. Commun., Control, Comput., Monticello, IL, USA, Sep. 2011, pp. 1349-1357.
29. A. Scaglione and Y.-W. Hong, "Opportunistic large arrays: Cooperative transmission in wireless multihop ad hoc networks to reach far distances," IEEE Trans. Signal Process., vol. 51, no. 8, pp. 2082-2092, Aug. 2003.
30. T. R. Halford and K. M. Chugg, "Barrage relay networks," in Proc. Inf. Theory Appl. Workshop, San Diego, CA, USA, Feb. 2010, pp. 1-8.
31. F. Ferrari, M. Zimmerling, L. Mottola, and L. Theile, "Low-power wireless bus," in Proc. ACM Conf. Embedded Netw. SenSys, Toronto, ON, Canada, Nov. 2012, pp. 1-14.
32. N. Milosavljevic, S. Pawar, S. El Rouayheb, M. Gastpar, and K. Ramchandran, "Deterministic algorithm for the cooperative data exchange problem," in Proc. IEEE Int. Symp. Inf. Theory, St. Petersburg, Russia, Aug. 2011, pp. 410-414.
33. Y. Kim, A. Perrig, and G. Tsudik, "Simple and fault-tolerant key agreement for dynamic collaborative groups," in Proc. ACM Conf. Comput. Commun. Security, Athens, Greece, Nov. 2000, pp. 235-244.
34. L. Chen, NIST Special Publication 800-108: Recommendation for Key Derivation Using Pseudorandom Functions (Revised). Gaithersburg, MD, USA: National Institute of Standards and Technology, Oct. 2009.
35. S. Ruj, A. Nayak, and I. Stojmenovic, "Pairwise and triple key distribution in wireless sensor networks with applications," IEEE Trans. Comput., vol. 62, no. 11, pp. 2224-2237, Nov. 2013.
36. C. Vercellis, "A probabilistic analysis of the set covering problem," Ann. Oper. Res., vol. 1, no. 3, pp. 255-271, 1984.
37. O. A. Telelis and V. Zissimopoulos, "Absolute o(logm) error in approximating random set cover: An average case analysis," Inf. Process. Lett., vol. 94, no. 4, pp. 171-177, May 2005.
38. A. Demers et al., "Epidemic algorithms for replicated database maintenance," in Proc. ACM Symp. Principles Distrib. Comput., Vancouver, BC, Canada, Aug. 1987, pp. 1-12.
39. A. S. Akyurek and E. Uysal-Biyikoglu, "A low complexity distributed algorithm for computing minimum-depth multicast trees in wireless networks," in Proc. IEEE Mil. Commun. Conf., San Jose, CA, USA, Nov. 2010, pp. 1918-1923.
40. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed. Cambridge, MA, USA: MIT Press, 2002.
41. P. Gupta and P. R. Kumar, "Critical power for asymptotic connectivity in wireless networks," in Stochastic Analysis, Control, Optimization and Applications. Boston, MA, USA: Birkhaüser, 1998, pp. 547-566.
42. G. Anastasi, M. Conti, M. Di Francesco, and A. Passarella, "Energy conservation in wireless sensor networks: A survey," Ad Hoc Netw., vol. 7, no. 3, pp. 537-568, May 2009.
43. E. Barker and J. Kelsey, NIST Special Publication 800-90A: Recommendation for Random Number Generation Using Deterministic Random Bit Generators. Gaithersburg, MD, USA: National Institute of Standards and Technology, Jan. 2012.
44. W. Ren and Q. Zhao, "A note on 'Algorithms for connected set cover problem and fault-tolerant connected set cover problem'," Theor. Comput. Sci., vol. 412, no. 45, pp. 6451-6454, Oct. 2011.