Perfect secure computation in two rounds

DOI10.1137/19M1272044MaRDI QIDQ5149757zbMATH OpenOpenAlexFDO

Authors Benny Applebaum, Zvika Brakerski, Rotem Tsabary

Publication date 8 February 2021

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/19m1272044

zbMATH Keywords

cryptographyinformation-theoretic securitysecure multiparty computation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)

Recommendations

• Perfect secure computation in two rounds
• scientific article; zbMATH DE number 1942420
• Round-optimal secure multi-party computation
• Secure multiparty computation with minimal interaction
• Round-optimal secure multiparty computation with honest majority

Cites work

• \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
• A minimal model for secure computation (extended abstract)
• Computationally private randomizing polynomials and their applications
• Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two
• Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
• Cryptography in NC^0
• Degree 2 is complete for the round-complexity of malicious MPC
• Foundations of Cryptography
• Garbled circuits as randomized encodings of functions: a primer
• scientific article; zbMATH DE number 2086626 (Why is no real title available?)
• Round-optimal secure multiparty computation with honest majority
• Secure computation on the web: computing without simultaneous interaction
• Secure multiparty computation with minimal interaction
• Security and composition of multiparty cryptographic protocols
• Two-round MPC: information-theoretic and black-box
• Two-round multiparty secure computation from minimal assumptions

Cited in

(17)

• Perfect secure computation in two rounds
• Towards characterizing securely computable two-party randomized functions
• Degree 2 is complete for the round-complexity of malicious MPC
• Perfectly Secure Message Transmission in Two Rounds
• scientific article; zbMATH DE number 4191075 (Why is no real title available?)
• Secure multiparty computation with minimal interaction
• scientific article; zbMATH DE number 1942420 (Why is no real title available?)
• scientific article; zbMATH DE number 2086626 (Why is no real title available?)
• The Exact Round Complexity of Secure Computation
• Efficient perfectly secure computation with optimal resilience
• On perfectly secure 2PC in the OT-hybrid model
• Quadratic multiparty randomized encodings beyond honest majority and their applications
• Additive randomized encodings and their applications
• Randomized functions with high round complexity
• Robust additive randomized encodings from IO and pseudo-non-linear codes
• Additive randomized encodings from public key encryption
• Two-round multiparty secure computation minimizing public key operations

This page was built for publication: Perfect secure computation in two rounds

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