Font Size: a A A

Research And Application Of Secure Multi-Party Computation In Secure Electronic Voting System

Posted on:2019-08-25Degree:MasterType:Thesis
Country:ChinaCandidate:M WuFull Text:PDF
GTID:2428330545954576Subject:Computer technology
Abstract/Summary:PDF Full Text Request
The rapid development of the Internet has brought many problems in cooperative computing.Different data holders need to cooperate in computing and exchanging information,integrating resources,and obtaining more valuable calculation results.Secure multi-party computation is a distributed protocol that enables users to complete cooperative computing tasks without revealing secret information.Electronic voting is the most typical application case for secure multi-party computation.This paper studies two basic protocols for secure multi-party computation and the famous electronic voting protocol FOO protocol,and analyzed the problems in the protocol.The computational complexity of Yao's Millionaire protocol is an exponential function of the input scale,which makes it difficult to compare two large numbers;Secure sum protocol do not prevent(n-1)participants from joining each other to obtain confidential input from one participant;The security of the FOO protocol relies on an absolutely trusted third-party organization,which in turn creates a security risk.In view of the above issues,this paper starts from the two aspects of the Secure Multi-Party Computation basic protocol and the FOO protocol.The main tasks include:(1)A millionaire protocol based on Paillier's homomorphic encryption scheme was proposed.This protocol adopts the secret segmentation idea and the Paillier homomorphic encryption scheme with homomorphism,which solves the secret comparison problem of two private data well.Compared with the Yao's Millionaire protocol,the protocol is less complex and allows a secret comparison of big data.(2)A secure sum protocol based on ElGamal homomorphic encryption scheme was proposed.The protocol uses the idea of random number hiding and ElGamal homomorphic encryption scheme with multiplicative homomorphism.It can solve the problem of multiple participants secretly summing their own secret input.Compared with the original security summation protocol,this protocol can resist(n-1)participants' joint attacks.(3)A new multi-elective multi-electronic privacy voting protocol was proposed.Compared with the original FOO protocol,the security of the protocol no longer relies on third-party agencies,eliminating the occurrence of cheating in the counting organization.And the protocol does not need to decrypt every ballot to count the votes,which has higher efficiency and safety.(4)According to the new electronic voting protocol proposed in this paper,a multi-choice and multiple-secure electronic voting system was designed and implemented.The system can effectively protect the privacy of voter from being leaked and prevent the voter and system administrator from cheating.Finally,the system is implemented on the myeclipse platform.
Keywords/Search Tags:Secure Multi-Party Computation, FOO Protocol, Electronic Voting, Secure Sum Protocol, Millionaire Protocol
PDF Full Text Request
Related items