A VERIFIABLE PROXY SIGNATURE SCHEME BASED ON BILINEAR PAIRINGS WITH IDENTITY-BASED CRYPTOGRAPHIC APPROACHES

Authors

  • Ya Fen Chang Department of Computer Science and Information Engineering, National Taichung Institute of Technology, Taichung
  • Wei Liang Tai Department of Biomedical Informatics, Asia University, Taichung
  • Chung Yi Lin Department of Computer Science and Information Engineering, National Taichung Institute of Technology, Taichung

DOI:

https://doi.org/10.5755/j01.itc.41.1.830

Keywords:

identity-based cryptosystem, proxy signature, privacy

Abstract

Hu and Huang proposed an identity-based proxy signature scheme with bilinear pairings. By this approach, the extra burden of verifying a public key with a certificate can be eliminated, and the length of a digital signature can be 160 bits only. Later, Park et al. pointed out that Hu and Huang’s scheme suffers from one serious problem, privacy problem, such that a proxy key is generated by using a designated proxy signer’s private key without his agreement. To solve this problem, Park et al. also proposed an improvement. With deep insight into Park et al.’s improvement, two drawbacks are found. First, a designated proxy signer may be fooled. Second, the verification of the proxy key in Park et al.’s scheme will never succeed. To preserve advantages and overcome drawbacks, an enhancement will be proposed in this paper.

DOI: http://dx.doi.org/10.5755/j01.itc.41.1.830

Downloads

Published

2012-04-09

Issue

Vol. 41 No. 1 (2012)

Section

Articles

License

Copyright terms are indicated in the Republic of Lithuania Law on Copyright and Related Rights, Articles 4-37.