Abstract

Designing efficient and reliable group key agreement scheme is one of the key issues in wireless sensor networks. An authenticated group key agreement scheme is proposed, which based on ternary tree and short signature using bilinear pairings on elliptic curve. In the proposed scheme, five authenticated two-party and three-party key agreement algorithms are adopted. The security of the group key agreement scheme can be assured under the complexity assumptions. The analysis of the initial agreement procedure, rekeying procedure when membership changes, includes joining and leaving, shows that the scheme is efficient in computation and communication cost.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call