In a 1–2 oblivious transfer protocol, Alice the sender has two messages m0 and m1, and wants to ensure that the receiver only learns one.
The protocol of Even, Goldreich, and Lempel (which the authors attribute partially to Silvio Micali) is general, but can be instantiated using RSA encryption as follows.
However, assuming single server PIR is a sufficient assumption in order to construct 1-out-of-2 Oblivious Transfer.
[5] 1-out-of-n oblivious transfer protocol with sublinear communication was first constructed (as a generalization of single-server PIR) by Eyal Kushilevitz and Rafail Ostrovsky.
[6] More efficient constructions were proposed by Moni Naor and Benny Pinkas,[7] William Aiello, Yuval Ishai and Omer Reingold,[8] Sven Laur and Helger Lipmaa.
The solution proposed by Ishai and Kushilevitz uses the parallel invocations of 1-2 oblivious transfer while making use of a special model of private protocols.
Later on, other solutions that are based on secret sharing were published – one by Bhavani Shankar, Kannan Srinathan, and C. Pandu Rangan,[14] and another by Tamir Tassa.
[15] In the early seventies Stephen Wiesner introduced a primitive called multiplexing in his seminal paper "Conjugate Coding", which was the starting point of quantum cryptography.