Extended Prêt à Voter with Discretely-Chaotic Family of Permutations

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 abetter chance of public acceptance. In the proposed model, we modified the ballot form and this modification eliminatespossibility of chain voting attack. Also we apply discretelychaotic family of permutations to generate a completely random order of candidates for each ballot form. These and othermodifications 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 theballot forms helps to gain one of the most important advantages of proposed model: Public verifiability

Keywords:

Electronic Voting , Mixnet , Anonymity , Verifiability