Font Size: a A A

Research On Electronic Voting Scheme Based On Fully Homomorphic Encryption

Posted on:2020-01-27Degree:MasterType:Thesis
Country:ChinaCandidate:Q HeFull Text:PDF
GTID:2428330572968583Subject:Engineering
Abstract/Summary:PDF Full Text Request
With the continuous development of science and technology,people's work,study,life and other activities in the modern era depend on the realizationof the Internet.In this era of technologicalization,the way people express democracy has gradually changed from original paper voting to electronic voting.With the development of information security technology,nowadays electronic voting is mostly based on cryptography.Electronic voting is increasingly popular because of its convenience.However,the security issues exposed in electronic voting have become the focus of attention.How to ensure anonymity,privacy,security and public verifiability in electronic voting has become a concern.Aiming at the various problems existing in electronic voting,this paper proposes a multi-candidate electronic voting scheme based on digital signature algorithm and fully homomorphic encryption algorithm.The main research contents of this paper are as follows:(1)To solve the problems in electronic voting,the elliptic curve digital signature algorithm and fully homomorphic encryption algorithm are introduced.Compared with traditional RSA digital signature algorithm,elliptic curve digital signature algorithm has shorter public key size(under the same security performance),faster signature speed,and is more suitable for electronic voting scenarios,which can better solve the identity authentication problem in electronic voting;fully homomorphic encryption algorithm is used to implement the homomorphic calculation of the encrypted ballots.The combination of the two can effectively achieve anonymity and public verifiability in electronic voting.(2)Aiming at the privacy of counting votes in electronic voting,a homomorphic counting device is designed in this paper.Without the decryption key,the homomorphic ballot counter can count ciphertext ballots,so that the ballot counting can be handed over to any untrustworthy third party,which meets the requirements of privacy and security of electronic voting design.In addition,SIMD ciphertext packaging technology is introduced to optimize the homomorphic ticket counter,which achieves faster operation of the homomorphic ticket counting process and makes it easier to be used in actual scenarios.(3)According to the security requirements of electronic voting system,a multi-candidate electronic voting scheme is designed based on digital signature algorithm and fully homomorphic encryption algorithm,and a prototype system is implemented.The system isfriendly and easy to use.It can be used safely and effectively to run,and meets the basic needs of electronic voting.
Keywords/Search Tags:multi-candidate electronic voting, elliptic curve digital signature, fully homomorphic encryption, ciphertext packaging
PDF Full Text Request
Related items