Oblivious Transfer and Balanced Functions

Abstract: We study the notion of Randomized 1-2 Oblivious-Transfer (Rand 1-2 OT), a minorvariation of the notion of an ordinary 1-2 Oblivious-Transfer (1-2 OT), which in particularis sucient for 1-2 OT. We show that the obliviousness condition for Rand 1-2 OT of bits, i.e.,the requirement that the receiver only learns one bit but gets (essentially) no information onthe other, holds if and only if the receiver learns (essentially) no information on the XORof the two bits. More generally we show...