CIVIS - A Coercion-Resistant Election System
Author:
Araujo Roberto,Neto André,Traoré Jacques
Abstract
Coercion is an intrinsic problem of Internet elections that certainly prevent its wide use. Although there is no optimal solution for this problem, modern cryptographic election schemes can mitigate it. Most of these proposals, however, were never used to carry out real elections due to the lack of software implementations. As a result, it is not possible to test these schemes in realistic election scenarios and so their interest remain purely theoretical. In this context, this work introduces the CIVIS election system. CIVIS is a web-based system that implements ideas to fight coercive attacks. It is based on a secure coercion-resistant election scheme and it shows the applicability of this scheme to accomplish realistic elections. Besides introducing CIVIS, we show that a famous Internet-based election system used in Brazil does not satisfy important security properties for voting.
Publisher
Sociedade Brasileira de Computação - SBC
Reference27 articles.
1. Abdellatif, T. and Adouani, A. (2014). Mosaic: A secure and practical remote voting system. Int. J. Autonomic Comput., 2(1):1–20. 2. Adida, B. (2008). Helios: Web-based open-audit voting. In van Oorschot, P. C., editor, Proceedings of the 17th USENIX Security Symposium, July 28-August 1, 2008, San Jose, CA, USA, pages 335–348. USENIX Association. 3. Araújo, R., Rajeb, N. B., Robbana, R., Traoré, J., and Yousfi, S. (2010). Towards practical and secure coercion-resistant electronic elections. In Heng, S., Wright, R. N., and Goi, B., editors, Cryptology and Network Security - 9th International Conference, CANS 2010, Kuala Lumpur, Malaysia, December 12-14, 2010. Proceedings, volume 6467 of Lecture Notes in Computer Science, pages 278–297. Springer. 4. Benaloh, J. (2006). Simple verifiable elections. In Wallach, D. S. and Rivest, R. L., editors, 2006 USENIX/ACCURATE Electronic Voting Technology Workshop, EVT’06, Vancouver, BC, Canada, August 1, 2006. USENIX Association. 5. Boneh, D. (1998). The decision diffie-hellman problem. In Buhler, J., editor, Algorithmic Number Theory, Third International Symposium, ANTS-III, Portland, Oregon, USA, June 21-25, 1998, Proceedings, volume 1423 of Lecture Notes in Computer Science, pages 48–63. Springer.
|
|