Multi-Candidate Electronic Voting Scheme Based on Homomorphic Encryption
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Electronic voting is increasingly popular because of its convenience. However, the security problems exposed in electronic voting have become the focus of attention. How to ensure anonymity and verifiability in electronic voting has become a concern. Aiming at various problems in existing electronic voting, a multi-candidate electronic voting scheme is proposed based on digital signature algorithm and full homomorphic encryption. This scheme uses elliptic curve digital signature algorithm to solve the problem of identity authentication in electronic voting. The homomorphic encryption technology is used to realize the encryption of votes and homomorphism calculation of encrypted votes. To be able to batch votes, SIMD technology is used to packing votes. A homomorphic addition ticket counter was designed for the codec problem of encrypted votes counting. Finally, the security of the scheme is analyzed based on the eight security features of electronic voting, which shows that the scheme is safe and feasible.

    Reference
    Related
    Cited by
Get Citation

何倩,沈炜.基于同态加密的多候选人电子投票方案.计算机系统应用,2019,28(2):146-151

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:August 15,2018
  • Revised:September 05,2018
  • Adopted:
  • Online: January 28,2019
  • Published: February 15,2019
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063