This paper, proposes a web-based voting system, which allows voters to cast and submit their electronic ballots by ranking all candidates according to their personal preference. Each ballot is treated as a square matrix, with each element encrypted using the ElGamal cryptosystem before submission. Furthermore, proof of partial knowledge and zero knowledge are used to verify the eligibility of ballots without accessing ballot contents. We also implement a prototype to test our proposed voting system. The security and performance analysis indicate the feasibility of the proposed protocols.
CITATION STYLE
Yang, X., Yi, X., Ryan, C., van Schyndel, R., Han, F., Nepal, S., & Song, A. (2017). A verifiable ranked choice internet voting system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10570 LNCS, pp. 490–501). Springer Verlag. https://doi.org/10.1007/978-3-319-68786-5_39
Mendeley helps you to discover research relevant for your work.