On the feasibility of extending oblivious transfer
From MaRDI portal
Publication:4910296
DOI10.1007/978-3-642-36594-2_29zbMATH Open1315.94086OpenAlexW2097241528MaRDI QIDQ4910296FDOQ4910296
Authors: Yehuda Lindell, Hila Zarosim 
Publication date: 18 March 2013
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-36594-2_29
Recommendations
Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cited In (16)
- Reducing Complexity Assumptions for Oblivious Transfer
- A Game-Theoretic Perspective on Oblivious Transfer
- From attack on Feige-Shamir to construction of oblivious transfer
- Information-theoretic broadcast with dishonest majority for long messages
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
- More efficient oblivious transfer extensions with security for malicious adversaries
- Advances in Cryptology - CRYPTO 2003
- On the feasibility of extending oblivious transfer
- Efficient secure multiparty computation with identifiable abort
- Efficient constant-round MPC with identifiable abort and public verifiability
- On the round complexity of OT extension
- 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
- Oblivious transfer based on single-qubit rotations
- 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 Q4910296)
