General public key m-out-of-n oblivious transfer

Abstract

In the m-out-of-n oblivious transfer model, Alice has n messages, Bob has m choices. After the interaction between the two parties, Bob can get m but only m messages from the n messages, Alice cannot know which m messages Bob gets. In this paper, for the first time, we construct a m-out-of-n OT protocol based on the general secure public key system. © Springer-Verlag 2004.