Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation?

DOI10.1007/978-3-030-64840-4_7OpenAlexW3091638055MaRDI QIDQ2691585

Arka Rai Choudhuri, Abhishek Jain, Aarushi Goel, Prabhanjan V. Ananth

Publication date: 29 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-64840-4_7

Mathematics Subject Classification ID

Cryptography (94A60) Theory of compilers and interpreters (68N20) Data encryption (aspects in computer science) (68P25)

Cites Work

• Two-round MPC: information-theoretic and black-box
• Perfect secure computation in two rounds
• Two-round multiparty secure computation from minimal assumptions
• \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
• A generic approach to constructing and proving verifiable random functions
• Round-optimal secure multiparty computation with honest majority
• Player simulation and general adversary structures in perfect multiparty computation
• Degree 2 is complete for the round-complexity of malicious MPC
• Two round information-theoretic MPC with malicious security
• Secure multi-party computation in large networks
• Efficient Multiparty Protocols via Log-Depth Threshold Formulae
• Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits
• Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
• Zero-Knowledge Proofs from Secure Multiparty Computation
• Secure Multiparty Computation with Minimal Interaction
• Scalable Multiparty Computation with Nearly Optimal Work and Resilience
• Scalable and Unconditionally Secure Multiparty Computation
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Foundations of Cryptography
• Communication Locality in Secure Multi-party Computation
• Recent Results in Scalable Multi-Party Computation
• Secure Computation on the Web: Computing without Simultaneous Interaction
• New Techniques for Noninteractive Zero-Knowledge
• Two-Round Secure MPC from Indistinguishability Obfuscation
• Robust Multiparty Computation with Linear Communication Complexity
• Scalable Secure Multiparty Computation
• Brief announcement
• Verifiable random functions from non-interactive witness-indistinguishable proofs

This page was built for publication: Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation?