Universal padding schemes for RSA

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

Volumn 2442, Issue , 2002, Pages 226-241

  Coron, Jean Sébastien ^a   Joye, Marc ^a   Naccache, David ^a   Paillier, Pascal ^a  

^a GEMPLUS   (France)

Author keywords

Probabilistic signature scheme; Provable security

Indexed keywords

AUTHENTICATION; MOBILE SECURITY; PUBLIC KEY CRYPTOGRAPHY;

CHOSEN CIPHERTEXT ATTACK; ENCRYPTION SCHEMES; ONE-WAY PERMUTATION; PADDING SCHEME; PROBABILISTIC SIGNATURE SCHEMES; PROVABLE SECURITY; RANDOM ORACLE MODEL; UNIVERSAL PADDING SCHEMES;

CRYPTOGRAPHY;

EID: 84937413370     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-45708-9_15     Document Type: Article

References (17)

1. M. Bellare and P. Rogaway, Random oracles are practical: a paradigm for designing efficient protocols. Proceedings of the First Annual Conference on Computer and Commmunications Security, ACM, 1993
2. M. Bellare and P. Rogaway, Optimal Asymmetric Encryption, Proceedings of Eurocrypt’ 94, LNCS vol. 950, Springer-Verlag, 1994, pp. 92-111
3. M. Bellare and P. Rogaway, The exact security of digital signatures - How to sign with RSA and Rabin. Proceedings of Eurocrypt’96, LNCS vol. 1070, Springer- Verlag, 1996, pp. 399-416
4. D. Boneh, Simplified OAEP for the RSA and Rabin functions, Prooceedings of Crypto 2001, LNCS vol 2139, pp. 275-291, 2001
5. D. Boneh and R. Venkatesan, Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes. Proceedings of Crypto ’96, pp. 129-142, 1996
6. R. Canetti, O. Goldreich and S. Halevi, The random oracle methodology, revisited, STOC’ 98, ACM, 1998
7. D. Coppersmith, Finding a small root of a univariate modular equation, in Eurocrypt ’96, LNCS 1070
8. J.S. Coron, M. Joye, D. Naccache and P. Paillier, Universal padding schemes for RSA. Full version of this paper. Cryptology ePrint Archive, http://eprint.iacr.org
9. E. Fujisaki, T. Okamoto, D. Pointcheval and J. Stern, RSA-OAEP is secure under the RSA assumption, Proceedings of Crypto’ 2001, LNCS vol. 2139, Springer- Verlag, 2001, pp. 260-274
10. S. Goldwasser, S. Micali and R. Rivest, A digital signature scheme secure against adaptive chosen-message attacks, SIAM Journal of computing, 17(2), pp. 281-308, April 1988
11. S. Haber and B. Pinkas, Combining Public Key Cryptosystems, Proceedings of the ACM Computer and Security Conference, November 2001
12. IEEE P1363a, Standard Specifications For Public Key Cryptography: Additional Techniques, available at http://www.manta.ieee.org/groups/1363
13. J. Manger, A chosen ciphertext attack on RSA Optimal Asymmetric Encryption Padding (OAEP) as Standardized in PKCS #1 v2.0. Proceedings of Crypto 2001, LNCS 2139, pp. 230-238, 2001
14. PKCS #1 v2.1, RSA Cryptography Standard (draft), available at http: www.rsasecurity.com/rsalabs/pkcs
15. C. Rackoff and D. Simon, Noninteractive zero-knowledge proof of knowledge and chosen ciphertext attack. Advances in Cryptology, Crypto ’91, pages 433-444, 1991
16. R. Rivest, A. Shamir and L. Adleman, A method for obtaining digital signatures and public key cryptosystems, CACM 21, 1978
17. V. Shoup, OAEP reconsidered, Proceedings of Crypto 2001, LNCS vol. 2139, pp 239-259, 2001