Title

Efficient k-out-of-n oblivious transfer scheme with the ideal communication cost

RIS ID

118237

Publication Details

Lai, J., Mu, Y., Guo, F., Chen, R. & Ma, S. (2017). Efficient k-out-of-n oblivious transfer scheme with the ideal communication cost. Theoretical Computer Science, Online first 1-12.

Abstract

In this paper, we propose a two-round k-out-of-n oblivious transfer scheme with the minimum communication cost. In our proposed scheme, the messages sent by the receiver R to the sender S consist of only three elements, which is independent of n and k, while the messages from S to R are (n+1) elements when the sender holds n secrets. Our scheme features a nice property of universal parameter, where the system parameter can be used by all senders and receivers. The proposed k-out-of-n oblivious transfer scheme is the most efficient two-round scheme in terms of the number of messages transferred between two communicating parties in known constructions. The scheme preserves the privacy of receiver's choice and sender's security.

Please refer to publisher version or contact your library.

Share

COinS
 

Link to publisher version (DOI)

http://dx.doi.org/10.1016/j.tcs.2017.12.019