{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T05:08:00Z","timestamp":1750136880747},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540675174"},{"type":"electronic","value":"9783540455394"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45539-6_7","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:26:08Z","timestamp":1184588768000},"page":"91-101","source":"Crossref","is-referenced-by-count":32,"title":["Security Analysis of the Gennaro-Halevi-Rabin Signature Scheme"],"prefix":"10.1007","author":[{"given":"Jean-S\u00e9bastien","family":"Coron","sequence":"first","affiliation":[]},{"given":"David","family":"Naccache","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,5,12]]},"reference":[{"issue":"216","key":"7_CR1","doi-asserted-by":"publisher","first-page":"1701","DOI":"10.1090\/S0025-5718-96-00775-2","volume":"65","author":"E. Bach","year":"1996","unstructured":"E. Bach and R. Peralta, Asymptotic semismoothness probabilities, Mathematics of computation, vol. 65, no. 216, pp. 1701\u20131715, 1996.","journal-title":"Mathematics of computation"},{"key":"7_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1007\/3-540-69053-0_33","volume-title":"proceedings of Eurocrypt\u201997","author":"N. Bari\u0107","year":"1997","unstructured":"N. Bari\u0107 and B. Pfitzmann, Collision-free accumulators and fail-stop signature scheme without trees, proceedings of Eurocrypt\u201997, LNCS vol. 1233, Springer-Verlag, 1997, pp. 480\u2013494."},{"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.","key":"7_CR3","DOI":"10.1145\/168588.168596"},{"key":"7_CR4","first-page":"176","volume":"20","author":"R. Brent","year":"1980","unstructured":"R. Brent, An improved Monte Carlo factorization algorithm, Nordisk Tidskrift f\u00f6r Informationsbehandling (BIT) 20 (1980) pp. 176\u2013184.","journal-title":"Nordisk Tidskrift f\u00f6r Informationsbehandling (BIT)"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-314X(83)90002-1","volume":"17","author":"E. Canfield","year":"1983","unstructured":"E. Canfield, P. Erd\u00f6s and C. Pomerance, On a problem of Oppenheim concerning \u2018Factorisatio Numerorum\u2019, J. Number Theory, vol. 17, 1983, PP. 1\u201328.","journal-title":"J. Number Theory"},{"unstructured":"J.S. Coron and D. Naccache, Security analysis of the Gennaro-Halevi-Rabin signature scheme, full version of this paper, available at \n                    http:\/\/www.eleves.ens.fr:8080\/home\/coron\n                    \n                  , 2000.","key":"7_CR6"},{"issue":"10","key":"7_CR7","first-page":"1","volume":"22A","author":"K. Dickman","year":"1930","unstructured":"K. Dickman, On the frequency of numbers containing prime factors of a certain relative magnitude, Arkiv f\u00f6r matematik, astronomi och fysik, vol. 22A, no. 10, pp. 1\u201314, 1930.","journal-title":"Arkiv f\u00f6r matematik, astronomi och fysik"},{"unstructured":"G. Hardy and E. Wright, An introduction to the theory of numbers, Fifth edition, Oxford, 1979, pp. 354\u2013359, 368\u2013370.","key":"7_CR8"},{"key":"7_CR9","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\u201999","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\u201999, LNCS vol. 1592, Springer-Verlag, 1999, pp. 123\u2013139."},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1093\/qmath\/37.4.401","volume":"37","author":"A. Ivi\u0107","year":"1986","unstructured":"A. Ivi\u0107 and G. Tenenbaum, Local densities over integers free of large prime factors, Quart. J. Math. Oxford (2), 37 (1986), pp. 401\u2013417.","journal-title":"Quart. J. Math. Oxford (2)"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"H. W. Lenstra Jr.","year":"1987","unstructured":"H. W. Lenstra, Jr., Factoring integers with elliptic curves, Ann. of Math. (2) 126 (1987) pp. 649\u2013673.","journal-title":"Ann. of Math. (2)"},{"unstructured":"M.I.R.A.C.L. library, Shamus Software Ltd., 94 Shangan Road, Ballymun, Dublin, Ireland.","key":"7_CR12"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45539-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T20:25:31Z","timestamp":1550435131000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45539-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540675174","9783540455394"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45539-6_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}