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

Applied Mathematics and Computation

Multi-party key agreement protocols with cheater identification

Yuh‐Min Tseng

Published Feb 4, 2003• 5 citations
Publisher
DOI
10.1016/s0096-3003(02)00537-4

Related papers

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

P. Vijayalakshmi

•Jan 1, 2016•0 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•16 citations

Separating Broadcast from Cheater Identification

Yashvanth Kondi, Divya Ravi

Secure Multiparty Computation (MPC) protocols that achieve Identifiable Abort (IA) guarantee honest parties that if they are denied output, they will be notified of the identity of at least one corrupt party. Cheater identification provides recourse in the event of a protocol failure, and in some settings---such as key management---can even be desired over Guaranteed Output Delivery. However, unlike the weaker security with abort setting, IA protocols make integral use of a broadcast channel.

ACM SIGSAC Conference on Computer and Communications Security (CCS)•Nov 19, 2025•2 citations

Authenticated multi-party key agreement

Mike Just, Serge Vaudenay B

Lecture notes in computer science•Jan 1, 1996•195 citations

Catching MPC Cheaters: Identification and Openability.

Robert K. Cunningham, Benjamin W. Fuller, Sophia Yakoubov

Secure multi-party computation (MPC) protocols do not completely prevent malicious parties from cheating or disrupting the computation. We augment MPC with three new properties to discourage cheating. First is a strengthening of identifiable abort, called completely identifiable abort, where all parties who do not follow the protocol will be identified as cheaters by each honest party. The second is completely identifiable auditability, which means that a third party can determine whether the computation was performed correctly (and who cheated if it was not). The third is openability, which means that a distinguished coalition of parties can recover the MPC inputs.

•Jan 1, 2016•0 citations
Secure multi-party computation (MPC) protocols do not completely prevent malicious parties from cheating or disrupting the computation. We augment MPC with three new properties to discourage cheating. First is a strengthening of identifiable abort, called completely identifiable abort, where all parties who do not follow the protocol will be identified as cheaters by each honest party. The second is completely identifiable auditability, which means that a third party can determine whether the computation was performed correctly (and who cheated if it was not). The third is openability, which means that a distinguished coalition of parties can recover the MPC inputs.