Cheater identification on a budget: MPC with identifiable abort from pairwise MACs

DOI10.1007/978-3-031-68397-8_14MaRDI QIDQ6653036zbMATH OpenFDO

Authors Carsten Baum, Nikolas Melissaris, Rahul Rachuri, Peter Scholl

Publication date 13 December 2024

zbMATH Keywords

dishonest majority MPC

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Theory of compilers and interpreters (68N20)

Recommendations

• Catching MPC cheaters: identification and openability
• Efficient secure multiparty computation with identifiable abort
• Secure multi-party computation with identifiable abort
• Identifying cheaters without an honest majority
• Secure multiparty computation with identifiable abort via vindicating release

Cites work

• A Framework for Efficient and Composable Oblivious Transfer
• Broadcast-optimal two round MPC with an honest majority
• Broadcast-optimal two-round MPC
• Catching MPC cheaters: identification and openability
• Cheater detection in SPDZ multiparty computation
• Efficient compiler to covert security with public verifiability for honest majority MPC
• Efficient constant-round MPC with identifiable abort and public verifiability
• Efficient pseudorandom correlation generators from ring-LPN
• Efficient secure multiparty computation with identifiable abort
• Generic compiler for publicly verifiable covert multi-party computation
• Identifying cheaters without an honest majority
• Le Mans: dynamic and fluid MPC for dishonest majority
• Minimizing setup in broadcast-optimal two round MPC
• Multiparty Computation from Somewhat Homomorphic Encryption
• On sufficient oracles for secure computation with identifiable abort
• Protecting distributed primitives against leakage: equivocal secret sharing and more
• Round-optimal multi-party computation with identifiable abort
• Secure multi-party computation with identifiable abort
• Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
• Semi-homomorphic encryption and multiparty computation
• Sok: vector OLE-based zero-knowledge protocols
• Universally composable synchronous computation

Cited in

(1)

• Secure multiparty computation with identifiable abort via vindicating release

This page was built for publication: Cheater identification on a budget: MPC with identifiable abort from pairwise MACs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653036)