基于安全多方計算的電子投票與電子拍賣協(xié)議研究
發(fā)布時間：2018-08-24 18:22
【摘要】：買賣與投票是兩種歷史悠久的活動,它們不僅是人們生活中必不可少的一部分,更是企業(yè)運營與管理的關(guān)鍵。而今,隨著計算機水平和網(wǎng)絡(luò)技術(shù)的飛速發(fā)展,互聯(lián)網(wǎng)信息時代悄然來到�；ヂ�(lián)網(wǎng)信息時代賦予買賣和投票新的活動形式,如電子交易、電子拍賣、電子投票等等。先進(jìn)的網(wǎng)絡(luò)技術(shù)在帶給企業(yè)各種便利以及經(jīng)濟利益的同時,龐大的信息量也帶來了各種風(fēng)險和安全隱患。伴隨著人們對于保護(hù)個人隱私的要求與日俱增,如何保障信息的安全成為了當(dāng)今時代的一大主題。安全多方計算的出現(xiàn)為信息爆炸與充滿信息安全隱患的互聯(lián)網(wǎng)信息時代提供了新的安全的保障。安全多方計算使得各參與者在互不信任的網(wǎng)絡(luò)環(huán)境中,無需借助第三方的參與,通過參與者之間的信息交互,以不泄露各自隱私為前提,實現(xiàn)各種函數(shù)計算,從而完成各種新型活動。因此,本文的研究以安全多方計算為基礎(chǔ),致力于電子投票和電子拍賣的研究,并將這兩大研究方向應(yīng)用到具體的企業(yè)管理情境中。具體工作如下:首先,對安全多方計算進(jìn)行詳細(xì)地解釋說明,并對安全多方計算的兩個重要組成部分安全多方求和以及安全多方排序進(jìn)行了分析與總結(jié),還提出了一種新的安全多方排序協(xié)議,該協(xié)議安全有效,且計算復(fù)雜度低,為后文將安全多方計算應(yīng)用于電子投票協(xié)議以及電子拍賣協(xié)議打下了良好的基礎(chǔ)。其次,提出兩種新的電子投票協(xié)議,一種是對常規(guī)性電子投票協(xié)議的改進(jìn),該協(xié)議是一個基于安全多方計算的可驗證式電子投票協(xié)議,該協(xié)議全隱私覆蓋、可驗證和計算簡便,同時適用性較強。而另一種是常規(guī)電子投票協(xié)議的延伸——內(nèi)部投票協(xié)議,同樣是一個基于安全多方計算的協(xié)議,且該內(nèi)部投票協(xié)議做到全隱私、可驗證和計算簡便。同時,本文將兩種電子投票協(xié)議分別運用于累積投票制與企業(yè)董事會投票等實際情境中,充分展示了兩種協(xié)議的可塑性和實用性。最后,在闡述電子投票協(xié)議的各種類型以及安全性要求的基礎(chǔ)上,提出了一個新的基于安全多方計算的電子拍賣協(xié)議,雖然協(xié)議較為簡單,但滿足了電子拍賣協(xié)議的安全性要求,同時計算簡便,便于應(yīng)用。
[Abstract]:Buying, selling and voting are two kinds of activities with a long history. They are not only an indispensable part of people's life, but also the key to the operation and management of enterprises. Now, with the rapid development of computer and network technology, the Internet information age has come quietly. The Internet information age gives new forms of trading and voting, such as electronic transactions, electronic auctions, electronic voting, and so on. Advanced network technology not only brings all kinds of convenience and economic benefits to enterprises, but also brings all kinds of risks and hidden dangers to security. With the increasing demand for the protection of personal privacy, how to ensure the security of information has become a major theme of the times. The emergence of secure multi-party computing provides a new security guarantee for the information explosion and the Internet information age which is full of information security hidden dangers. Secure multi-party computing makes the participants in the network environment of mutual distrust, without the help of the participation of third parties, through the exchange of information between participants, with the premise of not revealing their privacy, to achieve a variety of functional calculations. In order to complete a variety of new activities. Therefore, based on secure multi-party computing, this paper is devoted to the research of electronic voting and electronic auction, and applies these two research directions to the specific enterprise management situation. The specific work is as follows: firstly, the secure multi-party calculation is explained in detail, and the two important components of secure multi-party computation are analyzed and summarized. A new secure multi-party ranking protocol is proposed, which is secure and efficient, and has low computational complexity. It lays a good foundation for the application of secure multi-party computing to electronic voting protocols and electronic auction protocols. Secondly, two new electronic voting protocols are proposed. One is to improve the conventional electronic voting protocol, which is a verifiable electronic voting protocol based on secure multi-party computing. At the same time, the applicability is strong. The other is an extension of the conventional electronic voting protocol, the internal voting protocol, which is also a secure multi-party computing protocol, and the internal voting protocol is fully private, verifiable and easy to calculate. At the same time, this paper applies the two electronic voting protocols to the actual situations such as cumulative voting system and corporate board voting system, which fully demonstrate the plasticity and practicability of the two protocols. Finally, a new electronic auction protocol based on secure multi-party computing is proposed on the basis of describing the various types and security requirements of electronic voting protocol, although the protocol is relatively simple. But it meets the security requirements of the electronic auction protocol, and it is easy to calculate and easy to use.
【學(xué)位授予單位】：廣東工業(yè)大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：F713.359;TP309
本文編號：2201652
[Abstract]:Buying, selling and voting are two kinds of activities with a long history. They are not only an indispensable part of people's life, but also the key to the operation and management of enterprises. Now, with the rapid development of computer and network technology, the Internet information age has come quietly. The Internet information age gives new forms of trading and voting, such as electronic transactions, electronic auctions, electronic voting, and so on. Advanced network technology not only brings all kinds of convenience and economic benefits to enterprises, but also brings all kinds of risks and hidden dangers to security. With the increasing demand for the protection of personal privacy, how to ensure the security of information has become a major theme of the times. The emergence of secure multi-party computing provides a new security guarantee for the information explosion and the Internet information age which is full of information security hidden dangers. Secure multi-party computing makes the participants in the network environment of mutual distrust, without the help of the participation of third parties, through the exchange of information between participants, with the premise of not revealing their privacy, to achieve a variety of functional calculations. In order to complete a variety of new activities. Therefore, based on secure multi-party computing, this paper is devoted to the research of electronic voting and electronic auction, and applies these two research directions to the specific enterprise management situation. The specific work is as follows: firstly, the secure multi-party calculation is explained in detail, and the two important components of secure multi-party computation are analyzed and summarized. A new secure multi-party ranking protocol is proposed, which is secure and efficient, and has low computational complexity. It lays a good foundation for the application of secure multi-party computing to electronic voting protocols and electronic auction protocols. Secondly, two new electronic voting protocols are proposed. One is to improve the conventional electronic voting protocol, which is a verifiable electronic voting protocol based on secure multi-party computing. At the same time, the applicability is strong. The other is an extension of the conventional electronic voting protocol, the internal voting protocol, which is also a secure multi-party computing protocol, and the internal voting protocol is fully private, verifiable and easy to calculate. At the same time, this paper applies the two electronic voting protocols to the actual situations such as cumulative voting system and corporate board voting system, which fully demonstrate the plasticity and practicability of the two protocols. Finally, a new electronic auction protocol based on secure multi-party computing is proposed on the basis of describing the various types and security requirements of electronic voting protocol, although the protocol is relatively simple. But it meets the security requirements of the electronic auction protocol, and it is easy to calculate and easy to use.
【學(xué)位授予單位】：廣東工業(yè)大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：F713.359;TP309
【參考文獻(xiàn)】
相關(guān)期刊論文 前10條
1 劉慶彰;;基于Borda修正方法的投票制度[J];中國市場;2015年33期
2 楊婷婷;林昌露;張勝元;;安全的多候選人電子投票方案的改進(jìn)[J];福建師范大學(xué)學(xué)報(自然科學(xué)版);2015年03期
3 馮云芝;張恩;;基于博弈論的百萬富翁協(xié)議[J];計算機科學(xué);2014年12期
4 唐春明;石桂花;姚正安;;排序問題的安全多方計算協(xié)議[J];中國科學(xué):信息科學(xué);2011年07期
5 王曉敏;;基于環(huán)簽名的電子拍賣方案[J];電腦知識與技術(shù);2011年14期
6 陳良;高成敏;;半誠實模型下公平高效的安全兩方比較協(xié)議[J];計算機工程與應(yīng)用;2010年36期
7 黃宏升;仲紅;;保護(hù)私有信息的多方排序協(xié)議[J];微計算機信息;2010年18期
8 邱梅;羅守山;劉文;陳萍;;利用RSA密碼體制解決安全多方多數(shù)據(jù)排序問題[J];電子學(xué)報;2009年05期
9 王宏;;組合拍賣的理論與實踐:一個文獻(xiàn)綜述[J];產(chǎn)業(yè)經(jīng)濟評論;2009年01期
10 肖倩;羅守山;陳萍;吳波;;半誠實模型下安全多方排序問題的研究[J];電子學(xué)報;2008年04期
，本文編號：2201652
本文鏈接：http://sikaile.net/kejilunwen/ruanjiangongchenglunwen/2201652.html
最近更新
教材專著
