Lower Bounds for Oblivious Transfer Reductions

DOI10.1007/3-540-48910-X_4MaRDI QIDQ4250752zbMATH OpenFDO

Authors Yevgeniy Dodis, Silvio Micali

Publication date 13 March 2000

Published in Advances in Cryptology — EUROCRYPT ’99 (Search for Journal in Brave)

zbMATH Keywords

oblivious transfer

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

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)

• New Monotones and Lower Bounds in Unconditional Two-Party Computation
• scientific article; zbMATH DE number 2085197 (Why is no real title available?)
• Zero-communication reductions
• On the structure of unconditional UC hybrid protocols
• Information-Theoretic Conditions for Two-Party Secure Function Evaluation
• Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions
• Lower bounds for quantum oblivious transfer
• Optimal Reductions Between Oblivious Transfers Using Interactive Hashing
• Private computations on set intersection
• Tight Bounds on Oblivious Chaining
• 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
• On the Efficiency of Classical and Quantum Oblivious Transfer Reductions

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)