One of the key issues in wireless sensor networks is to design efficient and secure group key agreement scheme. The Merkle identity tree is firstly introduced, then an efficient scheme based on Merkle identity tree is proposed. With this scheme, the direct and secure communications between any subgroups without retransmission could be implemented. The security of the scheme can be assured under the complexity assumptions. The detailed analysis of the initialization procedure, subgroup key agreement procedure, group communication procedure and rekeying procedure when membership changes, including joining and leaving, shows that the scheme is efficient in computation and communication cost.
No takes yet. Share an insight, caveat, or question.
Chen et al. (2013) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: