A proposal of short proxy signature using pairing

International Conference on Information Technology: Coding and Computing, ITCC

Volumn 1, Issue , 2005, Pages 631-635

  Okamoto, Takeshi ^a   Inomata, Atsuo ^b   Okamoto, Eiji ^a  

^a UNIVERSITY OF TSUKUBA   (Japan)

^b JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

Bilinear pairing; Elliptic curve cryptosystem; General hash function; Proxy signature; Short signature

Indexed keywords

INFORMATION TECHNOLOGY; PROBLEM SOLVING;

HASH FUNCTION; PROXY SIGNATURES; SHORT SIGNATURES;

CRYPTOGRAPHY;

EID: 24744449733     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/itcc.2005.27     Document Type: Conference Paper

References (21)

1. D. Boneh and M. Franklin, "Identity-based encryption from the Weil pairing,"CRYPTO 2001, LNCS 2139, pp. 213-229, 2001.
2. D. Boneh, C. Gentry, B. Lynn, and H. Shacham, "Aggregate and verifiably encrypted signatures from bilinear maps,"EUROCRYPT 2003, LNCS 2656, pp., 2003.
3. P. Barreto, H. Kim, B. Lynn, and M. Scott, "Efficient Algorithms for Pairing-Based Cryptosystems,"CRYPTO 2002, LNCS 2442, pp.354-368, 2002.
4. D. Boneh, B. Lynn, and H. Shacham, "Short signatures from the Weil pairing,"ASIACRYPT 2001, LNCS 2248, pp.514-532, 2001.
5. G. Frey and H.-G. Ruck, "A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves,"Math. Comp., 62, No.206 (1994) pp.865-874, 1994.
6. S. Galbraith, K. Harrison and D. Soldera, "Implementing the Tate Pairing,"Algorithm Number Theory Symposium - ANTS V, LNCS 2369, pp. 324-337, 2002.
7. F. Hess, "Efficient identity based signature schemes based on pairings,"SAC 2002, LNCS 2595, pp.310-324, 2002.
8. T. Izu and T. Takagi, "Efficient Computations of the Tate Pairingfor the Large MOV Degrees,"ICISC 2002, LNCS 2587, pp.283-297, 2002.
9. S. Kim, S. Park, and D. Won, "Proxy signatures, revisited, "ICICS 97, LNCS 1334, pp. 223-232, 1997.
10. B. Lee, H. Kim and K. Kim, "Secure mobile agent using strong non-designated proxy signature,"ACISP2001, LNCS 2119, pp.474-486, Springer Verlag, 2001.
11. S. Mambo, R. Usuda and M. Okamoto, "Proxy signature: Delegation of the power to sign messages,"IEICE Trans. Vol.E79-A, No.9, pp.1338-1353, 1996.
12. A. J. Menezes, T. Okamoto and S. A. Vanstone, "Reducing elliptic curve logarithms to logarithms in a finite field,"IEEE Trans. Inf. Theory, 39, No. 5 (1993) pp.1639-1646, 1993.
13. S. Mitsunari, R. Sakai and M. Kasahara, "A new traitor tracing,"IEICE Trans. Vol.E85-A, No.2, pp.481-484, 2002.
14. National Institute of Standards and Technology (NIST), Secure hash standard(SHS). In Federal Information Processing Standards, April 1995.
15. T. Okamoto, M. Tada and E. Okamoto, "Extended proxy signatures for smart cards,"ISWf99, LNCS 1729, pp. 247-258, 1999.
16. R.L. Rivest. RFC 1321: The MD5 Message-Digest Algorithm, Internet Activities Board, April 1992.
17. K. Sakurai and H. Shizuya, "A structural comparizon of the computational difficulty of breaking discrete log cryptosystems,"Journal of Cryptology, vol. 11-1, pp. 247-258, 1998.
18. X. Wang, D. Feng, X. Lai and H. Yu, "Collisions for Hash Functions MD4, MD5, HAVAL-128 and RIPEMD,"Cryptology ePrint Archive, Report 2004/199, available at http://eprint.iacr.org/2004/199/.
19. F. Zhang and K. Kim, "Efficient ID-Based Blind Signature and Proxy Signature from Bilinear Pairing,"ACISP 2003, LNCS 2727, pp.312-323, 2003.
20. F. Zhang and K. Kim, "Efficient ID-Based Blind Signature and Proxy Signature from Bilinear Pairing,"ACISP 2003, LNCS 2727, pp.312-323, 2003.
21. F. Zhang, R. Safavi-Naini and W. Susilo, "An Efficient Signature Scheme from Bilinear Parings and Its Applications,"PKC 2004, LNCS 2947, pp.277-290, 2004.