Cheater Detection in SPDZ Multiparty Computation

DOI10.1007/978-3-319-49175-2_8zbMath1407.94152OpenAlexW2556810024MaRDI QIDQ2953814

Gabriele Spini, Serge Fehr

Publication date: 6 January 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/25035

Mathematics Subject Classification ID

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

Related Items (2)

Round-optimal multi-party computation with identifiable abort ⋮ Efficient constant-round MPC with identifiable abort and public verifiability

Cites Work

• Secure Multi-Party Computation with Identifiable Abort
• Multiparty Computation from Somewhat Homomorphic Encryption
• Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
• Semi-homomorphic Encryption and Multiparty Computation
• Efficient Secure Multiparty Computation with Identifiable Abort

This page was built for publication: Cheater Detection in SPDZ Multiparty Computation