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

Secure Multiparty Computation with Identifiable Abort via Vindicating Release

Ran Cohen, Jack Doerner, Yashvanth Kondi, Abhi A. Shelat

Published Jan 1, 2024• 8 citations
Publisher
DOI
10.1007/978-3-031-68397-8_2

Related papers

Efficient Secure Multiparty Computation with Identifiable Abort

Carsten Baum, Emmanuela Orsini, Peter Schöll

Lecture notes in computer science•Jan 1, 2016•36 citations

Round Efficient Secure Multiparty Quantum Computation with Identifiable Abort

Bar Alon, Hao Chung, Kai-Min Chung +3 more

Lecture notes in computer science•Jan 1, 2021•17 citations

Secure Multi-Party Computation with Identifiable Abort

Yuval Ishai, Rafail Ostrovsky, Vassilis Zikas

Lecture notes in computer science•Jan 1, 2014•97 citations

Best-of-Both-Worlds Multiparty Quantum Computation with Publicly Verifiable Identifiable Abort

Kai-Min Chung, Mi-Ying Huang, Er-Cheng Tang +1 more

arXiv:2211.01665•Lecture notes in computer science•Jan 1, 2024•0 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•0 citations

Secure Multiparty Computation

Xun Yi, Xuechao Yang, Xiaoning Liu +5 more

Springer eBooks•Jan 1, 2025•9 citations