Chondros, Nikos and Zhang, Bingsheng and Zacharias, Thomas and Diamantopoulos, Panos and Maneas, Stathis and Patsonakis, Christos and Delis, Alex and Kiayias, Aggelos and Roussopoulos, Mema (2016) D-DEMOS : a distributed, end-to-end verifiable, internet voting system. In: Proceedings of the 36th IEEE International Conference on Distributed Computing Systems (ICDCS 2016) :. 2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS), . IEEE, pp. 711-720.
finer_icdcs2016_camera_ready.pdf - Accepted Version
Download (522kB)
Abstract
E-voting systems have emerged as a powerful tech- nology for improving democracy by reducing election cost, in- creasing voter participation, and even allowing voters to directly verify the entire election procedure. Prior internet voting systems have single points of failure, which may result in the compromise of availability, voter secrecy, or integrity of the election results. In this paper, we present the design, implementation, security analysis, and evaluation of D-DEMOS, a complete e-voting system that is distributed, privacy-preserving and end-to-end verifiable. Our system includes a fully asynchronous vote collection subsys- tem that provides immediate assurance to the voter her vote was recorded as cast, without requiring cryptographic operations on behalf of the voter. We also include a distributed, replicated and fault-tolerant Bulletin Board component, that stores all necessary election-related information, and allows any party to read and verify the complete election process. Finally, we also incorporate trustees, i.e., individuals who control election result production while guaranteeing privacy and end-to-end-verifiability as long as their strong majority is honest. Our system is the first e-voting system whose voting operation is human verifiable, i.e., a voter can vote over the web, even when her web client stack is potentially unsafe, without sacrificing her privacy, and still be assured her vote was recorded as cast. Additionally, a voter can outsource election auditing to third parties, still without sacrificing privacy. Finally, as the number of auditors increases, the probability of election fraud going undetected is diminished exponentially. We provide a model and security analysis of the system. We implement a prototype of the complete system, we measure its performance experimentally, and we demonstrate its ability to handle large-scale elections.