Broadcast-optimal two round MPC with an honest majority
From MaRDI portal
Publication:2128559
DOI10.1007/978-3-030-84245-1_6zbMath1486.94147MaRDI QIDQ2128559
Luisa Siniscalchi, Sophia Yakoubov, Bernardo Magri, Divya Ravi, Ivan B. Damgård
Publication date: 22 April 2022
Full work available at URL: https://eprint.iacr.org/2019/1183.pdf
Related Items
Minimizing setup in broadcast-optimal two round MPC, Round-optimal multi-party computation with identifiable abort
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A lower bound for the time to assure interactive consistency
- Two-round multiparty secure computation from minimal assumptions
- Round-optimal secure multiparty computation with honest majority
- Broadcast-optimal two-round MPC
- Two round information-theoretic MPC with malicious security
- Authenticated Algorithms for Byzantine Agreement
- Constant-Round MPC with Fairness and Guarantee of Output Delivery
- Secure Computation with Minimal Interaction, Revisited
- Secure Multiparty Computation with Minimal Interaction
- The round complexity of verifiable secret sharing and secure multicast
- On the exact round complexity of secure three-party computation