A distributed multi-party key agreement protocol for dynamic collaborative groups using ECC
Journal of Parallel and Distributed Computing - 19th International parallel and distributed processing symposium
Key bundles and parcels: secure communication in many groups
Computer Networks: The International Journal of Computer and Telecommunications Networking
SEAL: A secure communication library for building dynamic group key agreement applications
Journal of Systems and Software
Dynamic Balanced Key Tree Management for Secure Multicast Communications
IEEE Transactions on Computers
Making an Agreement in an Order-Heterogeneous Group
NBiS '08 Proceedings of the 2nd international conference on Network-Based Information Systems
A protocol for reliably, flexibly, and efficiently making agreement among peers
International Journal of Web and Grid Services
Key management scheme for multi-layer secure group communication
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Key management scheme for multiple simultaneous secure group communication
IMSAA'09 Proceedings of the 3rd IEEE international conference on Internet multimedia services architecture and applications
A key management scheme for secure group communication using binomial key trees
International Journal of Network Management
TMPR-scheme for reliably broadcast messages among peer processes
International Journal of Grid and Utility Computing
Key distribution protocol for secure multicast with reduced communication delay
AMT'11 Proceedings of the 7th international conference on Active media technology
Towards network-on-chip agreement protocols
Proceedings of the tenth ACM international conference on Embedded software
| Hi-index | 0.00 |
We consider several distributed collaborative key agreement protocols for dynamic peer groups. This problem has several important characteristics which make it different from traditional secure group communication. They are (1) distributed nature in which there is no centralized key server, (2) collaborative nature in which the group key is contributory; i.e., each group member will collaboratively contribute its part to the global group key, and (3) dynamic nature in which existing members can leave the group while new members may join. Instead of performing individual rekey operations, i.e., recomputing the group key after every join or leave request, we consider an interval-based approach of rekeying. In particular, we consider three distributed algorithms for updating the group key: (1) the Rebuild algorithm, (2) the Batch algorithm, and (3) the Queue-batch algorithm. Performance of these distributed algorithms under different settings, such as different join and leave probabilities, is analyzed. We show that these three distributed algorithms significantly outperform the individual rekey algorithm, and that the Queue-batch algorithm performs the best among the three distributed algorithms. Moreover, the Queue-batch algorithm has the intrinsic property of balancing the computation/communication workload such that the dynamic peer group can quickly begin secure group communication. This provides a fundamental understanding about establishinga collaborative group key for a distributed dynamic peer group.