Esquema de votação seguro e transparente através de encriptação homomórfica
Abstract
Democracy depends on a large portion of voter's trust in the integrity of the process of electing their representatives. Thus, voting schemes need to be transparent and still guarantee the secrecy of the vote to ensure the integrity of elections. In this article, we propose a voting scheme using homomorphic encryption and commitment schemes. The system holds not only the confidentiality of the voters' vote but also to allow them to audit the outcome of the election. The experimental results show that the system performs well for elections with small numbers of voters.References
Azougaghe, A., Hedabou, M., and Belkasmi, M. (2015). An electronic voting system based on homomorphic encryption and prime numbers. In 2015 11th International Conference on Information Assurance and Security (IAS), pages 140–145.
Brams, S. J. and Fishburn, P. C. (2005). Going from theory to practice: the mixed success of approval voting. Social Choice and Welfare, 25(2):457– 474.
Graaf, J. A. M. V. d. (2017). Long-term threats to ballot privacy. IEEE Security Privacy, 15(3):40–47.
Hirt, M. and Sako, K. (2000). Efcient receipt-free voting based on In Proceedings of the 19th International Conference on homomorphic encryption. Theory and Application of Cryptographic Techniques, EUROCRYPT'00, pages 539– 556, Berlin, Heidelberg. Springer-Verlag.
Lima, F. T., Gazziro, M. A., Batista Junior, A. A., Matias, P., and Costa, J. V. C. (2017). Urna eletrônica de terceira geração: Um protótipo para eleições auIn XVII Simpósio Brasileiro em Segurança da Informação e de Sistemas ditáveis. Computacionais: SBSEG 2017, pages 677–685, Brasília-DF.
National Academies of Sciences, E. and Medicine (2018). Securing the Vote: Protecting American Democracy. The National Academies Press, Washington, DC.
Peng, K. and Bao, F. (2011). Efcient multiplicative homomorphic evoting. In Proceedings of the 13th International Conference on Information Security, ISC'10, pages 381–393, Berlin, Heidelberg. Springer-Verlag.
Pino, R. d., Lyubashevsky, V., Neven, G., and Seiler, G. (2017). Practical quantum-safe voting from lattices. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS '17, pages 1565–1581, New York, NY, USA. ACM.
Yang, X., Yi, X., Nepal, S., Kelarev, A., and Han, F. (2018). A secure veriable ranked choice online voting system based on homomorphic encryption. IEEE Access, 6:20506–20519.
Brams, S. J. and Fishburn, P. C. (2005). Going from theory to practice: the mixed success of approval voting. Social Choice and Welfare, 25(2):457– 474.
Graaf, J. A. M. V. d. (2017). Long-term threats to ballot privacy. IEEE Security Privacy, 15(3):40–47.
Hirt, M. and Sako, K. (2000). Efcient receipt-free voting based on In Proceedings of the 19th International Conference on homomorphic encryption. Theory and Application of Cryptographic Techniques, EUROCRYPT'00, pages 539– 556, Berlin, Heidelberg. Springer-Verlag.
Lima, F. T., Gazziro, M. A., Batista Junior, A. A., Matias, P., and Costa, J. V. C. (2017). Urna eletrônica de terceira geração: Um protótipo para eleições auIn XVII Simpósio Brasileiro em Segurança da Informação e de Sistemas ditáveis. Computacionais: SBSEG 2017, pages 677–685, Brasília-DF.
National Academies of Sciences, E. and Medicine (2018). Securing the Vote: Protecting American Democracy. The National Academies Press, Washington, DC.
Peng, K. and Bao, F. (2011). Efcient multiplicative homomorphic evoting. In Proceedings of the 13th International Conference on Information Security, ISC'10, pages 381–393, Berlin, Heidelberg. Springer-Verlag.
Pino, R. d., Lyubashevsky, V., Neven, G., and Seiler, G. (2017). Practical quantum-safe voting from lattices. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS '17, pages 1565–1581, New York, NY, USA. ACM.
Yang, X., Yi, X., Nepal, S., Kelarev, A., and Han, F. (2018). A secure veriable ranked choice online voting system based on homomorphic encryption. IEEE Access, 6:20506–20519.
Published
2019-09-02
How to Cite
DE ARAÚJO, Pedro Vinicius; BATISTA JR, Antônio; GAZZIRO, Mario.
Esquema de votação seguro e transparente através de encriptação homomórfica. In: WORKSHOP ON ELECTORAL TECHNOLOGY, 4. , 2019, São Paulo.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2019
.
p. 25-36.
DOI: https://doi.org/10.5753/wte.2019.14041.
