Efficient k-out-of-n oblivious transfer protocol

wang qinglong

Paper 2015/218

Efficient k-out-of-n oblivious transfer protocol

wang qinglong

Abstract

A new k-out-of-n oblivious transfer protocol is presented in this paper. The communication cost of our scheme are n+1 messages of sender to receiver and k messages from the receiver to sender. To the best knowledge of the authors, the com-munication complexity of our scheme is the least. Also, our scheme has a lower computation cost with (k+1)n modular ex-ponentiations for sender and 3k modular exponentiations for the receiver. The security of our scheme is only based on the Decision Diffie-Hellman assumption. Further, we proved the sender’s computational security and the receiver’s uncondition-al security under standard model.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint. MINOR revision.
Contact author(s): ql_wang @ outlook com
History: 2015-03-08: received
Short URL: https://ia.cr/2015/218
License: CC BY

BibTeX

@misc{cryptoeprint:2015/218,
      author = {wang qinglong},
      title = {Efficient k-out-of-n oblivious transfer protocol},
      howpublished = {Cryptology {ePrint} Archive, Paper 2015/218},
      year = {2015},
      url = {https://eprint.iacr.org/2015/218}
}