An Interval-based Contributory Key Agreement

Marimuthu Rajaram ； Thilagavathy Dorairaj Suresh

《International Journal of Network Security》 13卷2期 (2011/09) Pp. 92-97

https://doi.org/10.6633/IJNS.201109.13(2).04

並列摘要

Applications in Dynamic Peer Group are becoming increasing popular nowadays. There is a need for security services to provide group-oriented communication privacy and data integrity. It is important that members of the group can establish a common secret key for encrypting group communication. A secure distributed group key agreement and authentication protocol is required to handle this issue. A key tree approach has been proposed by other authors to distribute group key in such a way that the rekeying cost scales with the logarithm of the group size for a join or leave request. The efficiency of this key tree approach critically depends on whether the key tree remains balanced over time as members join or leave. Instead of performing individual re-keying operations, an interval-based approach of re-keying is adopted in the proposed scheme. The proposed interval based algorithms considered are Batch algorithm and the Queue-batch algorithm. The interval-based approach provides re-keying efficiency for dynamic peer groups while preserving both distributed and contributory properties. Performance of these interval-based algorithms under different join and leave probabilities is analyzed. The Queue-batch algorithm performs the best among the interval-based algorithms.

並列關鍵字

Authentication ； dynamic peer groups ； group key agreement ； re-keying ； secure group communication