On the feasibility of extending oblivious transfer
From MaRDI portal
Publication:2413614
Recommendations
Cites work
- scientific article; zbMATH DE number 1722674 (Why is no real title available?)
- scientific article; zbMATH DE number 3856987 (Why is no real title available?)
- scientific article; zbMATH DE number 1256767 (Why is no real title available?)
- scientific article; zbMATH DE number 1030984 (Why is no real title available?)
- A note on computational indistinguishability
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
- Adaptively Secure Two-Party Computation with Erasures
- Advances in Cryptology - CRYPTO 2003
- Black-box constructions of protocols for secure computation
- Foundations of Cryptography
- Oblivious Transfer Is Symmetric
- Security and composition of multiparty cryptographic protocols
Cited in
(11)- 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 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
- 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)
