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

Catching MPC Cheaters: Identification and Openability

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

Published Jan 1, 2017• 27 citations
Publisher
DOI
10.1007/978-3-319-72089-0_7

Related papers

On the Correlation Complexity of MPC with Cheater Identification

Nicholas Brandt, Sven Maier, Tobias Müller +1 more

Lecture notes in computer science•Nov 30, 2023•0 citations

Cheater Identification on a Budget: MPC with Identifiable Abort from Pairwise MACs

Carsten Baum, Nikolas Melissaris, Rahul Rachuri +1 more

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

Efficient, Actively Secure MPC with a Dishonest Majority: A Survey

Emmanuela Orsini

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

When Trying to Catch Cheaters Breaks the MPC: Breaking and Fixing Delayed Consistency Checks in Trident, Fantastic Four, SWIFT, and Quad

Andreas Brüggemann, Thomas Schneider

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

MPC with Friends and Foes

Bar Alon, Eran Omri, Anat Paskin-Cherniavsky

Lecture notes in computer science•Jan 1, 2020•16 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.