New public key cryptosystems based on the dependent-RSA problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1592, Issue , 1999, Pages 239-254

  Pointcheval, David ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

Chosen cipher text attacks; Public key encryption; Semantic security; The dependent RSA problem

Indexed keywords

ECONOMIC AND SOCIAL EFFECTS; PUBLIC KEY CRYPTOGRAPHY; SEMANTICS;

ASYMMETRIC ENCRYPTION; CHOSEN CIPHER TEXT ATTACK; PUBLIC KEY CRYPTOSYSTEMS; PUBLIC-KEY ENCRYPTION; RSA ENCRYPTION SCHEME; RSA PROBLEM; SECURITY PROPERTIES; SEMANTIC SECURITY;

CRYPTOGRAPHY;

EID: 84957652328     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48910-X_17     Document Type: Conference Paper

References (23)

1. M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway. Relations Among Notions of Security for Public-Key Encryption Schemes. In Crypto '98, LNCS 1462, pages 26-45. Springer-Verlag, 1998.
2. M. Bellare and P. Rogaway. Random Oracles are Practical: A Paradigm for De- signing Efficient Protocols. In Proc. of the 1st CCCS, pages 62-73. ACM press, 1993.
3. M. Bellare and P. Rogaway. Optimal Asymmetric Encryption -How to Encrypt with RSA. In Eurocrypt '94, LNCS 950, pages 92-111. Springer-Verlag, 1995.
4. D. Bleichenbacher. A Chosen Ciphertext Attack against Protocols based on the RSA Encryption Standard PKCS #1. In Crypto '98, LNCS 1462, pages 1-12. Springer-Verlag, 1998.
5. V. Boyko, M. Peinado, and R. Venkatesan. Speedings up Discrete Log and Factor- ing Based Schemes via Precomputations. In Eurocrypt '98, LNCS 1403. Springer- Verlag, 1998.
6. R. Canetti, O. Goldreich, and S. Halevi. The Random Oracles Methodology, Re- visited. In Proc. of the 30th STOC. ACM Press, 1998.
7. D. Coppersmith, M. Franklin, J. Patarin, and M. Reiter. Low-Exponent RSA with Related Messages. In Eurocrypt '96, LNCS 1070, pages 1-9. Springer-Verlag, 1996.
8. R. Cramer and V. Shoup. A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack. In Crypto '98, LNCS 1462, pages 13-25. Springer-Verlag, 1998.
9. W. Di_e and M. E. Hellman. New Directions in Cryptography. In IEEE Trans- actions on Information Theory, volume IT-22, no. 6, pages 644-654, November 1976.
10. D. Dolev, C. Dwork, and M. Naor. Non-Malleable Cryptography. In Proc. of the 23rd STOC. ACM Press, 1991.
11. T. El Gamal. A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. In IEEE Transactions on Information Theory, volume IT-31, no. 4, pages 469-472, July 1985.
12. S. Goldwasser and S. Micali. Probabilistic Encryption. Journal of Computer and System Sciences, 28:270-299, 1984.
13. J. Håstad. Solving Simultaneous Modular Equations of Low Degree. SIAM Journal of Computing, 17:336-341, 1988.
14. SET Secure Electronic Transaction LLC. SET Secure Electronic Transaction Speciffication -Book 3: Formal Protocol Deffinition, may 1997. Available from http://www.setco.org/.
15. D. Naccache and J. Stern. A New Cryptosystem based on Higher Residues. In Proc. of the 5th CCCS, pages 59-66. ACM press, 1998.
16. M. Naor and M. Yung. Public-Key Cryptosystems Provably Secure against Chosen Ciphertext Attacks. In Proc. of the 22nd STOC, pages 427-437. ACM Press, 1990.
17. T. Okamoto and S. Uchiyama. A New Public Key Cryptosystem as Secure as Factoring. In Eurocrypt '98, LNCS 1403, pages 308-318. Springer-Verlag, 1998.
18. P. Paillier. Public-Key Cryptosystems Based on Discrete Logarithms Residues. In Eurocrypt '99, LNCS 1592, pages 221-236. Springer-Verlag, 1999.
19. C. Racko_ and D. R. Simon. Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack. In Crypto '91, LNCS 576, pages 433-444. Springer- Verlag, 1992.
20. R. Rivest, A. Shamir, and L. Adleman. A Method for Obtaining Digital Signatures and Public Key Cryptosystems. Communications of the ACM, 21(2):120-126, February 1978.
21. RSA Data Security, Inc. Public Key Cryptography Standards -PKCS. Available from http://www.rsa.com/rsalabs/pubs/PKCS/.
22. V. Strassen. The Computational Complexity of Continued Fractions. SIAM Jour- nal of Computing, 12(1):1-27, 1983.
23. Y. Tsiounis and M. Yung. On the Security of El Gamal based Encryption. In PKC '98, LNCS. Springer-Verlag, 1998.