Publication

Abstract : Oblivious transfer is one of the most basic and widely used protocol primitives in cryptography. It can be described as a two-party protocol used for interaction between a sender and a receiver. A 1-out-of-2 oblivious transfer is the interaction between a sender and a receiver in which a sender has two strings m 0 and m 1. At the end of the interaction, receiver learns exactly one of the strings m 0 and m 1, while the sender learns nothing. Lindell showed how to achieve efficient and fully simulatable non-adaptive oblivious transfer under decisional Diffie–Hellman (DDH) problem, Nth residuosity and quadratic residuosity assumptions, as well as the assumption that homomorphic encryption exists. We propose a scheme based on this protocol under the assumption namely vector decomposition problem. Our scheme is non-adaptive and fully simulatable.