A new secure electronic voting system that could be used in elections worldwide has been designed that its mathematician inventors claim delivers a simple and transparent scheme that easily confirms the correctness of any final election result.
The new protocol is also claimed to guarantee privacy and allows verifiability, say the ream from the Université Paris-Saclay’s University of Versailles, Inpher, Gemalto and CEA LIST.
The scheme follows the essential components for a convincing e-voting approach, say the team:
- no-one should be able to ever access any particular individual’s vote
- each voter should be able to verify that their vote was included
- the final vote count should correspond with the sum of all the legitimate votes.
Their system also publicly detects any attempt to cheat, it is claimed.
“Designing security for electronic based systems is much more intricate than for traditional, paper-based systems,” said the university’s Ilaria Chillotti.
You might also like
“Until now, such designs were based on assumptions that could be compromised by advanced quantum computers, [but] our design is the first step to achieving a quantum resistant e-voting scheme.”
Chillotti also says the protocol differs from existing e-voting protocols that have been used for medium-scale elections by changing the underlying design with a “lattice-based fully homomorphic encryption design.”
Fully homomorphic encryption allows computations to be carried out on encrypted information, it is stated.
The paper was published in Post-Quantum Cryptography 2016, part of the Lecture Notes in Computer Science book series.