Catching MPC cheaters: identification and openability

DOI10.1007/978-3-319-72089-0_7zbMath1417.94054OpenAlexW2571828887MaRDI QIDQ1705719

Benjamin Fuller, Sophia Yakoubov, Robert Cunningham

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

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

Related Items (6)

Round-optimal multi-party computation with identifiable abort ⋮ Efficient, actively secure MPC with a dishonest majority: a survey ⋮ Your reputation's safe with me: framing-free distributed zero-knowledge proofs ⋮ Secure multiparty computation with identifiable abort via vindicating release ⋮ Cheater identification on a budget: MPC with identifiable abort from pairwise MACs ⋮ Efficient constant-round MPC with identifiable abort and public verifiability

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