Paper 2010/027

A novel k-out-of-n Oblivious Transfer Protocols Based on Bilinear Pairings

Yalin Chen, Jue-Sam Chou, and Xian-Wu Hou

Abstract

Low bandwidth consumption is an important issue in a busy commercial network whereas time may not be so crucial, for example, the end-of-day financial settlement for commercial transactions in a day. In this paper, we construct a secure and low bandwidth-consumption k-out-of-n oblivious transfer scheme based on bilinear pairings. We analyze the security and efficiency of our scheme and conclude that our scheme is more secure and efficient in communication bandwidth consumption than most of the other existing oblivious transfer schemes that we know.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. Unknown where it was published
Keywords
oblivious transferelliptic curve cryptosystemKeywords: oblivious transfermutual authenticationID-based cryptosystem
Contact author(s)
jschou @ mail nhu edu tw
History
2010-01-22: received
Short URL
https://ia.cr/2010/027
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2010/027,
      author = {Yalin Chen and Jue-Sam Chou and Xian-Wu Hou},
      title = {A novel k-out-of-n Oblivious Transfer Protocols Based on Bilinear Pairings},
      howpublished = {Cryptology ePrint Archive, Paper 2010/027},
      year = {2010},
      note = {\url{https://eprint.iacr.org/2010/027}},
      url = {https://eprint.iacr.org/2010/027}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.