In cryptography, an oblivious transfer (OT) protocol is a type of protocol in which a sender transfers one of potentially many pieces of information to a receiver, but remains oblivious as to what piece (if any) has been transferred.
The first form of oblivious transfer was introduced in 1981 by Michael O. Rabin.[1] In this form, the sender sends a message to the receiver with probability 1/2, while the sender remains oblivious as to whether or not the receiver received the message. Rabin's oblivious transfer scheme is based on the RSA cryptosystem. A more useful form of oblivious transfer called 1–2 oblivious transfer or "1 out of 2 oblivious transfer", was developed later by Shimon Even, Oded Goldreich, and Abraham Lempel,[2] in order to build protocols for secure multiparty computation. It is generalized to "1 out of n oblivious transfer" where the user gets exactly one database element without the server getting to know which element was queried, and without the user knowing anything about the other elements that were not retrieved. The latter notion of oblivious transfer is a strengthening of private information retrieval, in which the database is not kept private.
Claude Crépeau showed that Rabin's oblivious transfer is equivalent to 1–2 oblivious transfer.[3]
Further work has revealed oblivious transfer to be a fundamental and important problem in cryptography. It is considered one of the critical problems in the field, because of the importance of the applications that can be built based on it. In particular, it is complete for secure multiparty computation: that is, given an implementation of oblivious transfer it is possible to securely evaluate any polynomial time computable function without any additional primitive.[4]
^Michael O. Rabin. "How to exchange secrets with oblivious transfer." Technical Report TR-81, Aiken Computation Laboratory, Harvard University, 1981. Scanned handwriting + typed version on eprint.iacr.org archive. Typed version available on Dousti's homepage.
^S. Even, O. Goldreich, and A. Lempel, "A Randomized Protocol for Signing Contracts", Communications of the ACM, Volume 28, Issue 6, pg. 637–647, 1985.
^Claude Crépeau. "Equivalence between two flavours of oblivious transfer". In Advances in Cryptology – CRYPTO '87, volume 293 of Lecture Notes in Computer Science, pages 350–354. Springer, 1988
^Joe Kilian. "Founding Cryptography on Oblivious Transfer", Proceedings, 20th Annual ACM Symposium on the Theory of Computation (STOC), 1988. Paper at ACM portal (subscription required)
and 22 Related for: Oblivious transfer information
In cryptography, an oblivioustransfer (OT) protocol is a type of protocol in which a sender transfers one of potentially many pieces of information to...
garbled circuit protocol, we make use of oblivioustransfer. In the oblivioustransfer, a string is transferred between a sender and a receiver in the following...
unconditionally secure protocol for performing so-called oblivioustransfer. Oblivioustransfer, on the other hand, had been shown by Kilian to allow implementation...
revealing which item is retrieved. PIR is a weaker version of 1-out-of-n oblivioustransfer, where it is also required that the user should not get information...
An oblivious pseudorandom function (OPRF) is a cryptographic function, similar to a keyed-hash function, but with the distinction that in an OPRF two...
unconditionally secure quantum bit commitment was impossible. Lo showed that oblivioustransfer and a broad class of secure computations were also impossible to achieve...
Occupational therapy Occupational therapist Oxytocin, a mammalian hormone Oblivioustransfer, a type of cryptography protocol Operational Technology, hardware/software...
NetworkWorld. Rabin, Michael O. (1981). How to exchange secrets with oblivioustransfer. Aiken Computation Lab, Harvard University. Technical Report TR-81...
IACR." Claude Crépeau 2013 "For pioneering work on the foundation of oblivioustransfer, two- and multiparty protocols, information-theoretic security, and...
a coin over a distance, Yao's Millionaires' Problem, and Rabin's oblivioustransfer. The problem can be described thus: "How can one allow only authorized...
public-key cryptosystems, pseudorandom functions, digital signatures, oblivioustransfer, secure multiparty computation, and is one of the co-inventors of...
key distribution), quantum multiplexing (the earliest example of oblivioustransfer) and superdense coding (the first and most basic example of entanglement-assisted...
potential cryptographic applications including commitment schemes. Oblivioustransfer Accumulator (cryptography) Key signing party Web of trust Zerocoin...
developed to the world of public-key cryptography in the 1980s as ObliviousTransfer, first by Michael Rabin and then by Shimon Even. It is used in the...
encryption Secret sharing for any monotone NP language Semi-honest oblivioustransfer Deniable encryption (both sender-deniable and fully-deniable) Multiparty...
1977.1055714. S2CID 9267632. Timeline of algorithms Data compression Oblivioustransfer מת פרופ' אברהם למפל – האיש ששינה את מדעי המחשב (in Hebrew) "IEEE Transactions...
Graph Algorithms, Computer Science Press, 1979. ISBN 0-7167-8044-5. Oblivioustransfer Memorial page Bibliography on DBLP Prof. Even's "genealogy" (PDF)...
constructing cryptographic schemes such as the Rabin cryptosystem and the oblivioustransfer. The quadratic residuosity problem is the basis for the Goldwasser-Micali...
2022-01-21. "Oblivious DNS Deployed by Cloudflare and Apple". 9 December 2020. Retrieved 27 July 2022. Pauly, Tommy (2 September 2021). "Oblivious DNS Over...
In computer science, an oblivious data structure is a data structure that gives no information about the sequence or pattern of the operations that have...
Global Information