An identity-based key-exchange protocol
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Specifying and using a partitionable group communication service
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Authenticated group key agreement and friends
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Secure group communications using key graphs
IEEE/ACM Transactions on Networking (TON)
Key Agreement in Dynamic Peer Groups
IEEE Transactions on Parallel and Distributed Systems
Batch rekeying for secure group communications
Proceedings of the 10th international conference on World Wide Web
Reliable group rekeying: a performance analysis
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Authenticated Multi-Party Key Agreement
ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Communication-Efficient Group Key Agreement
IFIP/Sec '01 Proceedings of the IFIP TC11 Sixteenth Annual Working Conference on Information Security: Trusted Information: The New Decade Challenge
Key Establishment in Large Dynamic Groups Using One-Way Function Trees
IEEE Transactions on Software Engineering
Kronos: A Scalable Group Re-Keying Approach for Secure Multicast
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Secure Group Communication Using Robust Contributory Key Agreement
IEEE Transactions on Parallel and Distributed Systems
Tree-based group key agreement
ACM Transactions on Information and System Security (TISSEC)
The VersaKey framework: versatile group key management
IEEE Journal on Selected Areas in Communications
Performance optimization of region-based group key management in mobile ad hoc networks
Performance Evaluation
Offering data confidentiality for multimedia overlay multicast: Design and analysis
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
A conference key agreement protocol with fault-tolerant capability
Computer Standards & Interfaces
Reputation and audits for self-organizing storage
Proceedings of the workshop on Security in Opportunistic and SOCial networks
Efficient public key authentication in MANET
Proceedings of the International Conference on Advances in Computing, Communication and Control
An escrow-less identity-based group-key agreement protocol for dynamic peer groups
International Journal of Security and Networks
Secure group key agreement protocol based on chaotic Hash
Information Sciences: an International Journal
Secure communication between grid domains based on trust relationships and group keys
International Journal of Communication Networks and Distributed Systems
Fast transmission to remote cooperative groups: a new key management paradigm
IEEE/ACM Transactions on Networking (TON)
Mobile Information Systems - Emerging Wireless and Mobile Technologies
Hi-index | 0.00 |
We consider several distributed collaborative key agreement and authentication protocols for dynamic peer groups. There are several important characteristics which make this problem 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 may leave the group while new members may join. Instead of performing individual rekeying operations, i.e., recomputing the group key after every join or leave request, we discuss an interval-based approach of rekeying. We consider three interval-based distributed rekeying algorithms, or interval-based algorithms for short, for updating the group key: 1) the Rebuild algorithm; 2) the Batch algorithm; and 3) the Queue-batch algorithm. Performance of these three interval-based algorithms under different settings, such as different join and leave probabilities, is analyzed. We show that the interval-based algorithms significantly outperform the individual rekeying approach and that the Queue-batch algorithm performs the best among the three interval-based algorithms. More importantly, the Queue-batch algorithm can substantially reduce the computation and communication workload in a highly dynamic environment. We further enhance the interval-based algorithms in two aspects: authentication and implementation. Authentication focuses on the security improvement, while implementation realizes the interval-based algorithms in real network settings. Our work provides a fundamental understanding about establishing a group key via a distributed and collaborative approach for a dynamic peer group.