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

A New Asymmetric Three-Party Key Agreement Protocol Based on Secure Multiparty Computation

Shanchuan Pang, Quanrun Li, Hu Ma, Jiaming Wen

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.1007/978-981-95-3551-4_3

Related papers

New identity-based three-party authenticated key agreement protocol with provable security

Hu Xiong, Zhong Chen, Fagen Li

Journal of Network and Computer Applications•Oct 23, 2012•18 citations

Secure and efficient key generation in new multi party key agreement protocol

P. Vijayalakshmi

•Jan 1, 2016•0 citations

Multiparty semiquantum key agreement without entanglement

Ming‐Ming Wang, Rui-Fan Han, Linming Gong

Abstract The key agreement protocols allow two or more users to negotiate a shared key for establishing a secure communication channel without a third trusted party in such a way that the shared key is determined by all authorized players rather than any subset of them. We propose the first real multiparty semiquantum key agreement (SQKA) protocols based on single-photons. Our protocols include only one quantum player, while the others are classical players who only need to measure and prepare states in the classical basis. We first present a symmetric three-party SQKA protocol, where two classical players can fairly negotiate a key with a quantum player by using single-photons as message carriers. Then we present an asymmetric SQKA protocol where a relatively low percentage of quantum states are used for eavesdropping detection. And we further extend them to an asymmetric multiparty SQKA protocol. Our SQKA protocols require fewer quantum resources than the previous SQKA protocols for classical players, especially without requirement of entanglement, which makes them easier to implement using current technologies. Our protocols are secure against external eavesdroppers and are fair against a minority of internal dishonest players.

Communications in Theoretical Physics•May 22, 2020•6 citations

A Key Agreement of the Improvements Based on Secure two-Party Computation

Junming Zhang

Secure Multiparty Computation protocol is an important area in cryptography.The research of multi-party computation was a subject of great importance in the international cryptographic circle.A key agreement scheme based on secure two-party computation is improved.Three schemes are proposed.It can be proved that even if Eve gets the same data as the receiver,the schemes are still secure.

Journal of Kaili University•Jan 1, 2011•0 citations

An Improved Secure Two-Party Computation Protocol

Yu Yu, Jussipekka Leiwo, A. Benjamin Premkumar

Lecture notes in computer science•Jan 1, 2005•1 citation

Interdomain Identity‐Based Key Agreement Schemes

Chun‐I Fan, Yi-Hui Lin, Tuan-Hung Hsu +1 more

In order to simplify key management, two‐party and three‐party key agreement schemes based on user identities have been proposed recently. Multiparty (including more than three parties) key agreement protocols, which also are called conference key schemes, can be applied to distributed systems and wireless environments, such as ad hoc networks, for the purpose of multiparty secure communication. However, it is hard to extend two‐ or three‐party schemes to multiparty ones with the guarantee of efficiency and security. In addition to the above two properties, interdomain environments should also be considered in key agreement systems due to diversified network domains. However, only few identity‐based multiparty conference key agreement schemes for single domain environments and none for interdomain environments were proposed in the literature and they did not satisfy all of the security attributes such as forward secrecy and withstanding impersonation. In this paper, we will propose a novel efficient single domain identity‐based multiparty conference key scheme and extend it to an interdomain one. Finally, we prove that the proposed schemes satisfy the required security attributes via formal methods.

Mathematical Problems in Engineering•Jan 1, 2014•0 citations
Abstract The key agreement protocols allow two or more users to negotiate a shared key for establishing a secure communication channel without a third trusted party in such a way that the shared key is determined by all authorized players rather than any subset of them. We propose the first real multiparty semiquantum key agreement (SQKA) protocols based on single-photons. Our protocols include only one quantum player, while the others are classical players who only need to measure and prepare states in the classical basis. We first present a symmetric three-party SQKA protocol, where two classical players can fairly negotiate a key with a quantum player by using single-photons as message carriers. Then we present an asymmetric SQKA protocol where a relatively low percentage of quantum states are used for eavesdropping detection. And we further extend them to an asymmetric multiparty SQKA protocol. Our SQKA protocols require fewer quantum resources than the previous SQKA protocols for classical players, especially without requirement of entanglement, which makes them easier to implement using current technologies. Our protocols are secure against external eavesdroppers and are fair against a minority of internal dishonest players.
In order to simplify key management, two‐party and three‐party key agreement schemes based on user identities have been proposed recently. Multiparty (including more than three parties) key agreement protocols, which also are called conference key schemes, can be applied to distributed systems and wireless environments, such as ad hoc networks, for the purpose of multiparty secure communication. However, it is hard to extend two‐ or three‐party schemes to multiparty ones with the guarantee of efficiency and security. In addition to the above two properties, interdomain environments should also be considered in key agreement systems due to diversified network domains. However, only few identity‐based multiparty conference key agreement schemes for single domain environments and none for interdomain environments were proposed in the literature and they did not satisfy all of the security attributes such as forward secrecy and withstanding impersonation. In this paper, we will propose a novel efficient single domain identity‐based multiparty conference key scheme and extend it to an interdomain one. Finally, we prove that the proposed schemes satisfy the required security attributes via formal methods.