Abstract
Indistinguishability against adaptive hosen ciphertext attack (IND-CCA2) is the strongest notion for security of public key schemes. In this paper, we present the first IND-CCA2 schemes whose securities are equivalent to factoring n =pq under the random oracle model, where p and q are prime numbers. Our first scheme works for long messages and our second scheme is more efficient for short messages.
Chapter PDF
Similar content being viewed by others
References
Bellare, M., Rogaway, P.: Random Oracles are Practical: a Paradigm for Designing Efficient Protocols. Proc. of the 1st CCS (1993) 62–73
Bellare, M., Rogaway, P.:Optimal Asymmetric Encryption-How to encrypt with RSA. Proc. of Eurocrypt’ 94, Lecture Notes in Computer Science, 950 (1994) 92–111
Okamoto, T., Uchiyama, S.:A New Public-Key Cryptosystem as Secure as Factoring. Proc. of Eurocrypt’ 99, Lecture Notes in Computer Science, 1403 (1998) 308–318
Fujisaki, E., Okamoto, T.: How to Enhance the Security of Public-Key Encryption at Minimum Cost. Proc. of PKC’ 99, Lecture Notes in Computer Science,1560 (1999)53–68
Fujioka, E., Okamoto, T.: Secure integration of asymmetric and symmetric encryption schemes. Proc. of Crypto’ 99, Lecture Notes in Computer Science, 1666 (1999) 537–554
Pointcheval, D.:Chosen-Ciphertext Security for any One-Way Cryptosystem. Proc. of PKC 2000, Lecture Notes in Computer Science, 1807 (2000) 129–146
Paillier, P.:A Trapdoor Permutation Equivalent to Factoring. Proc. of PKC’ 99, Lecture Notes in Computer Science,1560 (1999) 217–222
Paillier, P.: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. Proc. of Eurocrypt’ 99, Lecture Notes in Computer Science, 1592 (1999) 223–238
Paillier, P., Pointcheval, D.:Defficient Public-Key Cryptosystems Provably Secure Against Active Adversaries. Proc. of Asiacrypt’ 99, Lecture Notes in Computer Science, 1716 (1999) 165–179
Rabin, M.O.:Digitalized signatures and public key cryptosystems as intractable as factorization. MIT/LCS/TR-212, Technical Report MIT (1979)
Williams, H.C.: A modification of the RSA public-key encryption procedure. IEEE, IT, IT-26 No.6 (1980) 726–729
Kurosawa, K., Itoh, T., Takeuchi, M.:Public key cryptosystem using a reciprocal number with the same intractability as factoring a large number.CRYPTOLOGIA, XII (1988) 225–233
Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive hosen ciphertext attack. Proc. of Crypto’ 98, Lecture Notes in Computer Science, 1462 (1998) 13–25
Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among notations of security for public key encryption schemes.Crypto’ 98, Lecture Notes in Computer Science, 1462 (1998) 26–45
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kurosawa, K., Ogata, W., Matsuo, T., Makishima, S. (2001). IND-CCA Public Key Schemes Equivalent to Factoring n =pq . In: Kim, K. (eds) Public Key Cryptography. PKC 2001. Lecture Notes in Computer Science, vol 1992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44586-2_3
Download citation
DOI: https://doi.org/10.1007/3-540-44586-2_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41658-6
Online ISBN: 978-3-540-44586-9
eBook Packages: Springer Book Archive