On the feasibility of extending oblivious transfer
From MaRDI portal
Publication:2413614
DOI10.1007/S00145-017-9269-5zbMATH Open1400.94164OpenAlexW2773495485MaRDI QIDQ2413614FDOQ2413614
Authors: Yehuda Lindell, Hila Zarosim 
Publication date: 14 September 2018
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.261.332
Recommendations
Cites Work
- Security and composition of multiparty cryptographic protocols
- Title not available (Why is that?)
- Oblivious Transfer Is Symmetric
- Foundations of Cryptography
- Advances in Cryptology - CRYPTO 2003
- Title not available (Why is that?)
- Adaptively Secure Two-Party Computation with Erasures
- A note on computational indistinguishability
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
- Title not available (Why is that?)
- Title not available (Why is that?)
- Black-box constructions of protocols for secure computation
Cited In (10)
- Reducing Complexity Assumptions for Oblivious Transfer
- A Game-Theoretic Perspective on Oblivious Transfer
- From attack on Feige-Shamir to construction of oblivious transfer
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
- Advances in Cryptology - CRYPTO 2003
- On the feasibility of extending oblivious transfer
- On the Reversibility of Oblivious Transfer
- More efficient oblivious transfer extensions
- On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
- A Weakness in Some Oblivious Transfer and Zero-Knowledge Protocols
This page was built for publication: On the feasibility of extending oblivious transfer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2413614)
