Secure computation with parallel calls to 2-ary functions
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1848306 (Why is no real title available?)
- A Pseudorandom Generator from any One-way Function
- Black-box constructions of protocols for secure computation
- Chosen ciphertext security from injective trapdoor functions
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Cryptography with Constant Input Locality
- Degree 2 is complete for the round-complexity of malicious MPC
- Efficient constant-round MPC with identifiable abort and public verifiability
- Founding Cryptography on Oblivious Transfer – Efficiently
- Fully-secure MPC with minimal trust
- Garbled protocols and two-round MPC from bilinear maps
- On actively-secure elementary MPC reductions
- Perfect secure computation in two rounds
- Round-optimal black-box secure computation from two-round malicious OT
- Round-optimal secure multiparty computation with honest majority
- Secure computation with parallel calls to 2-ary functions
- Secure multiparty computation with minimal interaction
- Separating two-round secure computation from oblivious transfer
- Two round information-theoretic MPC with malicious security
- 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
This page was built for publication: Secure computation with parallel calls to 2-ary functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6955266)
