Cryptology ePrint Archive: Report 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.

Category / Keywords: cryptographic protocols /

Date: received 7 Mar 2015

Contact author: ql_wang at outlook com

Available format(s): PDF | BibTeX Citation

Version: 20150308:084628 (All versions of this report)

Short URL: ia.cr/2015/218

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]