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 (Advances in Cryptology—EUROCRYPT’02, Lecture Notes in Computer Science, vol. 2332, pp. 45–64, Springer, Berlin, 2002). This framework is an abstraction of the two-message oblivious transfer protocols of Naor and Pinkas (SODA’01, pp. 448–457, ACM, New York, 2001) and Aiello et al. (Advances in Cryptology—EUROCRYPT’01, Lecture Notes in Computer Science, vol. 2045, pp. 119–135, Springer, Berlin, 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 Nth Residuosity Assumption. Compared to other applications of smooth projective hashing, in our context we must deal also with maliciously chosen parameters, which raises new technical difficulties.
We also improve on prior constructions of factoring-based smooth universal hashing, in that our constructions do not require that the underlying RSA modulus is a product of safe primes. (This holds for the schemes based on the Quadratic Residuosity Assumption as well as the ones based on the Nth Residuosity Assumption.) In fact, we observe that the safe-prime requirement is unnecessary for many prior constructions. In particular, the factoring-based CCA secure encryption schemes due to Cramer–Shoup, Gennaro–Lindell, and Camenisch–Shoup remain secure even if the underlying RSA modulus is not a product of safe primes.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
W. Aiello, Y. Ishai, O. Reingold, Priced oblivious transfer: How to sell digital goods, in Advances in Cryptology—EUROCRYPT’01. Lecture Notes in Computer Science, vol. 2045 (Springer, Berlin, 2001), pp. 119–135
C. Cachin, C. Crépeau, J. Marcil, Oblivious transfer with a memory-bounded receiver, in FOCS’98 (IEEE Press, New York, 1998), pp. 493–502
J. Camenisch, V. Shoup, Practical verifiable encryption and decryption of discrete logarithms, in Advances in Cryptology—CRYPTO’03. Lecture Notes in Computer Science, vol. 2729 (Springer, Berlin, 2003), pp. 126–144. Long version available on-line from the Cryptology ePrint Archive, report 2002/161 (version 20030825:120805), http://eprint.iacr.org/2002/161
R. Canetti, S. Halevi, J. Katz, Y. Lindell, P.D. MacKenzie, Universally composable password-based key exchange, in Advances in Cryptology—EUROCRYPT’05. Lecture Notes in Computer Science, vol. 3494 (Springer, Berlin, 2005), pp. 404–421
R. Cramer, V. Shoup, A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack, in Advances in Cryptology—CRYPTO’98. Lecture Notes in Computer Science, vol. 1462 (Springer, Berlin, 1998), pp. 13–25
R. Cramer, V. Shoup, Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption, in Advances in Cryptology—EUROCRYPT’02. Lecture Notes in Computer Science, vol. 2332 (Springer, Berlin, 2002), pp. 45–64. Long version available as ECCC TR01-072 (Revision 2), http://www.eccc.uni-trier.de/report/2001/072/
C. Crépeau, Equivalence between two flavours of oblivious transfers, in Advances in Cryptology—CRYPTO’87. Lecture Notes in Computer Science, vol. 293 (Springer, Berlin, 1987), pp. 350–354
Y.Z. Ding, D. Harnik, A. Rosen, R. Shaltiel, Constant-round oblivious transfer in the bounded storage model, in Theory of Cryptography—TCC’04. Lecture Notes in Computer Science, vol. 2951 (Springer, Berlin, 2004), pp. 446–472
S. Even, O. Goldreich, A. Lempel, A randomized protocol for signing contracts. Commun. ACM 28(6), 637–647 (1985)
R. Gennaro, Y. Lindell, A framework for password-based authenticated key exchange, in Advances in Cryptology—EUROCRYPT’03. Lecture Notes in Computer Science, vol. 2656 (Springer, Berlin, 2003), pp. 524–543. Full version available on the ePrint archive, http://eprint.iacr.org/2003/032/
S. Goldwasser, S. Micali, Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270–299 (1984)
O. Goldreich, S. Micali, A. Wigderson, How to play any mental game or a completeness theorem for protocols with honest majority, in Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing—STOC’87 (ACM, New York, 1987), pp. 218–229
S. Halevi, Efficient commitment schemes with bounded sender and unbounded receiver. J. Cryptol. 12(2), 77–90 (1999)
J. Katz, R. Ostrovsky, M. Yung, Efficient and secure authenticated key exchange using weak passwords. J. ACM 57(1), 78–116 (2009)
J. Kilian, Founding cryptography on oblivious transfer, in STOC’88 (ACM, New York, 1988), pp. 30–31
B. Möller, Algorithms for multi-exponentiation, in SAC’01. Lecture Notes in Computer Science, vol. 2259 (Springer, Berlin, 2001), pp. 165–180
M. Naor, B. Pinkas, Efficient oblivious transfer protocols, in SODA’01 (ACM, New York, 2001), pp. 448–457
N. Nisan, D. Zuckerman, Randomness is linear in space. J. Comput. Syst. Sci. 52(1), 43–52 (1996)
P. Paillier, Public-key cryptosystems based on composite degree residuosity classes, in Advances in Cryptology—EUROCRYPT’99. Lecture Notes in Computer Science, vol. 1562 (Springer, Berlin, 1999), pp. 223–238
M.O. Rabin, How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard, 1981
A.C.-C. Yao, How to generate and exchange secrets, in FOCS’86 (IEEE Press, New York, 1986), pp. 162–167
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Dan Boneh
Much of this work was carried out while visiting IBM T.J. Watson Research, New York. Also supported in part by NSF CyberTrust grant CNS-0430450.
Rights and permissions
About this article
Cite this article
Halevi, S., Kalai, Y.T. Smooth Projective Hashing and Two-Message Oblivious Transfer. J Cryptol 25, 158–193 (2012). https://doi.org/10.1007/s00145-010-9092-8
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00145-010-9092-8