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.