环签名的分析与改进

发布时间：2018-01-04 16:13

本文关键词：环签名的分析与改进　出处：《昆明理工大学》2015年硕士论文　论文类型：学位论文

【摘要】：随着计算机技术的不断进步和通信技术的飞速发展,我们已经步入一个全新的互联网信息时代,随着人们对互联网的依赖程度的加深,信息安全问题也开始日益显现出来,面对网上银行、电子政务、电子商务等网络新兴产物,如何建立行之有效的防护措施以适应信息时代的发展便显得尤为重要。数字签名技术作为信息安全技术的重要组成部分能有效解决身份认证、数据完整性、不可否认性等问题而成为目前信息安全领域的研究热点。环签名作为一种简化的类群签名,相比群签名而言,没有群的建立过程即无需和群成员进行相互认证,没有群管理人员(GM)即环内各成员地位平等,所以环签名可以实现自发性和无条件匿名性,因此环签名技术在匿名电子选举、电子政务、电子货币系统、密钥分配以及多方安全计算中均有广泛的使用前景。本文所做的主要工作和取得的结论包括：(1)阐述了环签名中涉及到的各种基础理论知识,对基于无证书密码体制的环签名方案进行了形式化定义并给出了安全模型。(2)通过对现有的环签名方案进行分析发现,不管是基于身份密码体制的还是无证书密码体制的方案均存在双线对运算较多的问题,为此我们通过减少双线对的数量和指数运算的数量提出一个在签名阶段既没有双线对运算也没有指数运算,而在验证阶段只有两个双线对验证的高效环签名方案,并在随机预言机模型下利用可证明安全理论进行了安全性证明。(3)分析了Luo方案的安全缺陷,指出其提出的可验证环签名方案不能抵抗环成员内部的伪造问题,我们通过在Luo方案中嵌入一个无证书短签名算法,成功的解决了环成员可以任意伪造真实签名者自证身份的问题。(4)分析了Huang等人的可追踪环签名方案,发现Huang方案的一些缺陷,针对Huang方案的缺陷,并结合可验证环签名算法,提出一种新的匿名可控无证书环签名方案,新方案同时具有可验证性和可追踪性。(5)针对环签名存在签名长度依赖于环成员大小的问题,在吸收借鉴Wang等人利用累加器而实现环签名长度定长的思想下,构造了一个效率更高、签名长度更短的环签名方案,并在q-SDH难题下证明了其具有不可伪造性。
[Abstract]:With the continuous progress of computer technology and the rapid development of communication technology, we have entered a new era of Internet information, with the deepening of people's dependence on the Internet. Information security issues are also beginning to emerge, facing online banking, e-government, e-commerce and other network emerging products. How to establish effective protective measures to adapt to the development of the information age is particularly important. As an important part of information security technology, digital signature technology can effectively solve the identity authentication, data integrity. As a kind of simplified class group signature, there is no need to authenticate group members in the process of group building. No group manager (GM) is equal in the membership of the ring, so ring signature can achieve spontaneity and unconditional anonymity, so ring signature technology in anonymous electronic election, e-government, e-money system. Key distribution and multi-party security computing are widely used in the future. The main work and conclusions of this paper include: 1) the basic theoretical knowledge involved in ring signature is expounded. The ring signature scheme based on certificate-free cryptosystem is formalized and the security model. Whether it is based on identity cryptosystem or no certificate cryptosystem, there are many problems of two-line pair operation. For this reason, we propose a double line pair operation and no exponential operation in the signature stage by reducing the number of double line pairs and exponential operations. In the verification phase, there are only two pairs of two-wire pairs to verify the efficient ring signature scheme, and under the stochastic prophecy model, the security proof of the Luo scheme is analyzed by using the provable security theory. It is pointed out that the verifiable ring signature scheme can not resist the problem of forgery within the ring members. We embed a certificate free short signature algorithm in the Luo scheme. Successfully solve the problem that the ring members can arbitrarily forge the identity of the true signer. (4) the traceable ring signature scheme of Huang et al is analyzed and some defects of the Huang scheme are found. Aiming at the defects of Huang scheme and combining with verifiable ring signature algorithm, a new anonymous controllable certificate free ring signature scheme is proposed. The new scheme has both verifiability and traceability. 5) for ring signature, the length of signature is dependent on the size of ring member. A ring signature scheme with higher efficiency and shorter signature length is constructed under the idea of using Wang and others to realize the fixed length of ring signature using accumulator. It is proved that it is unforgeable under the q-SDH problem.
【学位授予单位】：昆明理工大学
【学位级别】：硕士
【学位授予年份】：2015
【分类号】：TN918.91

【参考文献】