Accession Number:



Election Verifiability: Cryptographic Definitions and an Analysis of Helios and JCJ

Descriptive Note:

[Technical Report, Technical Report]

Corporate Author:

Cornell University

Report Date:


Pagination or Media Count:



Definitions of election verifiability in the computational model of cryptography are proposed. The definitions formalize notions of voters verifying their own votes, auditors verifying the tally of votes, and auditors verifying that only eligible voters vote. The Helios Adida et al., 2009 and JCJJuels et al., 2010 election schemes are analyzed using these definitions. Helios 4.0 satisfies the definitions, but Helios 2.0 does not because of previously known attacks. JCJ does not satisfy the definitions because of a trust assumption it makes, but it does satisfy a weakened definition. Two previous definitions of verifiability Juels et al., 2010 Cortier et al., 2014 are shown to permit election schemes vulnerable to attacks, whereas the new definitions prohibit those schemes.


Subject Categories:

  • Government and Political Science

Distribution Statement:

[A, Approved For Public Release]