On communication models and best-achievable security in two-round MPC
From MaRDI portal
Publication:2697851
DOI10.1007/978-3-030-90453-1_4OpenAlexW3211682941MaRDI QIDQ2697851
Abhishek Jain, Manoj Prabhakaran, Rajeev Raghunath, Aarushi Goel
Publication date: 13 April 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-90453-1_4
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Definitions and properties of zero-knowledge proof systems
- 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
- Round-optimal secure multiparty computation with honest majority
- Broadcast-optimal two-round MPC
- Degree 2 is complete for the round-complexity of malicious MPC
- Two round information-theoretic MPC with malicious security
- Secure Multi-Party Computation with Identifiable Abort
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation
- How to share a secret
- Constant-Round MPC with Fairness and Guarantee of Output Delivery
- Secure Computation with Minimal Interaction, Revisited
- Secure Multiparty Computation with Minimal Interaction
- Cryptography in the Multi-string Model
- The knowledge complexity of interactive proof-systems
- On the exact round complexity of secure three-party computation
This page was built for publication: On communication models and best-achievable security in two-round MPC
