Extended Prêt à voter with discretely-chaotic family of permutations
Mohsen Ajori, Mohammad Beheshti Atashgah, Ali Payandeh · 2012
This paper presents an e-voting model based on Prêt à Voter. Modifications caused a considerable improvement in security and flexibility of the proposed model. Also it has a better chance of public acceptance. In the proposed model, we modified the ballot form and this modification eliminates possibility of “chain voting” attack. Also we apply discretely-chaotic family of permutations to generate a completely random order of candidates for each ballot form. These and other modifications caused the proposed model be able to handle “k of L” and “ranked” voting; this is an important contribution. The role of registration authority has been distributed among many entities. This is not new but prevents them from fraud or collusion with a voter. Also, this RAs group's signature on the ballot forms helps to gain one of the most important advantages of proposed model: “Public verifiability”.