{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:00:40Z","timestamp":1772283640305,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540435532","type":"print"},{"value":"9783540460350","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46035-7_18","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T12:21:56Z","timestamp":1186834916000},"page":"272-287","source":"Crossref","is-referenced-by-count":133,"title":["Optimal Security Proofs for PSS and Other Signature Schemes"],"prefix":"10.1007","author":[{"given":"Jean-S\u00e9bastien","family":"Coron","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,4,29]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/168588.168596"},{"key":"18_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/3-540-68339-9_34","volume-title":"Proceedings of Eurocrypt\u201996","author":"M. Bellare","year":"1996","unstructured":"M. Bellare and P. Rogaway, The exact security of digital signatures-How to sign with RSA and Rabin. Proceedings of Eurocrypt\u201996, LNCS vol. 1070, Springer-Verlag, 1996, pp. 399\u2013416."},{"key":"18_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BFb0054117","volume-title":"Proceedings of Eurocrypt\u2019 98","author":"D. Boneh","year":"1998","unstructured":"D. Boneh and R. Venkatesan, Breaking RSA may not be equivalent to factoring. Proceedings of Eurocrypt\u2019 98, LNCS vol. 1403, Springer-Verlag, 1998, pp. 59\u201371."},{"key":"18_CR4","unstructured":"R. Canetti, O. Goldreich and S. Halevi, The random oracle methodology, revisited, STOC\u2019 98, ACM, 1998."},{"key":"18_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/3-540-44598-6_14","volume-title":"Proceedings of Crypto 2000","author":"J.S. Coron","year":"2000","unstructured":"J.S. Coron, On the exact security of Full Domain Hash, Proceedings of Crypto 2000, LNCS vol. 1880, Springer-Verlag, 2000, pp. 229\u2013235."},{"key":"18_CR6","unstructured":"J.S. Coron, Security proofs for PSS and other signature schemes, Cryptology ePrint Archive, Report 2001\/062, 2001. http:\/\/eprint.iacr.org"},{"key":"18_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/3-540-68697-5_14","volume-title":"Proceedings of Crypto\u201996","author":"R. Cramer","year":"1996","unstructured":"R. Cramer and I. Damg\u00e5rd, New generation of secure and practical RSA-based signatures, Proceedings of Crypto\u201996, LNCS vol. 1109, Springer-Verlag, 1996, pp. 173\u2013185."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"R. Cramer and V. Shoup, Signature schemes based on the Strong RSA Assumption, May 9, 2000, revision of the extended abstract in Proc. 6th ACM Conf. on Computer and Communications Security, 1999; To appear, ACM Transactions on Information and System Security (ACM TISSEC). Available at http:\/\/www.shoup.net\/","DOI":"10.1145\/319709.319716"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"6","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M. Hellman, New directions in cryptography, IEEE Transactions on Information Theory, IT-22, 6, pp. 644\u2013654, 1976.","journal-title":"IEEE Transactions on Information Theory, IT-22"},{"issue":"3","key":"18_CR10","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s001459900043","volume":"11","author":"C. Dwork","year":"1998","unstructured":"C. Dwork and M. Naor, An efficient existentially unforgeable signature scheme and its applications, In J. of Cryptology, 11(3), Summer 1998, pp. 187\u2013208.","journal-title":"J. of Cryptology"},{"key":"18_CR11","unstructured":"FIPS 186, Digital signature standard, Federal Information Processing Standards Publication 186, U.S. Department of Commerce\/NIST, 1994."},{"key":"18_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/3-540-48910-X_9","volume-title":"proceedings of Eurocrypt\u2019 99","author":"R. Gennaro","year":"1999","unstructured":"R. Gennaro, S. Halevi and T. Rabin, Secure hash-and-sign signatures without the random oracle, proceedings of Eurocrypt\u2019 99, LNCS vol. 1592, Springer-Verlag, 1999, pp. 123\u2013139."},{"issue":"2","key":"18_CR13","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"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\u2013308, April 1988.","journal-title":"SIAM Journal of computing"},{"key":"18_CR14","unstructured":"IEEE P1363a, Standard Specifications For Public Key Cryptography: Additional Techniques, available at http:\/\/www.manta.ieee.org\/groups\/1363"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"A. Lenstra and H. Lenstra (eds.), The development of the number field sieve, Lecture Notes in Mathematics, vol 1554, Springer-Verlag, 1993.","DOI":"10.1007\/BFb0091534"},{"key":"18_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BFb0055741","volume-title":"Prooceedings of Crypto\u2019 98","author":"K. Ohta","year":"1998","unstructured":"K. Ohta and T. Okamoto, On concrete security treatment of signatures derived from identification. Prooceedings of Crypto\u2019 98, Lecture Notes in Computer Science vol. 1462, Springer-Verlag, 1998, pp. 354\u2013369."},{"key":"18_CR17","unstructured":"P. Paillier, Public-key cryptosystems based on composite degree residuosity classes. Proceedings of Eurocrypt\u201999, Lecture Notes is Computer Science vol. 1592, Springer-Verlag, 1999, pp. 223\u2013238."},{"key":"18_CR18","unstructured":"PKCS #1 v2.1, RSA Cryptography Standard (draft), available at http:\/\/www.rsasecurity.com\/rsalabs\/pkcs ."},{"key":"18_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/3-540-68339-9_33","volume-title":"Proceedings of Eurocrypt\u201996","author":"D. Pointcheval","year":"1996","unstructured":"D. Pointcheval and J. Stern, Security proofs for signature schemes. Proceedings of Eurocrypt\u201996, LNCS vol. 1070, Springer-Verlag, pp. 387\u2013398."},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"R. Rivest, A. Shamir and L. Adleman, A method for obtaining digital signatures and public key cryptosystems, CACM 21, 1978.","DOI":"10.21236\/ADA606588"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46035-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:20:29Z","timestamp":1556752829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46035-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540435532","9783540460350"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-46035-7_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}