A communication-efficient and fault-tolerant conference-key agreement protocol with forward secrecy
Journal of Systems and Software
Efficient and provably secure password-based group key agreement protocol
Computer Standards & Interfaces
An efficient dynamic group key agreement protocol for imbalanced wireless networks
International Journal of Network Management
A novel convinced diffie-hellman computation scheme and its cryptographic application
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part IV
A framework for robust group key agreement
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
By its very nature, a non-authenticated multi-party key agreement protocol cannot provide participant and message authentication, so it must rely on an authenticated network channel. This paper presents the inability of two famous multi-party key agreement protocols to withstand malicious participant attacks, even though their protocols are based on the authenticated network channel. This attack involves a malicious participant disrupting the multi-party key agreement among honest participants. In this case, other honest participants do not correctly agree on a common key. Obviously, the malicious participant cannot obtain the common key either, and the communication confidentiality among participants is not breached. However, in some emergency situations or applications, a multi-party key agreement protocol design that is resistant to malicious participants is useful. Therefore, in this paper, a non-authenticated multi-party key agreement protocol resistant to malicious participants is proposed. The proposed robust protocol requires constant rounds to establish a common key. Each participant broadcasts a constant number of messages. Under the assumption of the Decision Diffie--Hellman problem and the random oracle model, we will show that the proposed protocol is provably secure against passive adversaries and malicious participants.