A communication-computation efficient group key algorithm for large and dynamic groups

Authors:
Shanyu Zheng;David Manz;Jim Alves-Foss
Affiliations:
Department of Computer Science, Center for Secure and Dependable Systems, University of Idaho, Moscow;Department of Computer Science, Center for Secure and Dependable Systems, University of Idaho, Moscow;Department of Computer Science, Center for Secure and Dependable Systems, University of Idaho, Moscow
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2007

Citing 14
Cited 2

Diffie-Hellman key distribution extended to group communication

CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Specifying and using a partitionable group communication service

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Communication complexity of group key distribution

CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Authenticated group key agreement and friends

CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Simple and fault-tolerant key agreement for dynamic collaborative groups

Proceedings of the 7th ACM conference on Computer and communications security
Communication-efficient group key agreement

Sec '01 Proceedings of the 16th international conference on Information security: Trusted information: the new decade challenge
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
Efficient and Secure Conference-Key Distribution

Proceedings of the International Workshop on Security Protocols
The Decision Diffie-Hellman Problem

ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
On the Performance of Group Key Agreement Protocols

ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Tree-based group key agreement

ACM Transactions on Information and System Security (TISSEC)
Group Key Agreement Efficient in Communication

IEEE Transactions on Computers
On the performance of group key agreement protocols

ACM Transactions on Information and System Security (TISSEC)
SSH: secure login connections over the internet

SSYM'96 Proceedings of the 6th conference on USENIX Security Symposium, Focusing on Applications of Cryptography - Volume 6

Design of efficient ternary-tree based group key agreement protocol for dynamic groups

COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Scalable group key management protocol based on key material transmitting tree

ISPEC'07 Proceedings of the 3rd international conference on Information security practice and experience

Quantified Score

Hi-index	0.00

Visualization

Abstract

The management of secure communication among groups of participants requires a set of secure and efficient operations. In this paper we extend existing work to present a Communication-Computation Efficient Group Key Algorithm (CCEGK) designed to provide both efficient communication and computation, addressing performance, security and authentication issues of CCEGK. Additionally, we compare CCEGK with three other leading group key algorithms, EGK, TGDH, and STR. An analytical comparison of all algorithms revealed eight similar methods: add, remove, merge, split, mass add, mass remove, initialize, and key refresh. Comparing the cost in terms of communication and computation, we found CCEGK to be more efficient across the board.