Browse/search for people

Publication - Professor Bogdan Warinschi

    Machine-checked proofs for electronic voting

    Privacy and verifiability for belenios

    Citation

    Cortier, V, Dragan, CC, Dupressoir, F & Warinschi, B, 2018, ‘Machine-checked proofs for electronic voting: Privacy and verifiability for belenios’. in: 2018 IEEE 31st Computer Security Foundations Symposium (CSF 2018): Proceedings of a meeting held 9-12 July 2018, Oxford, United Kingdom. Institute of Electrical and Electronics Engineers (IEEE), pp. 298-312

    Abstract

    We present a machine-checked security analysis of Belenios - a deployed voting protocol used already in more than 200 elections. Belenios extends Helios with an explicit registration authority to obtain eligibility guarantees. We offer two main results. First, we build upon a recent framework for proving ballot privacy in EasyCrypt. Inspired by our application to Belenios, we adapt and extend the privacy security notions to account for protocols that include a registration phase. Our analysis identifies a trust assumption which is missing in the existing (pen and paper) analysis of Belenios: Ballot privacy does not hold if the registrar misbehaves, even if the role of the registrar is seemingly to provide eligibility guarantees. Second, we develop a novel framework for proving strong verifiability in EasyCrypt and apply it to Belenios. In the process, we clarify several aspects of the pen-and-paper proof, such as how to deal with revote policies. Together, our results yield the first machine-checked analysis of both ballot privacy and verifiability properties for a deployed electronic voting protocol. Perhaps more importantly, we identify several issues regarding the applicability of existing definitions of privacy and verifiability to systems other than Helios. While we show how to adapt the definitions to the particular case of Belenios, our findings indicate the need for more general security notions for electronic voting protocols with registration authorities.

    Full details in the University publications repository