两类强壮的门限密钥托管方案-软件学报.pdfVIP

1000-9825/2003/14(06)1164 ©2003 Journal of Software 软 件 学 报 Vol.14, No.6 ∗ 两类强壮的门限密钥托管方案 曹珍富+ (上海交通大学 计算机科学与技术系,上海 200030) Two Classes of Robust Threshold Key Escrow Schemes CAO Zhen-Fu+ (Department of Computer Science and Technology, Shanghai Jiaotong University, Shanghai 200030, China) + Corresponding author: Phn: 86-21 Fax: 86-21 E-mail: zfcao@ Received 2002-05-13; Accepted 2002-08-14 Cao ZF. Two classes of robust threshold key escrow schemes. Journal of Software, 2003,14(6):1164~1171. /1000-9825/14/1164.htm Abstract: The definition of robust threshold key escrow scheme (RTKES) is proposed in this paper. Namely, in RTKES, malice escrow agency fail to obtain the system secret key or user ’s secret key, even if the number of malice escrow agency is more than or equal to the value of threshold. Clearly, the problem of “user ’s secret key completely depends on the trusted escrow agency” is solved if RTKES exists. In this paper, it is proved that the RTKES does exist, and some concrete designs of two classes of RTKES are given. In these schemes, the problem of “once monitor, monitor for ever” is solved effectively, every escrow agency can verify correctness of the secret shadow that he escrows during secret shadow distribution and monitor agency can exactly decide which escrow agency forges or tampers secret shadow during monitor procedure. Since the proposed RTKES is also threshold key escrow scheme, when an escrow agency or few agencies is not cooperating, monitor agency can easily reconstruct session key to monitor as long as there are other k effective escrow agencies. In addition, it also resists against LEAF feedback attack. Key w