基于同态加密的多候选人电子投票方案
作者:

Multi-Candidate Electronic Voting Scheme Based on Homomorphic Encryption
Author:
  • 摘要
  • | |
  • 访问统计
  • |
  • 参考文献 [17]
  • |
  • 相似文献 [20]
  • | | |
  • 文章评论
    摘要:

    电子投票因其便捷的特性,日益受到人们的青睐.然而电子投票中所暴露出来的安全问题成为人们所关注的重点,如何保证电子投票中的匿名性,公开可验证性等成为一个值得关注的问题.针对现有电子投票中存在的各种问题,基于数字签名算法和全同态加密提出了一种多候选人电子投票方案.该方案采用椭圆曲线数字签名算法解决电子投票中的身份认证问题;利用全同态加密技术实现对选票加密以及对加密选票的同态计算;为了能够对选票进行批量处理,采用SIMD技术打包选票;针对加密选票计票中存在的编解码问题设计了一种同态计票器.最后基于电子投票的八个安全特性对方案的安全性进行了分析,表明该方案是安全可行的.

    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.

    参考文献
    [1] Lee B, Boyd C, Dawson E, et al. Providing receipt-freeness in mixnet-based voting protocols. In:Lim JI, Lee DH, eds. Information Security and Cryptology-ICISC 2003. Berlin, Heidelberg:Springer, 2004. 245-258.
    [2] Chaum D, Ryan PYA, Schneider S. A practical voter-verifiable election scheme. In:De Capitani Di Vimercati S, Syverson P, Gollmann D, eds. Computer Security-ESORICS 2005. Berlin, Heidelberg:Springer, 2005. 118-139.
    [3] Fujioka A, Okamoto T, Ohta K. A practical secret voting scheme for large scale elections. Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques:Advances in Cryptology. Queensland, Australia. 1992. 244-251.
    [4] Radwin MJ. An untraceable, universally verifiable voting scheme. Seminar in Cryptology. 1995. http://www.radwin.org/michael/project/voting.pdf.
    [5] Kim K, Kim J, Lee B, et al. Experimental design of worldwide internet voting system using PKI. SSGRR, 2001.
    [6] 杨婷婷, 林昌露, 张胜元. 安全的多候选人电子投票方案的改进. 福建师大学报(自然科学版), 2015, 31(3):32-38
    [7] Anggriane SM, Nasution SM, Azmi F. Advanced e-voting system using Paillier homomorphic encryption algorithm. 2016 International Conference on Informatics and Computing. Mataram, Indonesia. 2017. 338-342.
    [8] 黄仕杰, 洪璇. 基于同态实现多候选人的电子投票方案. 计算机应用与软件, 2017, 34(3):284-288.[doi:10.3969/j.issn.1000-386x.2017.03.051
    [9] 朱正阳, 刘镪, 唐春明, 等. 基于LWE同态加密的电子投票方案. 信息网络安全, 2013, (5):8-11.[doi:10.3969/j.issn.1671-1122.2013.05.003
    [10] Johnson D, Menezes A, Vanstone S. The elliptic curve digital signature algorithm (ECDSA). International Journal of Information Security, 2001, 1(1):36-63.[doi:10.1007/s102070100002
    [11] Gentry C. Fully homomorphic encryption using ideal lattices. Proceedings of the Forty-first Annual ACM Symposium on Theory of Computing. Bethesda, MD, USA. 2009. 169-178.
    [12] Van Dijk M, Gentry C, Halevi S, et al. Fully homomorphic encryption over the integers. Gilbert H. Advances in Cryptology-EUROCRYPT 2010. Berlin, Heidelberg:Springer, 2010. 24-43.
    [13] Brakerski Z, Gentry C, Vaikuntanathan V. (Leveled) fully homomorphic encryption without bootstrapping. Proceedings of the 3rd Innovations in Theoretical Computer Science Conference. Cambridge, MA, USA. 2012. 309-325.
    [14] Gentry C, Sahai A, Waters B. Homomorphic encryption from learning with errors:Conceptually-simpler, asymptotically-faster, attribute-based. Canetti R, Garay JA. Advances in Cryptology (CRYPTO 2013). Berlin, Heidelberg:Springer, 2013. 75-92.
    [15] Hiromasa R, Abe M, Okamoto T. Packing messages and optimizing bootstrapping in GSW-FHE. In:Katz J, ed. Public Key Cryptography (PKC 2015). Berlin, Heidelberg:Springer, 2015. 699-715.
    [16] Regev O. On lattices, learning with errors, random linear codes, and cryptography. Proceedings of the Thirty-seventh Annual ACM Symposium on Theory of Computing. Baltimore, MD, USA. 2005. 84-93.
    [17] 王永恒, 徐晨, 陈经纬, 等. 基于HElib的安全电子投票方案. 计算机应用研究, 2017, 34(7):2167-2171.[doi:10.3969/j.issn.1001-3695.2017.07.055
    引证文献
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

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

复制
分享
文章指标
  • 点击次数:1945
  • 下载次数: 3531
  • HTML阅读次数: 2508
  • 引用次数: 0
历史
  • 收稿日期:2018-08-15
  • 最后修改日期:2018-09-05
  • 在线发布日期: 2019-01-28
  • 出版日期: 2019-02-15
文章二维码
您是第12829256位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京海淀区中关村南四街4号 中科院软件园区 7号楼305房间,邮政编码:100190
电话:010-62661041 传真: Email:csa (a) iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号