本文選題：環(huán)簽名 + 關(guān)聯(lián)環(huán)簽名　； 參考：《西南交通大學(xué)》2015年碩士論文

【摘要】：隨著網(wǎng)絡(luò)技術(shù)的迅速發(fā)展及人類生活的不斷信息化,數(shù)字簽名作為信息安全領(lǐng)域的重要認(rèn)證技術(shù),得到了廣泛的應(yīng)用。然而普通數(shù)字簽名并非總能適用于不同的應(yīng)用環(huán)境,因此具有特殊性質(zhì)的數(shù)字簽名,如門限簽名、群簽名、盲簽名、環(huán)簽名、代理簽名等應(yīng)運(yùn)而生。環(huán)簽名自提出后便引起了學(xué)者們的廣泛關(guān)注,并且具有不同特性的環(huán)簽名也陸續(xù)被提出,如門限環(huán)簽名、關(guān)聯(lián)環(huán)簽名、可撤銷匿名性的環(huán)簽名和可否認(rèn)環(huán)簽名等。同時(shí),這些具有特殊性質(zhì)的環(huán)簽名也被不斷應(yīng)用于不同的網(wǎng)絡(luò)環(huán)境中。本文重點(diǎn)對(duì)關(guān)聯(lián)環(huán)簽名及其在電子投票系統(tǒng)中的應(yīng)用進(jìn)行了研究,主要內(nèi)容包括：(1)對(duì)數(shù)字簽名的基礎(chǔ)理論及相關(guān)工具進(jìn)行了介紹。首先,介紹了數(shù)字簽名中常用的歐拉公式、中國剩余定理以及困難性問題等數(shù)基礎(chǔ)數(shù)學(xué)知識(shí)。然后,對(duì)秘密共享技術(shù)、數(shù)字簽名基本概念及可證明安全理論進(jìn)行了論述。最后,對(duì)環(huán)簽名的一般原理進(jìn)行了說明。(2)針對(duì)現(xiàn)有關(guān)聯(lián)環(huán)簽名均建立在離散對(duì)數(shù)公鑰密碼體制基礎(chǔ)上,且絕大部分方案僅具備弱匿名性和強(qiáng)關(guān)聯(lián)性特點(diǎn),提出了一個(gè)基于RSA公鑰密碼體制的可選擇關(guān)聯(lián)可轉(zhuǎn)換環(huán)簽名方案。簽名者不僅能自行選擇是否關(guān)聯(lián)其簽署的不同簽名；并且在必要場合,還能撤銷簽名的匿名性,將環(huán)簽名轉(zhuǎn)換為普通的數(shù)字簽名。最后,在隨機(jī)預(yù)言機(jī)模型下證明方案是在適應(yīng)性選擇消息和選擇公鑰攻擊下是存在性不可偽造的。(3)在提出的基于RSA公鑰密碼體制的可選擇關(guān)聯(lián)可轉(zhuǎn)換環(huán)簽名基礎(chǔ)上,添加了門限特性,設(shè)計(jì)出一個(gè)新的基于RSA的可選擇關(guān)聯(lián)可轉(zhuǎn)換門限環(huán)簽名方案。方案不僅能夠?qū)崿F(xiàn)一個(gè)普通門限環(huán)簽名的功能,而且具備可選擇關(guān)聯(lián)性和匿名可轉(zhuǎn)換性。最后,在隨機(jī)預(yù)言機(jī)模型下證明方案是在適應(yīng)性選擇消息和選擇公鑰攻擊下是存在性不可偽造的。(4)深入分析現(xiàn)有電子投票方案存在的缺陷和不足后,在無需可信中心和匿名通信信道的前提下,利用關(guān)聯(lián)環(huán)簽名和盲簽名機(jī)制設(shè)計(jì)了一個(gè)安全高效的電子投票協(xié)議。方案采用身份序列碼解決了選票碰撞問題,并通過引入信息公開驗(yàn)證機(jī)制,解決了投票者在任意階段中途棄權(quán)的問題。不僅如此,方案將計(jì)算量較大的關(guān)聯(lián)環(huán)簽名運(yùn)用于注冊階段,使實(shí)際投票效率得到有效提高,適合于大規(guī)模選舉。
[Abstract]:With the rapid development of network technology and the continuous informatization of human life, digital signature, as an important authentication technology in the field of information security, has been widely used. However, ordinary digital signatures are not always suitable for different application environments, so digital signatures with special properties, such as threshold signature, group signature, blind signature, ring signature, proxy signature and so on, emerge as the times require. Since the ring signature was put forward, the scholars have paid much attention to it, and the ring signature with different characteristics has been proposed one after another, such as threshold ring signature, correlation ring signature, annular signature with revocable anonymity and repudiable ring signature, and so on. At the same time, these special ring signatures have been used in different network environments. This paper focuses on the research of correlation ring signature and its application in electronic voting system, including the introduction of the basic theory and related tools of digital signature. Firstly, the basic mathematical knowledge of Euler's formula, Chinese residue theorem and the problem of difficulty in digital signature are introduced. Then, the secret sharing technology, the basic concept of digital signature and provable security theory are discussed. Finally, the general principle of ring signature is explained. (2) the existing correlation ring signature is based on the discrete logarithmic public key cryptosystem, and most of the schemes only have the characteristics of weak anonymity and strong correlation. In this paper, an alternative associative convertible ring signature scheme based on RSA public key cryptosystem is proposed. The signer can not only choose whether or not to associate different signatures, but also can cancel the anonymity of the signature if necessary and convert the ring signature into a common digital signature. Finally, under the stochastic oracle model, it is proved that the scheme is existential and unforgeable under adaptive selection messages and selective public key attacks. The scheme is based on the RSA public-key cryptosystem based selectable associative convertible ring signature. By adding threshold characteristic, a new optional associative convertible threshold ring signature scheme based on RSA is designed. The scheme can not only realize the function of a general threshold ring signature, but also have optional correlation and anonymous transferability. Finally, in the random oracle model, it is proved that the scheme is an unforgeable existence under adaptive selection message and public key attack.) after analyzing the defects and shortcomings of the existing electronic voting schemes, Without trusted center and anonymous communication channel, a secure and efficient electronic voting protocol is designed by using association ring signature and blind signature mechanism. Identity sequence code is used to solve the problem of vote collision, and information disclosure verification mechanism is introduced to solve the problem of voter waiving in any stage. Moreover, the scheme applies the associated ring signature, which has a large amount of computation, to the registration stage, so that the actual voting efficiency is improved effectively, and it is suitable for large-scale elections.
【學(xué)位授予單位】：西南交通大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類號(hào)】：TN918.91

【參考文獻(xiàn)】

相關(guān)期刊論文 前3條

1 高虎明,王繼林,王育民;一個(gè)基于Mix net的電子投票方案[J];電子學(xué)報(bào);2004年06期

2 王少輝;鄭世慧;展?jié)?;基于身份的可鏈接和可轉(zhuǎn)換環(huán)簽名[J];電子與信息學(xué)報(bào);2008年04期

3 王化群;郭顯久;于紅;彭玉旭;;幾種可轉(zhuǎn)換環(huán)簽名方案的安全性分析和改進(jìn)[J];電子與信息學(xué)報(bào);2009年07期

，

本文編號(hào)：1940031