Security analysis of the Gennaro-Halevi-Rabin signature scheme

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

Volumn 1807, Issue , 2000, Pages 91-101

  Coron, Jean Sébastien ^a   Naccache, David ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b GEMPLUS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

HASH FUNCTIONS;

RABIN SIGNATURE; SECURITY ANALYSIS; SECURITY LEVEL; SIGNATURE SCHEME; STRONG RSA ASSUMPTION;

AUTHENTICATION;

EID: 84948953220     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45539-6_7     Document Type: Conference Paper

References (12)

1. E. Bach and R. Peralta, Asymptotic semismoothness probabilities, Mathematics of computation, vol. 65, no. 216, pp. 1701-1715, 1996.
2. N. Barić and B. Pfitzmann, Collision-free accumulators and fail-stop signature scheme without trees, proceedings of Eurocrypt’97, LNCS vol. 1233, Springer-Verlag, 1997, pp. 480-494.
3. 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.
4. R. Brent, An improved Monte Carlo factorization algorithm, Nordisk Tidskrift för Informationsbehandling (BIT) 20 (1980) pp. 176-184.
5. E. Canfield, P. Erdös and C. Pomerance, On a problem of Oppenheim concerning ’Factorisatio Numerorum’, J. Number Theory, vol. 17, 1983, pp. 1-28.
6. J.S. Coron and D. Naccache, Security analysis of the Gennaro-Halevi-Rabin signature scheme, full version of this paper, available at http://www.eleves.ens.fr:8080/home/coron, 2000.
7. K. Dickman, On the frequency of numbers containing prime factors of a certain relative magnitude, Arkiv för matematik, astronomi och fysik, vol. 22A, no. 10, pp. 1-14, 1930.
8. G. Hardy and E. Wright, An introduction to the theory of numbers, Fifth edition, Oxford, 1979, pp. 354-359, 368-370.
9. R. Gennaro, S. Halevi and T. Rabin, Secure hash-and-sign signatures without the random oracle, proceedings of Eurocrypt’99, LNCS vol. 1592, Springer-Verlag, 1999, pp. 123-139.
10. A. Ivić and G. Tenenbaum, Local densities over integers free of large prime factors, Quart. J. Math. Oxford (2), 37 (1986), pp. 401-417.
11. H. W. Lenstra, Jr., Factoring integers with elliptic curves, Ann. of Math. (2) 126 (1987) pp. 649-673.
12. M.I.R.A.C.L. library, Shamus Software Ltd., 94 Shangan Road, Ballymun, Dublin, Ireland.