Research Article
Computationally and Resource Efficient Group Key Agreement for Ad Hoc Sensor Networks
@INPROCEEDINGS{10.1109/COMSWA.2007.382601, author={Dungara Ram Choudhary and Dev Anshul and Suman Roy and Chandra Shekhara Thejaswi}, title={Computationally and Resource Efficient Group Key Agreement for Ad Hoc Sensor Networks}, proceedings={2nd International IEEE Conference on Communication System Software and Middleware}, publisher={IEEE}, proceedings_a={COMSWARE}, year={2007}, month={7}, keywords={Computational and Memory Requirements Dynamic Peer Groups Galois Field (GF(q)) Group Key Agreement Secure Group Communication Session Key Symmetric Polynomials Wireless Sensor Networks}, doi={10.1109/COMSWA.2007.382601} }
- Dungara Ram Choudhary
Dev Anshul
Suman Roy
Chandra Shekhara Thejaswi
Year: 2007
Computationally and Resource Efficient Group Key Agreement for Ad Hoc Sensor Networks
COMSWARE
IEEE
DOI: 10.1109/COMSWA.2007.382601
Abstract
Secure and reliable group communication is an important aspect of security in distributed ad hoc sensor networks. Most sensors are built to be inexpensive, low power devices and consequently have limited computational and communication resources. Constraints in resources make most conventional security protocols, such as Diffie-Hellman key exchange impractical. This work adapts existing work on tree-based group key agreement that combines key trees with Diffie-Hellman key exchange, by replacing expensive public key operations with relatively cheaper symmetric key operations. The modular exponentiations in Zn* used in Diffle-Hellman key exchange are replaced by polynomial evaluations in GF(2m) Galois fields, thereby reducing the code space and time complexity requirements for the protocols substantially. This makes the protocol adaptable for use on resource-constrained sensor networks. We also focus on secure and efficient group key management in the case of group mutation. Our group key management scheme will set up a per-session shared secret key among the group members when new members join or existing members leave the group. We also discuss a performance analysis of our scheme wherein we show that our protocol is efficient in terms of computational and memory requirements.