Broadcast-optimal two round MPC with an honest majority

DOI10.1007/978-3-030-84245-1_6MaRDI QIDQ2128559zbMATH OpenOpenAlexFDO

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

Publication date 22 April 2022

Full work available at URL https://eprint.iacr.org/2019/1183.pdf

zbMATH Keywords

honest majority settingselective abort

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• On communication models and best-achievable security in two-round MPC
• Round-optimal secure multiparty computation with honest majority
• Broadcast-optimal two-round MPC
• Guaranteed output delivery comes free in honest majority MPC
• Constant-Round MPC with Fairness and Guarantee of Output Delivery

Cites work

• A lower bound for the time to assure interactive consistency
• Authenticated Algorithms for Byzantine Agreement
• Broadcast-optimal two-round MPC
• Constant-Round MPC with Fairness and Guarantee of Output Delivery
• scientific article; zbMATH DE number 1942420 (Why is no real title available?)
• scientific article; zbMATH DE number 2086626 (Why is no real title available?)
• scientific article; zbMATH DE number 2086726 (Why is no real title available?)
• scientific article; zbMATH DE number 1842483 (Why is no real title available?)
• scientific article; zbMATH DE number 1842488 (Why is no real title available?)
• scientific article; zbMATH DE number 1842491 (Why is no real title available?)
• On the exact round complexity of secure three-party computation
• Round-optimal secure multiparty computation with honest majority
• Secure computation with minimal interaction, revisited
• Secure multiparty computation with minimal interaction
• The round complexity of verifiable secret sharing and secure multicast
• Two round information-theoretic MPC with malicious security
• Two-round multiparty secure computation from minimal assumptions

Cited in

(13)

• Broadcast-optimal two-round MPC
• Honest majority MPC with abort with minimal online communication
• Round-optimal multi-party computation with identifiable abort
• On communication models and best-achievable security in two-round MPC
• Minimizing setup in broadcast-optimal two round MPC
• Broadcast-optimal four-round MPC in the plain model
• On the round complexity of fully secure solitary MPC with honest majority
• Broadcast-optimal two round MPC with asynchronous peer-to-peer channels
• Round-optimal, fully secure distributed key generation
• Cheater identification on a budget: MPC with identifiable abort from pairwise MACs
• Broadcast-optimal secure computation from black-box oblivious transfer
• Information-theoretic broadcast-optimal MPC
• Constant-round YOSO MPC without setup

This page was built for publication: Broadcast-optimal two round MPC with an honest majority

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