An Authenticated Group Key Agreement Scheme for Wireless Sensor Networks Based on Bilinear Pairings

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.

Group key agreement protocol among terminals of the intelligent information system for mobile edge computing

“…This solution is suitable for networks with partial structure and provides authentication with minimal increase in communication and computational overhead. A dynamic and authentication GKA protocol is proposed in References [10][11][12], this scheme adopts bilinear pairing short signatures based on tri-trees and elliptic curves to avoid attacks by illegal members. A hierarchically scalable GKA scheme is proposed in References [13,14], in which members with different authorization levels share different secret information, the key update can only be performed in one cluster, so that the key update can be effectively reduced.…”