检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:辛利[1]
机构地区:[1]盐城师范学院信息科学与技术学院,江苏盐城224002
出 处:《计算机仿真》2009年第12期115-117,共3页Computer Simulation
摘 要:CA是PKI中的关键设施,负责签发用于鉴别用户身份的数字证书。CA的可信任性依赖于CA的私钥。CA的私钥一旦泄露,其签发的所有证书就只能全部作废。因此,保护CA私钥的安全是整个PKI安全的核心。基于椭圆曲线ECC算法和(t,n)门限密码技术,结合主动秘密共享方法,提出了一种容侵的CA私钥保护方案。方案确保私钥在任何时候都无需重构。同时,在私钥产生、分发及使用过程中,即使部分系统部件受到攻击,也不会泄漏,保护了CA私钥的安全性,从而保证了在线CA所签发数字证书的有效性。并通过Java和Openssl对系统进行了实现。CA is the key infrastructure to the PKI. It signs digital signature which is used to identify the user. Its reliability relies on its private key. Once its private key is revealed, all the certificates signed by the CA must be cancelled. Protecting the CA private key is the key issue of the whole CA. An intrusion tolerant protection scheme of CA private key was proposed based on the ECC and (t,n) secret shared method and proactive secret share. The scheme ensures that the private key will never be reunited at any time. At the same time, in the proceeding of CA generated, delivered and used, even if some part of the CA is broken, the CA private key is still safe. Thus, it ensures the validity of the digital certificate delivered by the online CA. At last, the system was realized by Java and Openssl.
关 键 词:私钥 椭圆曲线算法 容侵 门限密码学 主动秘密共享
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.205