Perfect secure computation in two rounds
From MaRDI portal
Recommendations
- Perfect secure computation in two rounds
- Advances in Cryptology – CRYPTO 2004
- scientific article; zbMATH DE number 2086626
- The Exact Round Complexity of Secure Computation
- Round-optimal secure two-party computation from trapdoor permutations
- scientific article; zbMATH DE number 1942420
- Two-round Multiparty Secure Computation from Minimal Assumptions
- Two-round multiparty secure computation from minimal assumptions
- Efficient perfectly secure computation with optimal resilience
- Efficient perfectly secure computation with optimal resilience
Cites work
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
- A minimal model for secure computation (extended abstract)
- A Pseudorandom Generator from any One-way Function
- Advances in cryptology -- EUROCRYPT 2018. 37th annual international conference on the theory and applications of cryptographic techniques, Tel Aviv, Israel, April 29 -- May 3, 2018. Proceedings. Part III
- 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
- 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 multi-party computation
- 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
(21)- Two-round MPC: information-theoretic and black-box
- Towards characterizing securely computable two-party randomized functions
- Black-box transformations from passive to covert security with public verifiability
- Broadcast-optimal two-round MPC
- Optimal bounded-collusion secure functional encryption
- Degree 2 is complete for the round-complexity of malicious MPC
- Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation?
- Two-round maliciously secure computation with super-polynomial simulation
- On actively-secure elementary MPC reductions
- On communication models and best-achievable security in two-round MPC
- Perfectly Secure Message Transmission in Two Rounds
- scientific article; zbMATH DE number 4191075 (Why is no real title available?)
- scientific article; zbMATH DE number 2086626 (Why is no real title available?)
- Perfect secure computation in two rounds
- Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract)
- SCALES. MPC with small clients and larger ephemeral servers
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
- Quadratic multiparty randomized encodings beyond honest majority and their applications
- The round complexity of statistical MPC with optimal resiliency
- Secure computation with parallel calls to 2-ary functions
- Actively secure polynomial evaluation from shared polynomial encodings
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 Q1629404)
