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

arXiv:2103.12252 · International Journal of Theoretical Physics

Multi-party Quantum Key Agreement Protocol with Authentication

Yiting Wu, Hong Chang, Gongde Guo, Song Lin

Published Oct 5, 2021• 15 citations
arXivHTMLPDF
DOI
10.1007/s10773-021-04954-2

Related papers

A measurement device independent multi-party quantum key agreement protocol with identity authentication

Guodong Li, Wen-Chuan Cheng, Qingle Wang +1 more

Quantum Information Processing•Dec 14, 2023•8 citations

Multi-party authenticated quantum key agreement protocol based on d-level single-particle states

Mengqing Yang, Hao Cao, Zepeng Zhuo +2 more

Quantum Information Processing•Apr 2, 2025•4 citations

Iterative two-party authentication quantum key agreement based on multi-information encoding

Chaonan Wang, Hongfeng Zhu, Wei Gao

Chinese Journal of Physics•Jan 12, 2025•3 citations

Authenticated multi-party key agreement

Mike Just, Serge Vaudenay B

Lecture notes in computer science•Jan 1, 1996•201 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

Two-party Mutual Authentication Quantum Key Agreement Protocol

Yefeng He, Yu-Ru Yue, Man Di +1 more

International Journal of Theoretical Physics•May 1, 2022•9 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.