Efficient identity-based signatures and blind signatures

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

Volumn 3810 LNCS, Issue , 2005, Pages 120-133

  Huang, Zhenjie ^a,b,c   Chen, Kefei ^a   Wang, Yumin ^c  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b MINNAN NORMAL UNIVERSITY   (China)

^c XIDIAN UNIVERSITY   (China)

Author keywords

Bilinear pairings; Blind signature; Gap Diffie Hellman group; Identity based; Signature

Indexed keywords

COMPUTER CRIME; COMPUTER PRIVACY; DATA PRIVACY; PROBLEM SOLVING; SECURITY OF DATA;

BILINEAR PAIRINGS; BLIND SIGNATURE; GAP DIFFIE-HELLMAN GROUP; IDENTITY-BASED BLIND SIGNATURE;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 33744787065     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11599371_11     Document Type: Conference Paper

References (20)

1. P. Barreto, H. Kim, B. Lynn and M. Scott, Efficient algorithms for pairingbased cryptosystems, In: Advances in Cryptology-Crypto 2002, Lecture Notes in Computer Science, Vol.2442, Springer-Verlag, 2002, pp.354- 368.
2. D. Boneh, M. Franklin, Identity-based encryption from the Weil pairing, In: Advances in Cryptology - Crypto 2001, Lecture Notes in Computer Science, Vol.2139, Springer-Verlag, 2001, pp.213-229.
3. D. Boneh, B. Lynn, H. Shacham, Short signatures from the Weil pairing, In: Advances in Cryptol-ogy-Asiacrypt 2001, Lecture Notes in Computer Science, Vol.2248, Springer-Verlag, 2001, pp.514-532.
4. J. Cha, J.Cheon, An identity-based signature from gap Diffie-Hellman groups, In: Public Key Cryp-tography - PKC 2003, Lecture Notes in Computer Science, Vol. 2567, Springer- Verlag, 2003, pp. 18-30.
5. R. Dutta, R. Barua, P. Sarkar, Pairing-based cryptography: a survey, IACR preprint sever, submission 2004/064, 2004.
6. D. Chaum, Blind signatures for untraceable payments, In: Advances in Cryptology-Crypto 82, 1983, Plenum, NY, pp.199-203.
7. G. Frey, H. Rück, A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves, Mathematics of Computation, 1994, 62: 865-874.
8. S. Galbraith, K. Harrison and D. Soldera, Implementing the Tate pairing, In: Algorithm Number Theory Symposium- ANTS 2002, Lecture Notes in Computer Science, Vol.2369, Springer-Verlag, 2002, pp.324-337.
9. F. Hess, Efficient identity based signature schemes based on pairings, In: Selected Areas in Cryptography - SAC 2002, Lecture Notes in Computer Science, Vol.2595, Springer-Verlag, 2002, pp.310-324.
10. A. Joux, The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems, In: Algorithm Number Theory Symposium- ANTS 2002, Lecture Notes in Computer Science, Vol.2369, Springer-Verlag, 2002, pp.20-32.
11. A. Menezes, T. Okamoto, and S. Vanstone, Reducing elliptic curve logarithms to logarithms in a finite field, IEEE Transaction on Information Theory, 1993, 39:1639-1646.
12. K. Paterson, ID-based signatures from pairings on elliptic curves, Electronics Letters, 2002, 38(18):1025-1026.
13. D. Pointcheval, J. Stern, Security arguments for digital signatures and blind signatures, J. of Cryptology, 2000, 13: 361-396.
14. R. Sakai, K. Ohgishi and M. Kasahara, CryptoSystems based on pairing, In: 2000 Symposium on Cryptography and Information Security (SCIS2000), Okinawa, Japan, 2000, pp.26-28.
15. C. Schnorr, Security of blind discrete log signatures against interactive attacks, In: Information and Communications Security - ICICS 2001, Lecture Notes in Computer Science, Vol.2229, Springer-Verlag, 2001, pp. 1-12.
16. A. Shamir, Identity-base cryptosystems and signature schemes, In: Advances in Cryptology - Crypto'84, Lecture Notes in Computer Science, Vol. 196, Springer-Verlag, 1985, pp. 47-53.
17. K. Shim, Efficient ID-based authenticated key agreement protocol based on Weil pairing, Electronics Letters, 2003, 39(8): 653-654.
18. X. Yi, Efficient ID-based key agreement from Weil pairing, Electronics Letters, 2003, 39(2): 206-208.
19. F. Zhang, K. Kim, ID-based blind signature and ring signature from pairings, In: Advances in Cryptology - Asiacrpt2002, Lecture Notes in Computer Science, Vol.2501, Springer-Verlag, 2002, pp.533-547.
20. F. Zhang, K. Kim, Efficient ID-based blind signature and proxy signature from bilinear pairings, In: Proc. of ACISP2003 (The 8th Australasian Conference on Information Security and Privacy), Lecture Notes in Computer Science, Vol. 2727, Springer-Verlag, 2003, pp.312-3323.