The exact security of digital signatures-how to sign with RSA and rabin

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

Volumn 1070, Issue , 1996, Pages 399-416

  Bellare, Mihir ^a   Rogaway, Phillip ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; HASH FUNCTIONS;

COMPUTATIONAL EFFORT; COMPUTATIONAL RESOURCES; EXACT SECURITY; MESSAGE RECOVERY; OPTIMAL EFFICIENCY; PROVABLY SECURE; RABIN SIGNATURE; SECURITY PROPERTIES;

NETWORK SECURITY;

EID: 84947906522     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68339-9_34     Document Type: Conference Paper

References (21)

1. D. Balenson, "Privacy Enhancement for Internet Electronic Mail: Part III: Algorithms, Modes, and Identifiers," IETF RFC 1423, February 1993.
2. M. Bellare and S.Micali, "How to sign given any trapdoor permutation," JACM Vol. 39, No. 1, 214-233, January 1992.
3. M. Bellare and P. Rogaway, "Random oracles are practical: a paradigm for designing efficient protocols," Proceedings of the First Annua/Conference on Computer and Communications Security, ACM, 1993.
4. M. Bellare and P. Rogaway, "Optimal Asymmetric Encryption," Advances in Cryptology - Eurocrypt 94Proceedings, Lecture Notes in Computer Science Vol. 950, A. De Santis ed., Springer-Verlag, 1994.
5. W.Diffir and M. E. Hellman, "New directions in cryptography," IEEE Trans. Info. Theory IT-22, 644-654, November 1976.
6. C.DWORK AND M.Naor. An efficient existentially unforgeable signature scheme and its applications.Advances in Cryptology-Crypto 94Proceedings, Lecture Notes in Computer Science Vol. 839, Y. Desmedt ed., Springer-Verlag, 1994.
7. T. El Gamal, "A public key cryptosystem and a signature scheme based on discrete logarithms," IEEE Transactions on Information Theory, Vol. 31, No. 4, July 1985.
8. A.Fiat and A.Shamir, "How to prove yourself: practical solutions to identification and signature problems," Advances in Cryptology-Crypto 86Proceedings, Lecture Notes in Computer Science Vol. 263, A. Odlyzko ed., Springer-Verlag, 1986.
9. S.Goldwasser, S.Micali and R. Rivest, "A digital signature scheme secure against adaptive chosen-message attacks," SIAM Journal of Computing, 17(2):281- 308, April 1988.
10. ISO/IEC 9796, "Information Technology Security Techniques - Digital Signature Scheme Giving Message Recovery," International Organization for Standards, 1991.
11. U. M.Naor and M.Yung, "Universal one-way hash functions and their cryptographic applications," Proceedings of the 21st Annual Symposium on Theory ofComputing, ACM, 1989.
12. A.Lenstra and H.Lenstra (eds.), "The development of the number field sieve," Lecture Notes in Mathematics, vol 1554, Springer-Verlag, 1993.
13. D.Pointcheval and J.Stern, "Security proofs for signatures," Advances in cryptology-Eurocrypt 96 Proceedings, Lecture Notes in Computer Science, U. Maurer ed., Springer-Verlag, 1996.
14. R. Rivest, "The MD5 Message-Digest Algorithm," IBTFRFC 1321, April 1992.
15. R.Rivest, A. Shamir and L. Adleman, "A method for obtaining digital signatures and public key cryptosystems," CACM 21 (1978).
16. RSA Data Security, Inc., "PKCS #1: RSA Encryption Standard (Version 1.4)." June 1991.
17. RSA Data Security, Inc., "PKCS #7: Cryptographic Message Syntax Standard (version 1.4)." June 1991.
18. M. Rabin, "Digital signatures," inFoundations of secure computation, R. A. Millo et. al. eds, Academic Press, 1978.
19. M. Rabin., "Digital signatures and public key functions as intractable as factorization," MIT Laboratory for Computer Science Report TR-212, January 1979.
20. J.Rompel, "One-Way Functions are Necessary and Sufficient for Secure Signatures," Proceedings of the 22ndAnnual Symposium on Theory of Computing, ACM, 1990.
21. H. Williams, "A modification of the RSA public key encryption procedure," IEEE Transactions on Information Theory, Vol. IT-26, No. 6, November 1980.