Secure group communications using key graphs
IEEE/ACM Transactions on Networking (TON)
Simple and fault-tolerant key agreement for dynamic collaborative groups
Proceedings of the 7th ACM conference on Computer and communications security
Key Agreement in Dynamic Peer Groups
IEEE Transactions on Parallel and Distributed Systems
A Secure Audio Teleconference System
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
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
A survey of key management for secure group communication
ACM Computing Surveys (CSUR)
Tree-based group key agreement
ACM Transactions on Information and System Security (TISSEC)
On the performance of group key agreement protocols
ACM Transactions on Information and System Security (TISSEC)
Dynamic group key agreement in tree-based setting
ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
Scalable rekeying for dynamic groups using key path compression
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
ACMOS'10 Proceedings of the 12th WSEAS international conference on Automatic control, modelling & simulation
WSEAS Transactions on Computers
| Hi-index | 0.00 |
Decentralized group key management schemes for supporting secure group communication systems have been studied in the two flavors of contributory key agreement and decentralized key distribution. However, the primary focus has been on the former because the latter have been criticized for additional overheads of establishing secure channels and for the possibility of weak keys produced by the generating entity. In this work we develop a novel decentralized key distribution that uses public-key trees to eliminate the overheads of establishing secure channels and employs a practical approach of partial contribution to minimize the possibility of weak keys. The result is a simple and secure scheme whose performance is significantly better than previous schemes that involve contribution or distribution.