Skip to main content
placeholder image

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

Journal Article


Download full-text (Open Access)

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.

UOW Authors


  •   Lai, Jianchang (external author)
  •   Mu, Yi (external author)
  •   Guo, Fuchun
  •   Chen, Rongmao (external author)
  •   Ma, Sha (external author)

Publication Date


  • 2018

Citation


  • Lai, J., Mu, Y., Guo, F., Chen, R. & Ma, S. (2018). Efficient k-out-of-n oblivious transfer scheme with the ideal communication cost. Theoretical Computer Science, 714 15-26.

Scopus Eid


  • 2-s2.0-85038811299

Ro Full-text Url


  • http://ro.uow.edu.au/cgi/viewcontent.cgi?article=1968&context=eispapers1

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers1/966

Number Of Pages


  • 11

Start Page


  • 15

End Page


  • 26

Volume


  • 714

Place Of Publication


  • Netherlands

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.

UOW Authors


  •   Lai, Jianchang (external author)
  •   Mu, Yi (external author)
  •   Guo, Fuchun
  •   Chen, Rongmao (external author)
  •   Ma, Sha (external author)

Publication Date


  • 2018

Citation


  • Lai, J., Mu, Y., Guo, F., Chen, R. & Ma, S. (2018). Efficient k-out-of-n oblivious transfer scheme with the ideal communication cost. Theoretical Computer Science, 714 15-26.

Scopus Eid


  • 2-s2.0-85038811299

Ro Full-text Url


  • http://ro.uow.edu.au/cgi/viewcontent.cgi?article=1968&context=eispapers1

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers1/966

Number Of Pages


  • 11

Start Page


  • 15

End Page


  • 26

Volume


  • 714

Place Of Publication


  • Netherlands