一個(gè)安全的門限代理簽名方案
A Secure Threshold Proxy Signature Scheme
-
摘要: 針對(duì)現(xiàn)有的門限代理簽名方案中所存在的合謀攻擊，提出了一個(gè)安全的門限代理簽名方案。合謀攻擊是指在不知道任何有效的門限代理簽名的情況下, 惡意代理成員人數(shù)大于或等于門限值時(shí), 他們能合謀重新構(gòu)造代理群的秘密多項(xiàng)式函數(shù), 得到代理群的秘密參數(shù), 從而可以偽造其他代理成員的代理簽名。提出的新方案不僅能滿足門限代理簽名的性質(zhì)，而且能抵抗合謀攻擊。另外，該方案能根據(jù)原始簽名人的需要，撤消代理簽名人的代理簽名權(quán)。
-
關(guān)鍵詞:
- 密碼學(xué);數(shù)字簽名;門限代理簽名;合謀攻擊
Abstract: A secure threshold proxy signature scheme is proposed aiming at conspiracy attack, that is, any t (t is threshold value) or more malicious proxy signatures may work together to reconstruct the secret polynomial of the proxy group and derive the secret keys of other members in the proxy group, consequently they can impersonate some other proxy signers to generate a valid threshold proxy signature. The new scheme can not only satisfy the properties of the threshold proxy signature, but also withstand the conspiracy attack. Furthermore, the proxy signers proxy signing capability can be revoked if the original signer needs. -
Kim S, Park S, Won D. Proxy signature, revisited. ICICS97, Lecture Notes in Computer Science, Springer,Berlin,1997, 1334: 223.232.[2]Zhang K. Threshold proxy signature scheme. 1997 Information Security Workshop, Tokyo, Japan, September, 1997: 191.197.[3]Sun H M. An efficient nonrepudiable threshold proxy signature scheme with known signers. Computer Communication.1997, 22 (8):717.722.[4]Hwang M S, Lu J L, Lin L C. A practical (t, n) threshold proxysignature scheme based on the RSA cryptosystem[J].IEEE Trans. on Knowledge and Data Engineering.2003,15(6):1552-[5]Sun, H M Lee, N Y Hwang. T. Threshold proxy signatures[J].IEE Proc- Computers and Digital Techniques.1999, 146(5):259-[6]Hsu C L, Wu T S, Wu T C. New nonrepudiable threshold proxy signature scheme with known signers. Journal of Systems and Software. 2001, 58 (9): 119.124.[7]Lee N Y.[J].Hwang T, Wang C H. On Zhangs nonrepudiable proxy signatures. ACISP98, Lecture Notes in Computer Science, Springer, Berlin.1998,:-[8]Pedersen. Distributed provers with applications to undeniable signatures[J].Proc. Eurocrypt91, Lecture Notes in Computer Science, Sprinter, Berlin.1991, 547:221238- -
計(jì)量
- 文章訪問數(shù): 2432
- HTML全文瀏覽量: 93
- PDF下載量: 679
- 被引次數(shù): 0
下載:
