Lower bounds for oblivious transfer reductions
From MaRDI portal
Recommendations
- Lower bounds for quantum oblivious transfer
- Reducing Complexity Assumptions for Oblivious Transfer
- Lower bounds on assumptions behind indistinguishability obfuscation
- On oblivious transfer capacity
- Optimal Reductions Between Oblivious Transfers Using Interactive Hashing
- Laconic oblivious transfer and its applications
- On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
- Lower bounds for oblivious data structures
- Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions
Cited in
(13)- On the structure of unconditional UC hybrid protocols
- Zero-communication reductions
- Lower bounds for quantum oblivious transfer
- On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
- Optimal Reductions Between Oblivious Transfers Using Interactive Hashing
- Information-Theoretic Conditions for Two-Party Secure Function Evaluation
- New Monotones and Lower Bounds in Unconditional Two-Party Computation
- Tight Bounds on Oblivious Chaining
- scientific article; zbMATH DE number 2085197 (Why is no real title available?)
- New Monotones and Lower Bounds in Unconditional Two-Party Computation
- Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplification
- Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions
- Private computations on set intersection
This page was built for publication: Lower bounds for oblivious transfer reductions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250752)
