Optimal Reductions Between Oblivious Transfers Using Interactive Hashing
From MaRDI portal
Publication:3593097
DOI10.1007/11761679_13zbMATH Open1140.94332OpenAlexW1547665694MaRDI QIDQ3593097FDOQ3593097
Authors: Claude Crépeau, George Savvides 
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
Recommendations
Cites Work
- Oblivious transfers and intersecting codes
- Title not available (Why is that?)
- Generalized privacy amplification
- Perfect zero-knowledge arguments for NP using any one-way permutation
- Privacy Amplification by Public Discussion
- Title not available (Why is that?)
- Theory of Cryptography
- Title not available (Why is that?)
- Oblivious transfer and privacy amplification
- Lower Bounds for Oblivious Transfer Reductions
- Title not available (Why is that?)
- Information-Theoretic Interactive Hashing and Oblivious Transfer to a Storage-Bounded Receiver
Cited In (6)
- Strengthening the Security of Distributed Oblivious Transfer
- Bit commitment in the bounded storage model: tight bound and simple optimal construction
- Oblivious transfer from any non-trivial elastic noisy channel via secret key agreement
- Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplification
- Interactive Hashing: An Information Theoretic Tool (Invited Talk)
- Lower Bounds for Oblivious Transfer Reductions
This page was built for publication: Optimal Reductions Between Oblivious Transfers Using Interactive Hashing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3593097)
