Efficient oblivious transfer schemes.

Wen-Guey Tzeng

Yanhong Wang

In a 1-out-n oblivious transfer(OT)model,the sender sends n messages to the receiver.The receiver only get 1 message from n messages.However,the sender cannot know which message the receiver got.In this paper,we proposed a multiple-use 1-out-n oblivious transfer scheme based on threshold idea.It is more efficient than Naor-Pinkas scheme and Tzeng scheme.

Christian Tobias

Jianhong Zhang, Zou Wei

Oblivious transfer (OT) protocol is a fundamental cryptographical tool and widely used as a building block of secure computation. In this work, we propose two efficient t -out-of- n oblivious transfer schemes with the designated receiver. A common advantage of the two schemes is efficient. The total computation cost of the sender and the receiver is n +2 t +1 modular exponentiations in first scheme that is three-round, and the total one of the sender and receiver is n +3 t modular exponentiations in second scheme that is two-round. Another advantage of both schemes is designable.

Enrique Larraia

Carmit Hazay, Yehuda Lindell