You are looking at a specific version 20200505:010930 of this paper. See the latest version.

Paper 2020/513

E-cclesia: Universally Composable Self-Tallying Elections

Myrto Arapinis and Nikolaos Lamprou and Lenka Marekova and Thomas Zacharias

Abstract

The concept of a self-tallying election (STE) scheme was first introduced by Kiayias et al and captures electronic voting schemes in which the tallying authorities are the voters of the election themselves. This type of electronic voting is particularly compatible with and suitable for (but not only) Blockchain governance, where governance is expected to be maintained in a fully distributed manner. In this work, we formalize the requirements for secure STE schemes in the Universal Composability (UC) framework. Our model captures the standard voting properties of eligibility, fairness, vote-privacy, and one voter-one vote. We present E-cclesia, a new family of STE schemes, and prove that it securely UC-realizes the STE functionality. We propose a first concrete instantiation of E-cclesia using RSA accumulators in combination with a Bitcoin-based time-lock encryption scheme. To this end, we provide en passant the first UC treatment of dynamic accumulators in the public setting as well as time lock encryption (TLE) schemes, and prove the equivalence of our UC definitions to the standard property-based accumulator definitions.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint. MINOR revision.
Keywords
e-votingaccumulatorstime-lock encryption
Contact author(s)
marapini @ inf ed ac uk,n lamprou @ ed ac uk,lenka marekova @ rhul ac uk,tzachari @ inf ed ac uk
History
2022-12-01: last of 4 revisions
2020-05-05: received
See all versions
Short URL
https://ia.cr/2020/513
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.