Optimal Reductions Between Oblivious Transfers Using Interactive Hashing
From MaRDI portal
Publication:3593097
Recommendations
Cites work
- scientific article; zbMATH DE number 3856987 (Why is no real title available?)
- scientific article; zbMATH DE number 3825698 (Why is no real title available?)
- scientific article; zbMATH DE number 1286750 (Why is no real title available?)
- scientific article; zbMATH DE number 549858 (Why is no real title available?)
- Generalized privacy amplification
- Information-Theoretic Interactive Hashing and Oblivious Transfer to a Storage-Bounded Receiver
- Lower Bounds for Oblivious Transfer Reductions
- Oblivious transfer and privacy amplification
- Oblivious transfers and intersecting codes
- Perfect zero-knowledge arguments for NP using any one-way permutation
- Privacy Amplification by Public Discussion
- Theory of Cryptography
Cited in
(6)- 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
- Strengthening the Security of Distributed Oblivious Transfer
- 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)
