Weak oblivious transfer from strong one-way functions
From MaRDI portal
Recommendations
Cites work
- An Almost m-wise Independent Random Permutation of the Cube
- Basing Weak Public-Key Cryptography on Strong One-Way Functions
- Black-box constructions for secure computation
- Efficient oblivious transfer protocols
- Enumerative source encoding
- Foundations of Cryptography
- scientific article; zbMATH DE number 3856987 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- Information-Theoretic Interactive Hashing and Oblivious Transfer to a Storage-Bounded Receiver
- Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
- On Yao's XOR-lemma
- Secure communications over insecure channels
- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
- Theory of Cryptography
- Theory of Cryptography
Cited in
(7)- Oblivious transfer from weakly random self-reducible public-key cryptosystem
- On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
- scientific article; zbMATH DE number 549858 (Why is no real title available?)
- scientific article; zbMATH DE number 826071 (Why is no real title available?)
- A Weakness in Some Oblivious Transfer and Zero-Knowledge Protocols
- Theory of Cryptography
- Constant-round oblivious transfer in the bounded storage model
This page was built for publication: Weak oblivious transfer from strong one-way functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3092347)
