Broadcast-optimal two round MPC with asynchronous peer-to-peer channels

DOI10.1007/978-3-031-44469-2_5zbMATH Open1547.94347MaRDI QIDQ6619925

Luisa Siniscalchi, Ivan B. Damgård, Sophia Yakoubov, Divya Ravi

Publication date: 16 October 2024

zbMATH Keywords

\((t_d, t_m)\)-asynchronydeafness threshold

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• 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
• Broadcast-optimal two round MPC with an honest majority
• Two round information-theoretic MPC with malicious security
• Constant-Round MPC with Fairness and Guarantee of Output Delivery
• Secure Computation with Minimal Interaction, Revisited
• Secure Multiparty Computation with Minimal Interaction
• Realistic Failures in Secure Multi-party Computation
• Asynchronous secure computation
• Asynchronous secure computations with optimal resilience (extended abstract)
• On the exact round complexity of secure three-party computation
• Minimizing setup in broadcast-optimal two round MPC
• Broadcast-optimal two round MPC with asynchronous peer-to-peer channels

Related Items (1)

Broadcast-optimal two round MPC with asynchronous peer-to-peer channels

This page was built for publication: Broadcast-optimal two round MPC with asynchronous peer-to-peer channels

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