Separating two-round secure computation from oblivious transfer
From MaRDI portal
Recommendations
- Three-round secure multiparty computation from black-box two-round oblivious transfer
- On the round complexity of black-box secure MPC
- Round-optimal black-box two-party computation
- Round-optimal black-box secure computation from two-round malicious OT
- Two-round MPC: information-theoretic and black-box
Cited in
(14)- Secure computation with parallel calls to 2-ary functions
- Two provably secure k-out-of-n oblivious transfer schemes
- Three-round secure multiparty computation from black-box two-round oblivious transfer
- Round-optimal black-box secure computation from two-round malicious OT
- On actively-secure elementary MPC reductions
- Quadratic multiparty randomized encodings beyond honest majority and their applications
- On the round complexity of black-box secure MPC
- Round-optimal black-box protocol compilers
- Broadcast-optimal secure computation from black-box oblivious transfer
- Additive randomized encodings and their applications
- List oblivious transfer and applications to round-optimal black-box multiparty coin tossing
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Black-box constant-round secure 2PC with succinct communication
- scientific article; zbMATH DE number 1796950 (Why is no real title available?)
This page was built for publication: Separating two-round secure computation from oblivious transfer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875778)
