摘要
对已有无证书代理签名方案进行研究发现,基于离散对数知识构造的无证书代理签名方案几乎没有,结合有限域上的离散对数知识和无证书密码体制的优点,提出了一种高效的、基于离散对数的无证书代理签名方案。该方案避免了基于身份密码体制中的密钥托管问题和证书密码体制中的证书存在问题,满足代理签名的不可伪造性、代理密钥的依赖性、代理签名的可区分性和抗滥用性等良好性质。整个方案没有使用双线性对操作,在有限域上离散对数问题难解的条件下证明和讨论了方案的正确性和安全性。
By studying the existing proxy signatures, found that there are few such schemes based on discrete logarithm. Taking theadvantage of discrete logarithm on the finite filed and certificateless cryptosystem, we propose an efficient certificateless proxy signature scheme based on DLP is proposed, which not only satisfies all the required characteristic of the proxy signature such as the unforgeability, the dependence of secret key, the distinguishability and abuseness of proxy signature etc, but removes the key-escrow in ID-based cryptosystem and certificate in PKI-based cryptosystem. The entire scheme is proved to be correct and security under the hardness of discrete logarithm problem in the finite field.
出处
《计算机工程与设计》
CSCD
北大核心
2011年第10期3284-3286,3300,共4页
Computer Engineering and Design
基金
教育部科学技术研究重点基金项目(208148)
安徽省教育厅自然科学一般基金项目(KJ2010B059)