Optimal Reductions Between Oblivious Transfers Using Interactive Hashing

DOI10.1007/11761679_13zbMath1140.94332OpenAlexW1547665694MaRDI QIDQ3593097

George Savvides, Claude Crépeau

Publication date: 24 September 2007

Published in: Advances in Cryptology - EUROCRYPT 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11761679_13

zbMATH Keywords

oblivious transferprivacy amplificationinteractive hashing

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement ⋮ Strengthening the Security of Distributed Oblivious Transfer ⋮ Bit Commitment in the Bounded Storage Model: Tight Bound and Simple Optimal Construction ⋮ Interactive Hashing: An Information Theoretic Tool (Invited Talk)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Perfect zero-knowledge arguments for NP using any one-way permutation
• Oblivious transfer and privacy amplification
• Information-Theoretic Interactive Hashing and Oblivious Transfer to a Storage-Bounded Receiver
• Oblivious transfers and intersecting codes
• Privacy Amplification by Public Discussion
• Lower Bounds for Oblivious Transfer Reductions
• Generalized privacy amplification
• Theory of Cryptography

This page was built for publication: Optimal Reductions Between Oblivious Transfers Using Interactive Hashing