New nonrepudiable threshold proxy signature scheme with known signers
Journal of Systems and Software
ICICS '97 Proceedings of the First International Conference on Information and Communication Security
A Practical (t, n) Threshold Proxy Signature Scheme Based on the RSA Cryptosystem
IEEE Transactions on Knowledge and Data Engineering
Comments on "A Practical (t,n) Threshold Proxy Signature Scheme Based on the RSA Cryptosystem'
IEEE Transactions on Knowledge and Data Engineering
On the efficiency of nonrepudiable threshold proxy signature scheme with known signers
Journal of Systems and Software
Security proofs for signature schemes
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
An analysis of proxy signatures: is a secure channel necessary?
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
A new proxy signature scheme for a specified group of verifiers
Information Sciences: an International Journal
| Hi-index | 0.01 |
Since the first (t,n) threshold proxy signature scheme was proposed, the threshold proxy signature has enjoyed a considerable amount of interest from the cryptographic research community. In 2001, Hsu et al. proposed a non-repudiable threshold proxy signature scheme with known signer, but the efficiency is rather low and a system authority (SA) is also required in this scheme. Recently, to overcome these shortcomings, Yang et al. proposed an improvement of Hsu et al.'s scheme that is very efficient and without employing a SA. However, in this paper, we shows that Yang et al.'s scheme is not secure against the warrant attack. That is, the adversary can replace the warrant of the proxy signature. To resist this attack, based on Yang et al.'s scheme, we propose a new and more efficient scheme without a secure channel.