Minimizing setup in broadcast-optimal two round MPC

DOI10.1007/978-3-031-30617-4_5MaRDI QIDQ6061355

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

Publication date: 8 December 2023

Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)

zbMATH Keywords

round complexitysecure computationminimal setup

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Two-round multiparty secure computation from minimal assumptions
• \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
• Broadcast-optimal two-round MPC
• Broadcast-optimal two round MPC with an honest majority
• Two round information-theoretic MPC with malicious security
• On communication models and best-achievable security in two-round MPC
• Multi-valued Byzantine Broadcast: The t < n Case
• Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation
• Constant-Round MPC with Fairness and Guarantee of Output Delivery
• Secure Computation with Minimal Interaction, Revisited
• Secure Multiparty Computation with Minimal Interaction
• The Byzantine Generals Problem
• Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
• Broadcast Extensions with Optimal Communication and Round Complexity
• On the exact round complexity of secure three-party computation
• Multiparty generation of an RSA modulus

This page was built for publication: Minimizing setup in broadcast-optimal two round MPC