{"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":1772283640279,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540658894","type":"print"},{"value":"9783540489108","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48910-x_9","type":"book-chapter","created":{"date-parts":[[2007,10,10]],"date-time":"2007-10-10T13:57:35Z","timestamp":1192024655000},"page":"123-139","source":"Crossref","is-referenced-by-count":203,"title":["Secure Hash-and-Sign Signatures Without the Random Oracle"],"prefix":"10.1007","author":[{"given":"Rosario","family":"Gennaro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shai","family":"Halevi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tal","family":"Rabin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,4,15]]},"reference":[{"key":"9_CR1","first-page":"480","volume":"1233","author":"N. Bari\u0107","year":"1997","unstructured":"N. Bari\u0107, and B. Pfitzmann. Collision-free accumulators and Fail-stop signature schemes without trees. In Advances in Cryptology \u2014 Eurocrypt\u2019 97, LNCS vol. 1233, Springer, 1997, pages 480\u2013494.","journal-title":"Advances in Cryptology \u2014 Eurocrypt\u2019 97, LNCS"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway. Random Oracles are Practical: a Paradigm for Designing Efficient Protocols. In 1st Conf. on Computer and Communications Security, ACM, pages 62\u201373, 1993.","DOI":"10.1145\/168588.168596"},{"key":"9_CR3","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/3-540-68339-9_34","volume":"1070","author":"M. Bellare","year":"1996","unstructured":"M. Bellare and P. Rogaway. The Exact Security of Digital Signatures: How to Sign with RSA and Rabin. In Advances in Cryptology \u2014 Eurocrypt\u2019 96, LNCS vol. 1070, Springer-Verlag, 1996, pages 399\u2013416.","journal-title":"Advances in Cryptology \u2014 Eurocrypt\u2019 96, LNCS"},{"issue":"2","key":"9_CR4","first-page":"156","volume":"37","author":"G. Brassard","year":"1988","unstructured":"G. Brassard, D. Chaum, and C. Cr\u00e9peau. Minimum disclosure proofs of knowledge. JCSS, 37(2):156\u2013189, 1988.","journal-title":"JCSS"},{"key":"9_CR5","unstructured":"R. Canetti, O. Goldreich and S. Halevi. The Random Oracle Methodology, Revisited. STOC\u2019 98, ACM, 1998, pages ???-???."},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"L. Carter","year":"1979","unstructured":"L. Carter and M. Wegman. Universal Hash Functions. J. of Computer and System Science 18, 1979, pp. 143\u2013154.","journal-title":"J. of Computer and System Science"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/3-540-68697-5_14","volume":"1109","author":"R. Cramer","year":"1996","unstructured":"R. Cramer and I. Damg\u00e5rd. New generation of secure and practical RSA-based signatures. In Advances in Cryptology \u2014 CRYPTO\u2019 96, LNCS vol. 1109, Springer-Verlag, 1996, pages 173\u2013185.","journal-title":"Advances in Cryptology \u2014 CRYPTO\u2019 96, LNCS"},{"key":"9_CR8","series-title":"Lect Notes Comput Sci","first-page":"203","volume-title":"Advances in Cryptology \u2014 Eurocrypt\u2019 87","author":"I. Damg\u00e5rd","year":"1987","unstructured":"I. Damg\u00e5rd. Collision free hash functions and public key signature schemes. In Advances in Cryptology \u2014 Eurocrypt\u2019 87, LNCS vol. 304, Springer, 1987, pages 203\u2013216."},{"issue":"3","key":"9_CR9","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":"9_CR10","unstructured":"National Institute for Standards and Technology. Secure Hash Standard, April 17 1995."},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"R. Gennaro, D. Micciancio, and T. Rabin. An Efficient Non-Interactive Statistical Zero-Knowledge Proof System for Quasi-Safe Prime Products. Proceedings of 1998 ACM Conference on Computers and Communication Security.","DOI":"10.1145\/288090.288108"},{"issue":"2","key":"9_CR12","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 J. Computing, 17(2):281\u2013308, April 1988.","journal-title":"SIAM J. Computing"},{"key":"9_CR13","unstructured":"National Institute of Standards and Technology. Digital Signature Standard (DSS), Technical report 169, August 30, 1991."},{"key":"9_CR14","first-page":"673","volume-title":"Handbook of theoretical computer science, Volume A (Algorithms and Complexity)","author":"A.K. Lenstra","year":"1990","unstructured":"A.K. Lenstra and H.W. Lenstra, Jr. Algorithms in number theory. In Handbook of theoretical computer science, Volume A (Algorithms and Complexity), J. Van Leeuwen (editor), MIT press\/ Elsevier, 1990. Pages 673\u2013715."},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"D. Pointcheval and J. Stern. Security Proofs for Signature Schemes. In Advances in Cryptology \u2014 Proceedings of EUROCRYPT\u201996, LNCS vol. 1070, Springer-Verlag, pages 387\u2013398.","DOI":"10.1007\/3-540-68339-9_33"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"R. Rivest, A. Shamir and L. Adelman. A Method for Obtaining Digital Signature and Public Key Cryptosystems. Comm. of ACM, 21 (1978), pp. 120\u2013126","journal-title":"Comm. of ACM"},{"issue":"1","key":"9_CR17","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/357353.357357","volume":"1","author":"A. Shamir","year":"1983","unstructured":"A. Shamir. On the generation of cryptographically strong pseudorandom sequences. ACM Trans. on Computer Systems, 1(1), 1983, pages 38\u201344.","journal-title":"ACM Trans. on Computer Systems"},{"key":"9_CR18","unstructured":"H. Krawczyk and T. Rabin. Chameleon Hashing and Signatures. manuscript."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48910-X_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T04:59:40Z","timestamp":1550984380000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48910-X_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540658894","9783540489108"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-48910-x_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}