无双线性对的无证书安全签密方案

发布时间：2018-01-12 00:28

本文关键词：无双线性对的无证书安全签密方案　出处：《计算机应用研究》2014年04期 　论文类型：期刊论文

【摘要】：已有的无双线性对的无证书签密方案,大都存在着机密性漏洞和签名选择性伪造问题。针对此问题,基于有限乘法交换群上的离散对数难题,提出一种无双线性对的无证书签密方案,并进行了安全分析和证明。指出采用随机预言模型的证明方法可能忽略不解决DL难题时对签密方案的攻击,不能证明破解签密方案的难度与解决DL难题相等价。通过对参数的数学分析,证明了破解本签密方案的必要条件是解决DL难题,不存在不解决DL难题攻击本签密方案的多项式时间算法。与已知所有方案相比,所提方案安全性更高。
[Abstract]:Most of the existing unauthenticated bookmark encryption schemes with bilinear pairings have secret vulnerabilities and selective forgery of signatures. In view of this problem the discrete logarithm problem based on finite multiplicative commutative groups is presented. This paper presents an unauthenticated bookmark encryption scheme without bilinear pairings, and gives security analysis and proof. It is pointed out that the proof method using stochastic prophecy model may ignore the attack on signcryption scheme without solving DL problem. It cannot be proved that the difficulty of solving the signcryption scheme is equal to that of solving the DL problem. Through the mathematical analysis of the parameters, it is proved that the necessary condition for solving the signcryption scheme is to solve the DL problem. There is no polynomial time algorithm to attack this signcryption scheme without solving DL problem. Compared with all known schemes, the proposed scheme is more secure.
【作者单位】：海军工程大学信息安全系;
【基金】：国家自然科学基金资助项目(61100042) 中国博士后科学基金资助项目(2012M512132)
【分类号】：TN918.4
【正文快照】： 0引言传统的消息加密和签名方案是采用先签名后加密的方法,该方法计算量大、效率低。1997年,Zheng[1]提出了签密的概念,在一个合理的逻辑步骤内同时完成对数据的加密和签名。2003年,Al-Riyami等人[2]提出了无证书加密体制,该体制中用户的公、私钥由可信中心和用户共同生成,消

【参考文献】