基于RSA的門限密鑰托管方案
A THRESHOLD KEY ESCROW SYSTEM BASED ON RSA
-
摘要: 本文借鑒D.Boneh(1997)中密鑰產(chǎn)生和Y.Desmedt(1991)中的密鑰分拆思想,提出了一種有t個容錯能力的(t+1,n)門限托管方案,方案可以避免閾下攻擊,驗證用戶的托管密鑰正確性,有效地檢查出失效的托管代理,并具有密鑰備份的能力。方案可用于多種通信方式。
-
關(guān)鍵詞:
- 門限方案; 密鑰托管; 密鑰產(chǎn)生; 密鑰分拆; 密鑰備份; 容錯
Abstract: This paper presents a (t + 1,n)-threshold key escrow system with tolerance of t failure or withholding escrow agents on the basis of key generating of Ref.[1] and key spitting of Ref.[2], which can prevent from subliminal key attack, verify the pieces of the user s private key, effectively discover the failure or corrupted escrow agents and backup key for users. This scheme can used to real-time communication encryption and file encryption. -
Denning D E. Description of Key Escrow System. Version of May, 1996.[2]Micali S. Fair pubic-key cryptosystem. Proceedings of Crypto'92, 1992, 209-221.[3]Kilian J.[J].Leighton T. Fair cryptosystem, revisited. Proc. of Crypto9.1995,:-[4]Ganesan R. The Yaksha security system. Communication of ACM, 1996, 39(3): 55-60.[5]Boneh D.[J].Franklin M. Efficient generation of shared RAS key. Proc. of Crypto97, Springer-Verlag.1997,:-[6]Goldwasser S, Micali S, Rockoff C. The knowledge complexity of interactive proof system. Proc. of the 17th ACM Symposium on Theory of Computing, 1985, 291-304. -
計量
- 文章訪問數(shù): 2094
- HTML全文瀏覽量: 141
- PDF下載量: 438
- 被引次數(shù): 0
下載:
