New nonrepudiable threshold proxy signature scheme with known signers

New nonrepudiable threshold proxy signature scheme with known signers
复制标题

DOI:
10.1016/s0164-1212(01)00032-2
复制
发表时间:
2001-09-01
影响因子:
3.5
通讯作者:
Wu, TC
Wu, TC
中科院分区:
计算机科学2区
文献类型:
--
作者:
Hsu, CL;Wu, TS;Wu, TC

文献摘要

被引文献

相似文献

基于 Kim 等人的门限代理签名方案。 Sun提出了一种具有已知签名者的不可否认的阈值代理签名方案。在Sun的方案中,实际的代理签名者不能否认他们所签署的签名。然而,他的计划很容易受到阴谋攻击。任何恶意代理签名者都可以串通派生其他代理签名者的密钥并冒充其他代理签名者生成代理签名。在本文中,我们提出了一种新的不可否认的门限代理签名方案来克服上述弱点。此外,所提出的方案在计算复杂性和通信成本方面比 Sun 的方案更有效。 (C) 2001 Elsevier Science Inc. 保留所有权利。
Based on Kim et al.'s threshold proxy signature scheme. Sun proposed an nonrepudiable threshold proxy signature scheme with known signers. In Sun's scheme, actual proxy signers cannot deny the signatures they have signed. However, his scheme is vulnerable against the conspiracy attack. Any t malicious proxy signers can collusively derive the secret keys of other proxy signers and impersonate some other proxy signers to generate proxy signatures. In this paper, we proposed a new nonrepudiable threshold proxy signature scheme that overcomes the above weakness. Furthermore, the proposed scheme is more efficient than Sun's in terms of computational complexities and communication costs. (C) 2001 Elsevier Science Inc. All rights reserved.