Paper 2009/521

An Efficient Secure Oblivious Transfer

Hung-Min Sun, Yalin Chen, and Jue-Sam Chou

Abstract

As traditional oblivious transfer protocols are treated as a cryptographic primitive, they are usually executed without the consideration of possible attacks, e.g., impersonation, replaying, and man-in-the-middle attacks. Therefore, when these protocols are applied in certain applications such as mental poker playing, some necessary mechanism must be executed first to ensure the security of subsequent communications. But doing this way, we found that almost all of the resulting mechanisms are not efficient enough in communicational cost which is a significant concern for commercial transactions. Inspired by these observations, we propose a novel secure oblivious transfer protocol based on bilinear pairing which not only can provide mutual authentication to resist malicious attacks but also is efficient in communicational cost, other than its original functions.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. Unknown where it was published
Keywords
oblivious transfermutual authenticationID-based cryptosystembilinear pairingcommunicational costECDLPDLPimpersonationMIMAKCI
Contact author(s)
d949702 @ oz nthu edu tw
History
2009-11-02: received
Short URL
https://ia.cr/2009/521
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2009/521,
      author = {Hung-Min Sun and Yalin Chen and Jue-Sam Chou},
      title = {An Efficient Secure Oblivious Transfer},
      howpublished = {Cryptology ePrint Archive, Paper 2009/521},
      year = {2009},
      note = {\url{https://eprint.iacr.org/2009/521}},
      url = {https://eprint.iacr.org/2009/521}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.