A randomized protocol for signing contracts
Communications of the ACM
Founding crytpography on oblivious transfer
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Oblivious transfer and polynomial evaluation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Practical Quantum Oblivious Transfer
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Foundations of Secure Interactive Computing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Precomputing Oblivious Transfer
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Achieving oblivious transfer using weakened security assumptions
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Efficient cryptographic protocols based on noisy channels
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
On the reversibility of oblivious transfer
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Efficient unconditional oblivious transfer from almost any noisy channel
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
New monotones and lower bounds in unconditional two-party computation
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Error-Tolerant Combiners for Oblivious Primitives
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Simple, Black-Box Constructions of Adaptively Secure Protocols
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Adaptively Secure Two-Party Computation with Erasures
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Reducing Complexity Assumptions for Oblivious Transfer
IWSEC '09 Proceedings of the 4th International Workshop on Security: Advances in Information and Computer Security
Robuster combiners for oblivious transfer
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Cryptography and game theory: designing protocols for exchanging information
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Oblivious transfer based on physical unclonable functions
TRUST'10 Proceedings of the 3rd international conference on Trust and trustworthy computing
On the efficiency of classical and quantum oblivious transfer reductions
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Unconditional and composable security using a single stateful tamper-proof hardware token
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Completeness theorems with constructive proofs for finite deterministic 2-party functions
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Concurrent composition in the bounded quantum storage model
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Non-local box complexity and secure function evaluation
Quantum Information & Computation
Physically uncloneable functions in the universal composition framework
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Black-Box Constructions of Protocols for Secure Computation
SIAM Journal on Computing
Information-Theoretic conditions for two-party secure function evaluation
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
On the existence of loss-tolerant quantum oblivious transfer protocols
Quantum Information & Computation
Efficient password authenticated key exchange via oblivious transfer
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Statistically secure linear-rate dimension extension for oblivious affine function evaluation
ICITS'12 Proceedings of the 6th international conference on Information Theoretic Security
Oblivious transfer and quantum channels as communication resources
Natural Computing: an international journal
On the feasibility of extending oblivious transfer
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
On oblivious transfer capacity
Information Theory, Combinatorics, and Search Theory
| Hi-index | 0.00 |
We show that oblivious transfer of bits from A to B can be obtained from a single instance of the same primitive from B to A. Our reduction is perfect and shows that oblivious transfer is in fact a symmetric functionality. This solves an open problem posed by Crépeau and Sántha in 1991.