Lower Bounds for Oblivious Transfer Reductions

DOI10.1007/3-540-48910-X_4zbMath0932.68044MaRDI QIDQ4250752

Silvio Micali, Yevgeniy Dodis

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

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

Related Items (5)

On the structure of unconditional UC hybrid protocols ⋮ Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions ⋮ Optimal Reductions Between Oblivious Transfers Using Interactive Hashing ⋮ Information-Theoretic Conditions for Two-Party Secure Function Evaluation ⋮ Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplification

This page was built for publication: Lower Bounds for Oblivious Transfer Reductions