Perfect secure computation in two rounds
From MaRDI portal
Publication:5149757
DOI10.1137/19M1272044OpenAlexW3120132292MaRDI QIDQ5149757FDOQ5149757
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
Recommendations
Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cites Work
- Security and composition of multiparty cryptographic protocols
- Foundations of Cryptography
- Computationally private randomizing polynomials and their applications
- Cryptography in $NC^0$
- A minimal model for secure computation (extended abstract)
- Title not available (Why is that?)
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- 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
- Secure multiparty computation with minimal interaction
- 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
- Degree 2 is complete for the round-complexity of malicious MPC
Cited In (15)
- Efficient perfectly secure computation with optimal resilience
- Randomized functions with high round complexity
- Perfect secure computation in two rounds
- Towards characterizing securely computable two-party randomized functions
- The Exact Round Complexity of Secure Computation
- Quadratic multiparty randomized encodings beyond honest majority and their applications
- Secure multiparty computation with minimal interaction
- On perfectly secure 2PC in the OT-hybrid model
- Additive randomized encodings and their applications
- Title not available (Why is that?)
- Perfectly Secure Message Transmission in Two Rounds
- Two-round multiparty secure computation minimizing public key operations
- Robust additive randomized encodings from IO and pseudo-non-linear codes
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
