本文關鍵詞：環(huán)簽名的分析與改進　出處：《昆明理工大學》2015年碩士論文　論文類型：學位論文

  更多相關文章： 無證書密碼體制 環(huán)簽名 匿名性撤銷 簽名長度 雙線性對

【摘要】：隨著計算機技術的不斷進步和通信技術的飛速發(fā)展,我們已經(jīng)步入一個全新的互聯(lián)網(wǎng)信息時代,隨著人們對互聯(lián)網(wǎng)的依賴程度的加深,信息安全問題也開始日益顯現(xiàn)出來,面對網(wǎng)上銀行、電子政務、電子商務等網(wǎng)絡新興產(chǎn)物,如何建立行之有效的防護措施以適應信息時代的發(fā)展便顯得尤為重要。數(shù)字簽名技術作為信息安全技術的重要組成部分能有效解決身份認證、數(shù)據(jù)完整性、不可否認性等問題而成為目前信息安全領域的研究熱點。環(huán)簽名作為一種簡化的類群簽名,相比群簽名而言,沒有群的建立過程即無需和群成員進行相互認證,沒有群管理人員(GM)即環(huán)內(nèi)各成員地位平等,所以環(huán)簽名可以實現(xiàn)自發(fā)性和無條件匿名性,因此環(huán)簽名技術在匿名電子選舉、電子政務、電子貨幣系統(tǒng)、密鑰分配以及多方安全計算中均有廣泛的使用前景。本文所做的主要工作和取得的結論包括：(1)闡述了環(huán)簽名中涉及到的各種基礎理論知識,對基于無證書密碼體制的環(huán)簽名方案進行了形式化定義并給出了安全模型。(2)通過對現(xiàn)有的環(huán)簽名方案進行分析發(fā)現(xiàn),不管是基于身份密碼體制的還是無證書密碼體制的方案均存在雙線對運算較多的問題,為此我們通過減少雙線對的數(shù)量和指數(shù)運算的數(shù)量提出一個在簽名階段既沒有雙線對運算也沒有指數(shù)運算,而在驗證階段只有兩個雙線對驗證的高效環(huán)簽名方案,并在隨機預言機模型下利用可證明安全理論進行了安全性證明。(3)分析了Luo方案的安全缺陷,指出其提出的可驗證環(huán)簽名方案不能抵抗環(huán)成員內(nèi)部的偽造問題,我們通過在Luo方案中嵌入一個無證書短簽名算法,成功的解決了環(huán)成員可以任意偽造真實簽名者自證身份的問題。(4)分析了Huang等人的可追蹤環(huán)簽名方案,發(fā)現(xiàn)Huang方案的一些缺陷,針對Huang方案的缺陷,并結合可驗證環(huán)簽名算法,提出一種新的匿名可控無證書環(huán)簽名方案,新方案同時具有可驗證性和可追蹤性。(5)針對環(huán)簽名存在簽名長度依賴于環(huán)成員大小的問題,在吸收借鑒Wang等人利用累加器而實現(xiàn)環(huán)簽名長度定長的思想下,構造了一個效率更高、簽名長度更短的環(huán)簽名方案,并在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

【參考文獻】

相關期刊論文 前6條

1 黃欣沂;張福泰;伍瑋;;一種基于身份的環(huán)簽密方案[J];電子學報;2006年02期

2 紀家慧,李大興;新的基于身份的多簽名體制[J];計算機工程與應用;2004年27期

3 王麗莎;張建中;;一種高效安全的無證書數(shù)字簽名方案[J];計算機工程與應用;2012年15期

4 羅大文;何明星;李哠;;無證書的可驗證環(huán)簽名方案[J];計算機工程;2009年15期

5 張春生;蘇本躍;姚紹文;;無雙線性對的無證書分布環(huán)簽名方案[J];計算機工程;2013年12期

6 甘志,陳克非;一個新的可驗證環(huán)簽名方案(英文)[J];中山大學學報(自然科學版);2004年S2期

，

本文編號：1379129