On the correlation complexity of MPC with cheater identification

DOI10.1007/978-3-031-47754-6_8zbMATH Open1543.94708MaRDI QIDQ6573954

Tobias Müller, Sven Maier, Joern Mueller-Quade, Nicholas Brandt

Publication date: 17 July 2024

zbMATH Keywords

composable protocols for multi-party computation

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Expected constant round Byzantine broadcast under dishonest majority
• The rise of Paillier: homomorphic secret sharing and public-key silent OT
• Efficient constant-round MPC with identifiable abort and public verifiability
• Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
• Efficient pseudorandom correlation generators: silent OT extension and more
• Secure Multi-Party Computation with Identifiable Abort
• Identifying Cheaters without an Honest Majority
• Efficient Secure Multiparty Computation with Identifiable Abort
• Founding Cryptography on Tamper-Proof Hardware Tokens
• Secure Multiparty Computation with Minimal Interaction
• Oblivious Transfer Is Symmetric
• Universally Composable Security with Global Setup
• Founding Cryptography on Oblivious Transfer – Efficiently
• Advances in Cryptology - CRYPTO 2003
• On sufficient oracles for secure computation with identifiable abort

This page was built for publication: On the correlation complexity of MPC with cheater identification

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