Catching MPC cheaters: identification and openability

DOI10.1007/978-3-319-72089-0_7MaRDI QIDQ1705719zbMATH OpenOpenAlexFDO

Authors Robert Cunningham, Benjamin Fuller, Sophia Yakoubov

Publication date 16 March 2018

Full work available at URL https://doi.org/10.1007/978-3-319-72089-0_7

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Network protocols (68M12)

Recommendations

• Identifying cheaters without an honest majority
• Efficient secure multiparty computation with identifiable abort
• Cheater detection in SPDZ multiparty computation
• Secure multi-party computation with identifiable abort
• Publicly auditable secure multi-party computation

Cited in

(12)

• Efficient, actively secure MPC with a dishonest majority: a survey
• How and how much to invest for fighting cheaters: from an ODE to a cellular automata model
• Identifying cheaters without an honest majority
• Your reputation's safe with me: framing-free distributed zero-knowledge proofs
• Secure multi-party computation with identifiable abort
• Efficient secure multiparty computation with identifiable abort
• Round-optimal multi-party computation with identifiable abort
• Efficient constant-round MPC with identifiable abort and public verifiability
• Cheater identification on a budget: MPC with identifiable abort from pairwise MACs
• Secure multiparty computation with identifiable abort via vindicating release
• Publicly auditable secure multi-party computation
• Cheater detection in SPDZ multiparty computation

This page was built for publication: Catching MPC cheaters: identification and openability

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