Perfect Secure Computation in Two Rounds
From MaRDI portal
Publication:5149757
DOI10.1137/19M1272044OpenAlexW3120132292MaRDI QIDQ5149757
Zvika Brakerski, Benny Applebaum, 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
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)
Related Items (2)
Quadratic multiparty randomized encodings beyond honest majority and their applications ⋮ Additive randomized encodings and their applications
Cites Work
- Unnamed Item
- Two-round MPC: information-theoretic and black-box
- 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
- Security and composition of multiparty cryptographic protocols
- Degree 2 is complete for the round-complexity of malicious MPC
- Computationally private randomizing polynomials and their applications
- A minimal model for secure computation (extended abstract)
- Secure Multiparty Computation with Minimal Interaction
- Foundations of Cryptography
- Garbled Circuits as Randomized Encodings of Functions: a Primer
- Secure Computation on the Web: Computing without Simultaneous Interaction
- 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$
This page was built for publication: Perfect Secure Computation in Two Rounds
