CRTDH: an efficient key agreement scheme for secure group communications in wireless ad hoc networks

@inproceedings{BRZV05icc, abstract = {As a result of the growing popularity of wireless networks, in particular ad hoc networks, security over such networks has become very important. In this paper, we study the problem of secure group communications (SGC) and key management over ad hoc networks. We identify the key features of any SGC protocol for such networks. We also propose an efficient key agreement scheme for SGC. The scheme solves two important problems that exist in most current SGC schemes: requirement of member serialization and existence of a central entity. Besides this, the protocol also has many highly desirable properties such as contributory and efficient computation of group key, uniform work load for all the members, few rounds of rekeying (2 rounds for the initial key formation and join and 1 round for leave), and efficient support for high dynamics. These properties make the protocol well suited for wireless ad hoc networks.}, author = {Balachandran, R. K. and Ramamurthy, B. and Zou, Xukai and Vinodchandran, N. V. }, booktitle = {Communications, 2005. ICC 2005. 2005 IEEE International Conference on}, citeulike-article-id = {3000405}, doi = {http://dx.doi.org/10.1109/ICC.2005.1494522}, journal = {Communications, 2005. ICC 2005. 2005 IEEE International Conference on}, pages = {1123--1127 Vol. 2}, posted-at = {2008-07-15 00:52:34}, priority = {2}, title = {CRTDH: an efficient key agreement scheme for secure group communications in wireless ad hoc networks}, url = {http://dx.doi.org/10.1109/ICC.2005.1494522}, volume = {2}, year = {2005} }

TY - CONF ID - BRZV05icc L3 - citeulike-article-id:3000405 TI - CRTDH: an efficient key agreement scheme for secure group communications in wireless ad hoc networks T2 - Communications, 2005. ICC 2005. 2005 IEEE International Conference on JF - Communications, 2005. ICC 2005. 2005 IEEE International Conference on VL - 2 SP - 1123 EP - 1127 Vol. 2 N2 - As a result of the growing popularity of wireless networks, in particular ad hoc networks, security over such networks has become very important. In this paper, we study the problem of secure group communications (SGC) and key management over ad hoc networks. We identify the key features of any SGC protocol for such networks. We also propose an efficient key agreement scheme for SGC. The scheme solves two important problems that exist in most current SGC schemes: requirement of member serialization and existence of a central entity. Besides this, the protocol also has many highly desirable properties such as contributory and efficient computation of group key, uniform work load for all the members, few rounds of rekeying (2 rounds for the initial key formation and join and 1 round for leave), and efficient support for high dynamics. These properties make the protocol well suited for wireless ad hoc networks. AU - Balachandran, RK AU - Ramamurthy, B AU - Zou, Xukai AU - Vinodchandran, NV PY - 2005/// UR - http://dx.doi.org/10.1109/ICC.2005.1494522 ER -