{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T04:50:13Z","timestamp":1778215813276,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540611868","type":"print"},{"value":"9783540683391","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-68339-9_34","type":"book-chapter","created":{"date-parts":[[2007,8,5]],"date-time":"2007-08-05T21:31:14Z","timestamp":1186349474000},"page":"399-416","source":"Crossref","is-referenced-by-count":480,"title":["The Exact Security of Digital Signatures-How to Sign with RSA and Rabin"],"prefix":"10.1007","author":[{"given":"Mihir","family":"Bellare","sequence":"first","affiliation":[]},{"given":"Phillip","family":"Rogaway","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"D. Balenson, \u201cPrivacy Enhancement for Internet Electronic Mail: Part III: Algorithms, Modes, and Identifiers,\u201d IETF RFC 1423, February 1993.","DOI":"10.17487\/rfc1423"},{"issue":"1","key":"34_CR2","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/147508.147537","volume":"39","author":"M. Bellare","year":"1992","unstructured":"M. Bellare and S. Micali, \u201cHow to sign given any trapdoor permutation,\u201d JACM Vol. 39, No. 1, 214\u2013233, January 1992.","journal-title":"JACM"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway, \u201cRandom oracles are practical: a paradigm for designing efficient protocols,\u201d Proceedings of the First Annual Conference on Computer and Communications Security, ACM, 1993.","DOI":"10.1145\/168588.168596"},{"key":"34_CR4","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology \u2014 Eurocrypt 94 Proceedings","author":"M. Bbellare","year":"1994","unstructured":"M. Bbellare and P. Rogaway, \u201cOptimal Asymmetric Encryption,\u201d Advances in Cryptology \u2014 Eurocrypt 94 Proceedings, Lecture Notes in Computer Science Vol. 950, A. De Santis ed., Springer-Verlag, 1994."},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M. E. Hellman, \u201cNew directions in cryptography,\u201d IEEE Trans. Info. Theory IT-22, 644\u2013654, November 1976.","journal-title":"IEEE Trans. Info. Theory"},{"key":"34_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology \u2014 Crypto 94 Proceedings","author":"C. Dwork","year":"1994","unstructured":"C. Dwork and M. Naor. An efficient existentially unforgeable signature scheme and its applications. Advances in Cryptology \u2014 Crypto 94 Proceedings, Lecture Notes in Computer Science Vol. 839, Y. Desmedt ed., Springer-Verlag, 1994."},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"T. El Gamal, \u201cA public key cryptosystem and a signature scheme based on discrete logarithms,\u201d IEEE Transactions on Information Theory, Vol. 31, No. 4, July 1985.","DOI":"10.1109\/TIT.1985.1057074"},{"key":"34_CR8","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology \u2014 Crypto 86 Proceedings","author":"A. Fiat","year":"1986","unstructured":"A. Fiat and A. Shamir, \u201cHow to prove yourself: practical solutions to identification and signature problems,\u201d Advances in Cryptology \u2014 Crypto 86 Proceedings, Lecture Notes in Computer Science Vol. 263, A. Odlyzko ed., Springer-Verlag, 1986."},{"issue":"2","key":"34_CR9","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali and R. Rivest, \u201cA digital signature scheme secure against adaptive chosen-message attacks,\u201d SIAM Journal of Computing, 17(2):281\u2013308, April 1988.","journal-title":"SIAM Journal of Computing"},{"key":"34_CR10","unstructured":"ISO\/IEC 9796, \u201cInformation Technology Security Techniques \u2014 Digital Signature Scheme Giving Message Recovery,\u201d International Organization for Standards, 1991."},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"M. Naor and M. Yung, \u201cUniversal one-way hash functions and their cryptographic applications,\u201d Proceedings of the 21st Annual Symposium on Theory of Computing, ACM, 1989.","DOI":"10.1145\/73007.73011"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"A. Lenstra and H. Lenstra (eds.), \u201cThe development of the number field sieve,\u201d Lecture Notes in Mathematics, vol 1554, Springer-Verlag, 1993.","DOI":"10.1007\/BFb0091534"},{"key":"34_CR13","series-title":"Lect Notes Comput Sci","volume-title":"Advances in cryptology \u2014 Eurocrypt 96 Proceedings","author":"D. Pointcheval","year":"1996","unstructured":"D. Pointcheval and J. Stern, \u201cSecurity proofs for signatures,\u201d Advances in cryptology \u2014 Eurocrypt 96 Proceedings, Lecture Notes in Computer Science, U. Maurer ed., Springer-Verlag, 1996."},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"R. Rivest, \u201cThe MD5 Message-Digest Algorithm,\u201d IETF RFC 1321, April 1992.","DOI":"10.17487\/rfc1321"},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"R. Rivest, A. Shamir and L. Adleman, \u201cA method for obtaining digital signatures and public key cryptosystems,\u201d CACM 21 (1978).","DOI":"10.21236\/ADA606588"},{"key":"34_CR16","unstructured":"RSA Data Security, Inc., \u201cPKCS #1: RSA Encryption Standard (Version 1.4).\u201d June 1991."},{"key":"34_CR17","unstructured":"RSA Data Security, Inc., \u201cPKCS #7: Cryptographic Message Syntax Standard (version 1.4).\u201d June 1991."},{"key":"34_CR18","unstructured":"M. Rabin, \u201cDigital signatures,\u201d in Foundations of secure computation, R. A. Millo et. al. eds, Academic Press, 1978."},{"key":"34_CR19","unstructured":"M. Rabin., \u201cDigital signatures and public key functions as intractable as factorization,\u201d MIT Laboratory for Computer Science Report TR-212, January 1979."},{"key":"34_CR20","doi-asserted-by":"crossref","unstructured":"J. Rompel, \u201cOne-Way Functions are Necessary and Sufficient for Secure Signatures,\u201d Proceedings of the 22nd Annual Symposium on Theory of Computing, ACM, 1990.","DOI":"10.1145\/100216.100269"},{"key":"34_CR21","doi-asserted-by":"crossref","unstructured":"H. Williams, \u201cA modification of the RSA public key encryption procedure,\u201d IEEE Transactions on Information Theory, Vol. IT-26, No. 6, November 1980.","DOI":"10.1109\/TIT.1980.1056264"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201996"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-68339-9_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T15:33:01Z","timestamp":1556724781000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-68339-9_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540611868","9783540683391"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-68339-9_34","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1996]]}}}