Paper 2007/118
Smooth Projective Hashing and Two-Message Oblivious Transfer
Shai Halevi and Yael Tauman Kalai
Abstract
We present a general framework for constructing two-message oblivious transfer protocols using a modification of Cramer and Shoup's notion of smooth projective hashing (2002). This framework is an abstraction of the two-message oblivious transfer protocols of Naor and Pinkas (2001) and Aiello et al. (2001), whose security is based on the Decisional Diffie Hellman Assumption. In particular, we give two new oblivious transfer protocols. The security of one is based on the Quadratic Residuosity Assumption, and the security of the other is based on the
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Full version to appear in Journal of Cryptology
- Keywords
- CCA-secure encryptionOblivious TransferSafe primesSmooth Projective Hashing
- Contact author(s)
- shaih @ alum mit edu
- History
- 2010-10-31: revised
- 2007-04-03: received
- See all versions
- Short URL
- https://ia.cr/2007/118
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2007/118, author = {Shai Halevi and Yael Tauman Kalai}, title = {Smooth Projective Hashing and Two-Message Oblivious Transfer}, howpublished = {Cryptology {ePrint} Archive, Paper 2007/118}, year = {2007}, url = {https://eprint.iacr.org/2007/118} }