"Just for the sake of transparency": Exploring Voter Mental Models Of VerifiabilityZollinger, Marie-Laure ; Estaji, Ehsan ; Ryan, Peter Y A et alin Electronic Voting, Sixth International Joint Conference, E-Vote-ID 2021, Bregenz, Austria, October 5-8 (2021, October) Verifiable voting schemes allow voters to verify their individual votes and the election outcome. The voting protocol Selene offers verification of plaintext votes while preserving privacy. Misconceptions ... [more ▼] Verifiable voting schemes allow voters to verify their individual votes and the election outcome. The voting protocol Selene offers verification of plaintext votes while preserving privacy. Misconceptions of verification mechanisms might result in voters mistrust of the system or abstaining from using it. In this paper, we interviewed 24 participants and invited them to illustrate their mental models of Selene. The drawings demonstrated different levels of sophistication and four mental models: 1) technology understanding, 2) meaning of the verification phase, 3) security concerns, and 4) unnecessary steps. We highlight the misconceptions expressed regarding Internet voting technologies and the system design. Based on our findings, we conclude with recommendations for future implementations of Selene as well as for the design of Internet voting systems in general. [less ▲] Detailed reference viewed: 102 (5 UL) Towards Model Checking of Voting Protocols in UppaalJamroga, Wojciech ; Kim, Yan ; et alin Proceedings of the Fifth International Joint Conference on Electronic Voting E-VOTE-ID 2020 (2020) The design and implementation of a trustworthy e-voting system is a challenging task. Formal analysis can be of great help here. In particular, it can lead to a better understanding of how the voting ... [more ▼] The design and implementation of a trustworthy e-voting system is a challenging task. Formal analysis can be of great help here. In particular, it can lead to a better understanding of how the voting system works, and what requirements on the system are relevant. In this paper, we propose that the state-of-art model checker Uppaal provides a good environment for modelling and preliminary verification of voting protocols. To illustrate this, we demonstrate how to model a version of Pret-a-Voter in Uppaal, together with some natural extensions. We also show how to verify a variant of receipt-freeness, despite the severe limitations of the property specification language in the model checker. The aim of this work is to open a new path, rather then deliver the ultimate outcome of formal analysis. A comprehensive model of Pret-a-Voter, more accurate specification of requirements, and exhaustive verification are planned for the future. [less ▲] Detailed reference viewed: 60 (1 UL) Revisiting Practical and Usable Coercion-Resistant Remote E-VotingEstaji, Ehsan ; ; et alin Electronic Voting - 5th International Joint Conference, E-Vote-ID 2020, Bregenz, Austria, October 6-9, 2020, Proceedings (2020) Detailed reference viewed: 96 (5 UL) A Survey of Requirements for COVID-19 Mitigation Strategies. Part I: Newspaper ClipsJamroga, Wojciech ; Mestel, David ; Roenne, Peter et alE-print/Working paper (2020) Detailed reference viewed: 57 (0 UL) Post-Quantum Anonymous Veto Networks; ; Mueller, Johannes et alin E-Vote-ID 2020 (2020) Detailed reference viewed: 58 (3 UL) Preservation of DNA Privacy During the Large Scale Detection of COVID-19; ; Roenne, Peter et alE-print/Working paper (2020) Detailed reference viewed: 44 (0 UL) (Universal) Unconditional Verifiability in E-Voting without Trusted Parties; Rial, Alfredo ; Roenne, Peter et alin 2020 IEEE 33rd Computer Security Foundations Symposium (2020) Detailed reference viewed: 136 (1 UL) Verifiable Inner Product Encryption SchemeSoroush, Najmeh ; ; Rial, Alfredo et alin Public-Key Cryptography – PKC 2020 (2020) Detailed reference viewed: 117 (7 UL) |
||