Reducing oblivious string transfer to universal oblivious transfer
Stefan Wolf · 2002
It is shown that oblivious transfer of strings can be reduced to the weakest version of oblivious bit transfer, where the receiver can choose to obtain arbitrary (but incomplete) information about the pair of bits sent. This solves an open problem posed by Brassard and Crepeau (see Advances in Cryptography$EUROCRYPT' 97, LNCS, vol.1233, p.334-45, Springer-Verlag, 1997).