A new signature scheme without random oracles from bilinear pairings

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

Volumn 4341 LNCS, Issue , 2006, Pages 67-80

  Zhang, Fangguo ^a,b   Chen, Xiaofeng ^a,b   Susilo, Willy ^c   Mu, Yi ^c  

^a SUN YAT SEN UNIVERSITY   (China)

^b Guangdong Key Laboratory of Information Security Technology   (China)

^c UNIVERSITY OF WOLLONGONG   (Australia)

Author keywords

Bilinear pairings; Random oracle; Short signature; Standard model

Indexed keywords

NETWORK SECURITY; PUBLIC KEY CRYPTOGRAPHY;

BILINEAR PAIRING; CHOSEN MESSAGE ATTACKS; COMPLEXITY ASSUMPTIONS; RANDOM ORACLE; RANDOM ORACLE MODEL; SHORT SIGNATURES; STANDARD MODEL; WITHOUT RANDOM ORACLES;

AUTHENTICATION;

EID: 84887307535     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11958239_5     Document Type: Conference Paper

References (28)

1. M. Abe and T. Okamoto. A signature scheme with message recovery as secure as discrete logarithm. Advances in Cryptology-Asiacrypt 1999, LNCS 1716, pp. 378-389, Springer-Verlag, 1999.
2. P.S.L.M. Barreto, H.Y. Kim, B. Lynn, and M. Scott, Efficient algorithms for pairing-based cryptosystems, Advances in Cryptology-Crypto 2002, LNCS 2442, pp. 354-368, Springer-Verlag, 2002.
3. M. Bellare and P. Rogaway, Random oracles are practical: a paradigm for designing effiient protocols, Proceedings of the 1st ACM Conference on Computer and Communications Security, pp. 62-73, ACM press, 1993.
4. M. Bellare and P. Rogaway, The exact security of digital signatures - How to sign with RSA and Rabin, Advances in Cryptology-Eurocrypt 1996, LNCS 1070, pp. 399-416, Springer-Verlag, 1996.
5. D. Boneh and X. Boyen, Short signatures without random oracles, Advances in Cryptology-Eurocrypt 2004, LNCS 3027, pp. 56-73, Springer-Verlag, 2004.
6. D. Boneh, X. Boyen and H. Shacham, Short group signatures, Advances in Cryptology-Crypto 2004, LNCS 3152, pp. 41-55, Springer-Verlag, 2004.
7. D. Boneh and M. Franklin, Identity-based encryption from the Weil pairing, Advances in Cryptology-Crypto 2001, LNCS 2139, pp. 213-229, Springer-Verlag, 2001.
8. D. Boneh, C. Gentry, B. Lynn and H. Shacham, Aggregate and verifiably encrypted signatures from bilinear maps, Advances in Cryptology-Eurocrypt 2003, LNCS 2656, pp. 272-293, Springer-Verlag, 2003.
9. D. Boneh, B. Lynn, and H. Shacham, Short signatures from the Weil pairing, Advances in Cryptology-Asiacrypt 2001, LNCS 2248, pp. 514-532, Springer-Verlag, 2001.
10. D. Boneh, I. Mironov and V. Shoup, A secure signature scheme from bilinear maps, CT-RSA 2003, LNCS 2612, pp. 98-110, Springer-Verlag, 2003.
11. J. Camenisch and A. Lysyanskaya, A signature scheme with efficient protocols, SCN 2002, LNCS 2576, pp. 274-295, Springer-Verlag, 2003.
12. J. Camenisch and A. Lysyanskaya, Signature schemes and anonymous credentials from bilinear maps, Advances in Cryptology-Crypto 2004, LNCS 3152, pp. 56-72, Springer-Verlag, 2004.
13. J.H. Cheon, Security analysis of the strong Diffie-Hellman problem, Advances in Cryptology-Eurocrypt 2006, LNCS 4004, pp. 1-11, Springer-Verlag, 2006.
14. N. Courtois, M. Daum and P. Felke, On the security of HFE, HFEv- and Quartz, PKC 2003, LNCS 2567, pp. 337-350. Springer-Verlag, 2003.
15. N.T. Courtois, M. Finiasz and N. Sendrier, How to achieve a McEliece-based Digital Signature Schem, Advances in Cryptology-Asiacrypt 2001, LNCS 2248, pp. 157-174, Springer-Verlag, 2001.
16. R. Cramer and V. Shoup, Signature schemes based on the strong RSA assumption, Proceedings of the 6th ACM Conference on Computer and Communications Security, pp. 46-52, ACM press, 1999.
17. p -x+d, Advances in Cryptology-Asiacrypt 2003, LNCS 2894, pp. 111-123, Springer-Verlag, 2003.
18. M. Fischlin, The Cramer-Shoup strong-RSA signature scheme revisited, PKC 2003, LNCS 2567, pp. 116-129, Springer-Verlag, 2003.
19. S. D. Galbraith, K. Harrison, and D. Soldera, Implementing the Tate pairing, ANTS 2002, LNCS 2369, pp. 324-337, Springer-Verlag, 2002.
20. R. Gennaro, S. Halevi and T. Rabin, Secure hash-and-sign signature without the random oracle, Advances in Cryptology-Eurocrypt 1999, LNCS 1592, pp. 123-139, Springer-Verlag, 1999.
21. S. Goldwasser, S. Micali and R. Rivest, A 'paradoxical' solution to the signature problem (extended abstract), Proc. of FOCS'84, pp. 441-448, 1984.
22. 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-308, 1988.
23. A. Joux, The Weil and Tate pairings as building blocks for public key cryptosystems, ANTS 2002, LNCS 2369, pp. 20-32, Springer-Verlag, 2002
24. D. Naccache and J. Stern, Signing on a postcard, Financial Cryptography and Data Security 2000, LNCS 1962, pp. 121-135, Springer-Verlag, 2000.
25. K. Nyberg and R. Rueppel, A new signature scheme based on the DSA, giving message recovery, Proceedings of the 1st ACM Conference on Communications and Computer Security, pp. 58-61, 1993.
26. J. Patarin, N. Courtois and L. Goubin, QUARTZ, 128-bit long digital signatures, CT-RSA 2001, LNCS 2020, pp. 282-297, Springer-Verlag, 2001.
27. F. Zhang, X. Chen, W. Susilo and Y. Mu, A New Signature Scheme without Random Oracles and Its Applications, Cryptology ePrint Archive: Report 2005/386.
28. F. Zhang, R. Safavi-Naini and W. Susilo, An efficient signature scheme from bilinear pairings and its applications, PKC 2004, LNCS 2947, pp. 277-290, Springer-Verlag, 2004.