DEMOS-2: Scalable E2E Verifiable Elections Without Random Oracles
- Submitting institution
-
University of Edinburgh
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 156904712
- Type
- E - Conference contribution
- DOI
-
10.1145/2810103.2813727
- Title of conference / published proceedings
- Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security
- First page
- 352
- Volume
- -
- Issue
- -
- ISSN
- -
- Open access status
- -
- Month of publication
- October
- Year of publication
- 2015
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
C - Foundations of Computation
- Citation count
- 14
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The paper "End-to-end verifiable elections in the standard model" (DOI: 10.1007/978-3-662-46803-6_16) introduced DEMOS, the first end-to-end verifiable e-voting system without setup assumptions. This work presents DEMOS-2, an e-voting system that achieves the same security properties as DEMOS, yet it is based on client-side encryption, an approach that allows for better scalability than the code-voting approach followed by DEMOS. The paper introduces novel techniques for proving the integrity of the election setup parameters via cryptographic proofs which required randomness is extracted by the voters' engagement in the voting process.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -