An Energy and Communication Efficient Group Key in Sensor Networks using Elliptic Curve Polynomial
Abstract
Sensor nodes have limited computation and battery power, and are not very reliable. a sensor network needs to be secure against eavesdrop when it is deployed in hostile environments. in order to provide security at low cost, symmetric key based approaches [11] have been proposed. in [9], an elliptic curve cryptography based approach has been implemented to facilitate the public-key cryptography. However, these schemes become ineffective in terms memory usage, communication time and energy required with the rapidly growing network size. We propose an Energy and Communication Efficient Group key management (ECEG) scheme which reduces the usage of memory, communication and energy in sensors. This scheme designed based on the idea that each node is pre-loaded with a key chain and an elliptic curve. in our scheme instead of computing the key by collaborating with other nodes a point of the elliptic curve broadcasted from the base station is used to compute the key. the simulations conducted using TinyOS [15] shows that ECEG scheme significantly improves the communication and energy usage in computing the key over EccM [9]. © Springer-Verlag Berlin Heidelberg 2007.
Recommended Citation
B. Panja and S. K. Madria, "An Energy and Communication Efficient Group Key in Sensor Networks using Elliptic Curve Polynomial," Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4686 LNCS, pp. 153 - 171, Springer, Jan 2007.
The definitive version is available at https://doi.org/10.1007/978-3-540-74823-6_12
Department(s)
Computer Science
International Standard Book Number (ISBN)
978-354074822-9
International Standard Serial Number (ISSN)
1611-3349; 0302-9743
Document Type
Article - Conference proceedings
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2024 Springer, All rights reserved.
Publication Date
01 Jan 2007
