Proxy signatures for delegating signing operation
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
On Zhang's Nonrepudiable Proxy Signature Schemes
ACISP '98 Proceedings of the Third Australasian Conference on Information Security and Privacy
Secure Mobile Agent Using Strong Non-designated Proxy Signature
ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
ICICS '97 Proceedings of the First International Conference on Information and Communication Security
A Digital Nominative Proxy Signature Scheme for Mobile Communication
ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
Extended Proxy Signatures for Smart Cards
ISW '99 Proceedings of the Second International Workshop on Information Security
A Practical (t, n) Threshold Proxy Signature Scheme Based on the RSA Cryptosystem
IEEE Transactions on Knowledge and Data Engineering
A nonrepudiable threshold multi-proxy multi-signature scheme with shared verification
Future Generation Computer Systems - Special issue: Computational chemistry and molecular dynamics
On the efficiency of nonrepudiable threshold proxy signature scheme with known signers
Journal of Systems and Software
An efficient nonrepudiable threshold proxy signature scheme with known signers
Computer Communications
An efficient anonymous proxy signature scheme with provable security
Computer Standards & Interfaces
A novel anonymous proxy signature scheme
Advances in Multimedia
| Hi-index | 0.00 |
A (t, n) threshold proxy signature scheme allows any t or more proxy signers to cooperatively sign messages on behalf of an original signer, but t-1 or fewer proxy signers cannot. In a recent work [C.H. Yang, S.F. Tzeng, M.S. Hwang, On the efficiency of nonrepudiable threshold proxy signature scheme with known signers, Systems and Software 73(3) (2004) 507-514], C.H. Yang, S.F. Tzeng and M.S. Hwang proposed a new threshold proxy signature scheme (called as YTH scheme), which is more efficient in algorithm and communication than Hsu et al.'s scheme proposed in 2001. However, YTH scheme still has some security weaknesses. In this paper, we show that YTH scheme cannot resist frame attack and public-key substitute attack. A new improvement with high safety and efficiency is proposed. The new scheme remedies the weaknesses of YTH scheme, especially, it can resist public-key substitute attack successfully by Zero-Knowledge Proof. Furthermore, the system doesn't need a security channel and computational complexity can be lowered.