Chirotonia: A Scalable and Secure e-Voting Framework based on Blockchains and Linkable Ring Signatures

In this paper we propose a comprehensive and scalable framework to build secure-by-design e-voting systems. Decentralization, transparency, determinism, and untamperability of votes are granted by dedicated smart contracts on a blockchain, while voter authenticity and anonymity are achieved through (provable secure) linkable ring signatures. These, in combination with suitable smart contract constraints, also grant protection from double voting. Our design is presented in detail, focusing on its security guarantees and the design choices that allow it to scale to a large number of voters. Finally, we present a proof-of-concept implementation of the proposed framework, made available as open source.

[1]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[2]  Aggelos Kiayias,et al.  Distributed, End-to-end Verifiable, and Privacy-Preserving Internet Voting Systems , 2019, Comput. Secur..

[3]  Nick Szabo,et al.  Formalizing and Securing Relationships on Public Networks , 1997, First Monday.

[4]  Miguel Oom Temudo de Castro,et al.  Practical Byzantine fault tolerance , 1999, OSDI '99.

[5]  Zoe L. Jiang,et al.  A Secure Decentralized Trustless E-Voting System Based on Smart Contract , 2019, 2019 18th IEEE International Conference On Trust, Security And Privacy In Computing And Communications/13th IEEE International Conference On Big Data Science And Engineering (TrustCom/BigDataSE).

[6]  Alfred Menezes,et al.  Guide to Elliptic Curve Cryptography , 2004, Springer Professional Computing.

[7]  Torben P. Pedersen.  A Threshold Cryptosystem without a Trusted Party (Extended Abstract) , 1991, EUROCRYPT.

[8]  Véronique Cortier,et al.  Belenios: A Simple Private and Verifiable Electronic Voting System , 2019, Foundations of Security, Protocols, and Equational Reasoning.

[9]  Nico Döttling,et al.  Ring Signatures: Logarithmic-Size, No Setup - from Standard Assumptions , 2019, IACR Cryptol. ePrint Arch..

[10]  Germán Sáez,et al.  Forking Lemmas for Ring Signature Schemes , 2003, INDOCRYPT.

[11]  Yi Liu,et al.  An E-voting Protocol Based on Blockchain , 2017, IACR Cryptol. ePrint Arch..

[12]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[13]  Ran Canetti,et al.  Decisional Diffie-Hellman Problem , 2011, Encyclopedia of Cryptography and Security.

[14]  Ben Adida,et al.  Helios: Web-based Open-Audit Voting , 2008, USENIX Security Symposium.

[15]  Paul Feldman,et al.  A practical scheme for non-interactive verifiable secret sharing , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[16]  Edgar R. Weippl,et al.  ETHDKG: Distributed Key Generation with Ethereum Smart Contracts , 2019, IACR Cryptol. ePrint Arch..

[17]  Ethan Buchman,et al.  Tendermint: Byzantine Fault Tolerance in the Age of Blockchains , 2016 .

[18]  Joseph K. Liu,et al.  Linkable Spontaneous Anonymous Group Signature for Ad Hoc Groups (Extended Abstract) , 2004, ACISP.

[19]  Mihir Bellare,et al.  Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.

[20]  Javier Herranz Sotoca,et al.  Some digital signature schemes with collective signers , 2005 .

[21]  Josh Benaloh,et al.  Receipt-free secret-ballot elections (extended abstract) , 1994, STOC '94.

[22]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[23]  Yael Tauman Kalai,et al.  How to Leak a Secret: Theory and Applications of Ring Signatures , 2001, Essays in Memory of Shimon Even.