Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Diffie-Hellman key distribution extended to group communication
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Dynamic Group Diffie-Hellman Key Exchange under Standard Assumptions
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
The Decision Diffie-Hellman Problem
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
CLIQUES: A New Approach to Group Key Agreement
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Tree-based group key agreement
ACM Transactions on Information and System Security (TISSEC)
Group Key Agreement Efficient in Communication
IEEE Transactions on Computers
Enhanced of key agreement protocols resistant to a denial-of-service attack
Fundamenta Informaticae
A Robust Multi-Party Key Agreement Protocol Resistant to Malicious Participants
The Computer Journal
Authenticated multiple key exchange protocols based on elliptic curves and bilinear pairings
Computers and Electrical Engineering
A secure and scalable Group Key Exchange system
Information Processing Letters
Conference key distribution schemes for secure digital mobile communications
IEEE Journal on Selected Areas in Communications
A survey of security issues in multicast communications
IEEE Network: The Magazine of Global Internetworking
Towards formal analysis of key control in group key agreement protocols
SPACE'12 Proceedings of the Second international conference on Security, Privacy, and Applied Cryptography Engineering
A communication efficient group key distribution scheme for MANETs
NSS'12 Proceedings of the 6th international conference on Network and System Security
| Hi-index | 0.00 |
In 2008, based on the two-party Diffie-Hellman technique, Biswas proposed a contributory group key exchange protocol called the Group-DH protocol. This contributory property is an important one of group key agreement. Unfortunately, in this paper we show that the proposed Group-DH protocol is not a contributory group key exchange protocol. Therefore, we propose an improved group key exchange protocol with verifiably contributory property based on the same Diffie-Hellman technique. When an identical group key is constructed, each participant can confirm that his/her contribution is actually included in the group key. We show that the improved protocol is provably secure against passive attacks under the decisional Diffie-Hellman assumption. As compared to the previously proposed group key exchange protocols, our protocol provides contributiveness and the required computational cost is suitable for low-power participants in a network environment.