Abstract
In this paper, we study some RSA-based semantically secure encryption schemes (IND-CPA) in the standard model. We first derive the exactly tight one-wayness of Rabin-Paillier encryption scheme which assumes that factoring Blum integers is hard. We next propose the first IND-CPA scheme whose one-wayness is equivalent to factoring generaln=pq (not factoring Blum integers). Our reductions of one-wayness are very tight because they require only one decryption-oracle query.
Chapter PDF
Similar content being viewed by others
References
Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among Notions of Security for Public-Key Encryption Schemes. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 26–45. Springer, Heidelberg (1998)
Boneh, D.: Simplified OAEP for RSA and Rabin Functions. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 275–291. Springer, Heidelberg (2001)
Catalano, D., Gennaro, R., Howgrave-Graham, N., Nguyen, P.: Paillier’s cryptosystem revisited. In: The 8th ACM conference on Computer and Communication Security, pp. 206–214 (2001)
Catalano, D., Nguyen, P., Stern, J.: The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 299–310. Springer, Heidelberg (2002)
Coppersmith, D.: Finding a Small Root of a Univariate Modular Equation. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 155–165. Springer, Heidelberg (1996)
Cramer, R., Shoup, V.: A Practical Public-Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attacks. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 13–25. Springer, Heidelberg (1998)
Cramer, R., Shoup, V.: Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 45–64. Springer, Heidelberg (2002)
Fujisaki, E., Okamoto, T., Pointcheval, D., Stern, J.: RSA-OAEP is Secure under the RSA Assumption. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 260–274. Springer, Heidelberg (2001)
Galindo, D., Molleví, S., Morillo, P., Villar, J.: A Practical Public Key Cryptosystem from Paillier and Rabin Schemes. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 279–291. Springer, Heidelberg (2002)
Goldreich, O.: Foundations of Cryptography: Basic Tools. Cambridge University Press, Cambridge (2001)
Kurosawa, K., Itoh, T., Takeuchi, M.: Public Key Cryptosystem using a Reciprocal Number with the Same Intractability as Factoring a Large Number. In: CRYPTOLOGIA, XII, pp. 225–233 (1988)
Kurosawa, K., Takagi, T.: Some RSA-based Encryption Schemes with Tight Security Reduction. A long version of this paper, IACR ePrint archive, 2003/157 (2003), available from: http://eprint.iacr.org/
Kurosawa, K., Ogata, W., Matsuo, T., Makishima, S.: IND-CCA Public Key Schemes Equivalent to Factoring n=pq. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol. 1992, pp. 36–47. Springer, Heidelberg (2001)
Okamoto, T., Uchiyama, S.: A New Public-Key Cryptosystem as Secure as Factoring. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 308–318. Springer, Heidelberg (1998)
Pointcheval, D.: New Public Key Cryptosystems Based on the Dependent-RSA Problems. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 239–254. Springer, Heidelberg (1999)
Sakurai, K., Takagi, T.: New Semantically Secure Public-Key Cryptosystems from the RSA-Primitive. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol. 2274, pp. 1–16. Springer, Heidelberg (2002)
Shoup, V.: OAEP Reconsidered. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 239–259. Springer, Heidelberg (2001)
Takagi, T.: Fast RSA-Type Cryptosystems using N-adic Expansion. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 372–384. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kurosawa, K., Takagi, T. (2003). Some RSA-Based Encryption Schemes with Tight Security Reduction. In: Laih, CS. (eds) Advances in Cryptology - ASIACRYPT 2003. ASIACRYPT 2003. Lecture Notes in Computer Science, vol 2894. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-40061-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-40061-5_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20592-0
Online ISBN: 978-3-540-40061-5
eBook Packages: Springer Book Archive