On the efficiency of nonrepudiable threshold proxy signature scheme with known signers

  • Authors:
  • Cheng-Ying Yang;Shiang-Feng Tzeng;Min-Shiang Hwang

  • Affiliations:
  • Graduate Institute of Networking and Communication Engineering, Chaoyang University of Technology, 168 Gifeng E. Rd., Wufeng, Taichung County 413, Taiwan, ROC;Department of Computer Science and Information Engineering, National Central University, No. 300, Jung-da Rd., Jung-li City, Taoyuan, Taiwan 320, ROC;Department of Management Information Systems, National Chung Hsing University, 250 Kuo Kuang Road, Taichung, Taiwan 402, ROC

  • Venue:
  • Journal of Systems and Software
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the (t,n) proxy signature scheme, the signature signed by the original signer can be signed by t or more proxy signers out of a proxy group of n proxy signers. Recently, Hsu et al. proposed a nonrepudiable threshold proxy signature scheme with known signers. In this article, we shall propose an improvement of Hsu et al.'s scheme that is more efficient in terms of computational complexity and communication cost.