Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Authenticated multi-party key agreement

Mike Just, Serge Vaudenay B

Published Jan 1, 1996• 201 citations
Publisher
DOI
10.1007/bfb0034833

Related papers

New scheme of ID-based authenticated multi-party key agreement

Xueyan Liu, Qiang ZHANG, Caifen Wang

Journal of Computer Applications•Jun 17, 2011•1 citation

ID-based Authenticated Two Round Multi-Party Key Agreement.

Xinjun Du, Ying Wang, Jianhua Ge +1 more

•Jan 1, 2003•39 citations

ID-based Multi-party Authenticated Key Agreement Protocols from Multilinear Forms

Hyung Mok Lee, Kyung Ju Ha, Kyo Min Ku

Lecture notes in computer science•Jan 1, 2005•9 citations

Multi-party Quantum Key Agreement Protocol with Authentication

Yiting Wu, Hong Chang, Gongde Guo +1 more

arXiv:2103.12252•International Journal of Theoretical Physics•Oct 5, 2021•15 citations

Improved two-party authenticated key agreement protocol

Zhang Long-xiang

Journal of Computer Applications•May 27, 2013•0 citations

A Robust Multi-Party Key Agreement Protocol Resistant to Malicious Participants

Yuh‐Min Tseng

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.

The Computer Journal•May 3, 2005•33 citations
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.