Efficient identity based signature schemes based on pairings

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

Volumn 2595, Issue , 2003, Pages 310-324

  Hess, Florian ^a  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Identity based signatures; Key escrow; Tate pairing; Weil pairing

Indexed keywords

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; NETWORK SECURITY; PUBLIC KEY CRYPTOGRAPHY;

DIFFIE-HELLMAN PROBLEM; IDENTITY BASED SIGNATURE; IDENTITY-BASED SIGNATURE SCHEME; KEY ESCROW; PUBLIC-KEY SIGNATURES; SUPERSINGULAR ELLIPTIC CURVE; TATE PAIRING; WEIL PAIRING;

AUTHENTICATION;

EID: 35248867510     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36492-7_20     Document Type: Article

References (19)

1. S. Blackburn, S. Blake-Wilson, M. Burmester and S. D. Galbraith. Shared Generation of Shared RSA Keys. University of Waterloo technical report, CORR 98-19 (1998).
2. D. Boneh and M. Franklin. Efficient Generation of Shared RSA Keys. In Advances in Cryptology - CRYPTO '97, Springer-Verlag LNCS 1294, 425-439, 1997.
3. D. Boneh and M. Franklin. Identity-based encryption from the Weil pairing. In Advances in Cryptology - CRYPTO 2001, Springer-Verlag LNCS 2139, 213-229, 2001.
4. D. Boneh, B. Lynn and H. Shacham. Short signatures from the Weil pairing. In Advances in Cryptology - ASIACRYPT 2001, Springer-Verlag LNCS 2248, 514-532, 2001.
5. J. Cha and J. Cheon. An Identity-Based Signature from Gap Diffie-Hellman Groups IACR preprint server, submission 2002/018, 2002.
6. C. Cocks. Split knowledge generation of RSA parameters. In Cryptography and Coding, Springer-Verlag LNCS 1355, 89-95, 1997.
7. C. Cocks. An identity based encryption scheme based on quadratic residues. In Cryptography and Coding, Springer-Verlag LNCS 2260, 360-363. 2001.
8. S. D. Galbraith. Supersingular curves in cryptography. In Advances in Cryptology - ASIACRYPT 2001, Springer-Verlag LNCS 2248, 495-513, 2001.
9. A. Joux. A one round protocol for tripartite Diffie-Hellman. In Algorithmic Number Theory Symposium, ANTS-IV, Springer-Verlag LNCS 1838, 385-394, 2000.
10. A. J. Menezes, T. Okamoto and S. Vanstone. Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Trans. Info. Th., 39, 1639-1646, 1993.
11. A. J. Menezes, P. C. Oorschot and S. Vanstone. Handbook of Applied Cryptography. CRC Press, 1996.
12. V. Miller. Short programs for functions on curves. Unpublished manuscript, 1986.
13. K. Nyberg and R. A. Rueppel. Message recovery for signature schemes based on the discrete logarithm problem. Designs, Codes and Cryptography, 7(1/2), 61-81, 1996.
14. K. G. Paterson. ID-based signatures from pairings on elliptic curves IACR preprint server, submission 2002/003, 2002.
15. D. Pointcheval and J. Stern. Security arguments for digital signatures and blind signatures. Journal of Cryptology, 13, 361-396, 2000.
16. K. Rubin and A. Silverberg. The best and worst of supersingular abelian varieties in cryptology. IACR preprint server, submission 2002/006, 2002.
17. R. Sakai, K. Ohgishi and M. Kasahara. Cryptosystems based on pairing. In SCIS 2000, 2000.
18. A. Shamir. Identity-based cryptosystems and signature schemes. In Advances in Cryptology - CRYPTO '84, Springer-Verlag LNCS 196, 47-53, 1984.
19. J. H. Silverman. The Arithmetic of Elliptic Curves. GTM 106, Springer-Verlag, 1986.