Publication

Abstract : A k-out-of-n oblivious transfer scheme is the interaction between a receiver and a sender where the sender possesses the messages m1, m2, … mn. The receiver needs to access k messages out of the n messages. The scheme is a mechanism in which the receiver obtains no more than the messages m1, m2, … mk which the receiver queried for with the indices 1, 2, … k being oblivious to the sender. We put forward a 1-out-of-2 oblivious transfer scheme. The security of our scheme is based on a decisional subspace assumption, decisional linear assumption and the computational infeasibility of vector decomposition problem a.k.a vector decomposition problem (VDP) assumption. Our scheme uses points on an elliptic curve as the ciphertext. Further, we prove the security of the proposed construction in the universal composability framework by using FCRS - hybrid model.