On the correlation complexity of MPC with cheater identification

DOI10.1007/978-3-031-47754-6_8MaRDI QIDQ6573954zbMATH OpenFDO

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

Publication date 17 July 2024

Full work available at URL https://doi.org/10.1007/978-3-031-47754-6_8

zbMATH Keywords

composable protocols for multi-party computation

Mathematics Subject Classification ID

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

Recommendations

• Secure multi-party computation with identifiable abort
• On the power of correlated randomness in secure computation
• On the bottleneck complexity of MPC with correlated randomness
• Identifying cheaters without an honest majority
• On the message complexity of secure multiparty computation

Cites work

• scientific article; zbMATH DE number 4195141 (Why is no real title available?)
• scientific article; zbMATH DE number 5485433 (Why is no real title available?)
• scientific article; zbMATH DE number 1030985 (Why is no real title available?)
• scientific article; zbMATH DE number 1942420 (Why is no real title available?)
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• scientific article; zbMATH DE number 1848306 (Why is no real title available?)
• Advances in Cryptology - CRYPTO 2003
• Efficient constant-round MPC with identifiable abort and public verifiability
• Efficient pseudorandom correlation generators: silent OT extension and more
• Efficient secure multiparty computation with identifiable abort
• Expected constant round Byzantine broadcast under dishonest majority
• Founding Cryptography on Oblivious Transfer – Efficiently
• Founding Cryptography on Tamper-Proof Hardware Tokens
• Identifying cheaters without an honest majority
• Oblivious Transfer Is Symmetric
• On sufficient oracles for secure computation with identifiable abort
• Secure multi-party computation with identifiable abort
• Secure multiparty computation with minimal interaction
• Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
• The rise of Paillier: homomorphic secret sharing and public-key silent OT
• Universally Composable Security with Global Setup

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)