Two-round Multiparty Secure Computation from Minimal Assumptions

DOI10.1145/3566048MaRDI QIDQ5889781zbMATH OpenOpenAlexWikidataFDO

Authors Sanjam Garg, Akshayaram Srinivasan

Publication date 27 April 2023

Published in Journal of the ACM (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1145/3566048

zbMATH Keywords

garbled circuitsoblivious transferround-optimal secure multiparty computation

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• Two-round multiparty secure computation from minimal assumptions
• Three-round secure multiparty computation from black-box two-round oblivious transfer
• Round optimal secure multiparty computation from minimal assumptions
• Two-round multiparty secure computation minimizing public key operations
• Two-round adaptively secure multiparty computation from standard assumptions

Cited in

(11)

• Perfect secure computation in two rounds
• Round optimal secure multiparty computation from minimal assumptions
• On reductions from multi-domain noninterference to the two-level case
• Two round information-theoretic MPC with malicious security
• Statistical security in two-party computation revisited
• Exponent-VRFs and their applications
• Expected constant round Byzantine broadcast under dishonest majority
• Cryptography in the common Haar state model: feasibility results and separations
• Indistinguishability obfuscation from bilinear maps and LPN variants
• On the communication complexity of secure multi-party computation with aborts
• What is the minimum number of random bits required for computabilityokula and efficiency in anonymous networks?

This page was built for publication: Two-round Multiparty Secure Computation from Minimal Assumptions

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