Secrecy and Verifiability: An Introduction to Electronic Voting

• URL: http://arxiv.org/abs/2602.12398v1
• Date: Thu, 12 Feb 2026 20:48:47 GMT
• Title: Secrecy and Verifiability: An Introduction to Electronic Voting
• Authors: Paul Keeler, Ben Smyth,
• Abstract summary: We argue that any electronic voting system needs two essential properties: ballot secrecy and verifiability.<n>An election scheme that is a complete black box offers ballot secrecy, but verification of the outcome is impossible.<n>This tutorial makes these ideas accessible to readers outside electronic voting.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Democracies are built upon secure and reliable voting systems. Electronic voting systems seek to replace ballot papers and boxes with computer hardware and software. Proposed electronic election schemes have been subjected to scrutiny, with researchers spotting inherent faults and weaknesses. Inspired by physical voting systems, we argue that any electronic voting system needs two essential properties: ballot secrecy and verifiability. These properties seemingly work against each other. An election scheme that is a complete black box offers ballot secrecy, but verification of the outcome is impossible. This challenge can be tackled using standard tools from modern cryptography, reaching a balance that delivers both properties. This tutorial makes these ideas accessible to readers outside electronic voting. We introduce fundamental concepts such as asymmetric and homomorphic encryption, which we use to describe a general electronic election scheme while keeping mathematical formalism minimal. We outline game-based cryptography, a standard approach in modern cryptography, and introduce notation for formulating elections as games. We then give precise definitions of ballot secrecy and verifiability in the framework of game-based cryptography. A principal aim is introducing modern research approaches to electronic voting.

Related papers

• Inference Attacks on Encrypted Online Voting via Traffic Analysis [19.653420340564946]
  We examine how adversaries can exploit metadata from encrypted network traffic to uncover sensitive information during online voting.<n>Our analysis reveals that, even without accessing the content, it is possible to infer critical voter actions, such as whether a person votes, the exact moment a ballot is submitted, and whether the ballot is valid or spoiled.<n>We evaluate our attacks on two widely used online voting platforms, one proprietary and one partially open source, achieving classification accuracy as high as 99.5%.
  arXiv  Detail & Related papers  (2025-09-19T07:14:01Z)
• VoteMate: A Decentralized Application for Scalable Electronic Voting on EVM-Based Blockchain [1.7034813545878589]
  A single vulnerability could be exploited to manipulate elections on a large scale.<n>System can be secure but may lack transparency and confidentiality.<n>Adding cryptographic layers can also ensure voter confidentiality.
  arXiv  Detail & Related papers  (2025-05-21T17:50:18Z)
• Post-Quantum Cryptography: An Analysis of Code-Based and Lattice-Based Cryptosystems [55.49917140500002]
  Quantum computers will be able to break modern cryptographic systems using Shor's Algorithm.<n>We first examine the McEliece cryptosystem, a code-based scheme believed to be secure against quantum attacks.<n>We then explore NTRU, a lattice-based system grounded in the difficulty of solving the Shortest Vector Problem.
  arXiv  Detail & Related papers  (2025-05-06T03:42:38Z)
• Efficient Lower Bounding of Single Transferable Vote Election Margins [56.12949230611067]
  Single transferable vote (STV) is a system of preferential proportional voting employed in multi-seat elections.<n>The margin of victory, or simply'margin', is the smallest number of ballots that need to be manipulated to alter the set of winners.<n>Lower bounds on the margin can also be used for this purpose, in cases where exact margins are difficult to compute.
  arXiv  Detail & Related papers  (2025-01-24T13:39:23Z)
• MERGE: Matching Electronic Results with Genuine Evidence for verifiable voting in person at remote locations [2.206168301581203]
  We introduce the MERGE protocol to combine the speed of electronic ballot delivery with the reliability of paper returns.<n>This protocol allows voters to submit an electronic record of their vote quickly while simultaneously mailing a paper ballot for verification.<n>The electronic record can be used for preliminary results, but the paper ballot is used in a Risk Limiting Audit (RLA) if received in time, ensuring the integrity of the election.
  arXiv  Detail & Related papers  (2024-10-09T09:19:01Z)
• Adaptively Weighted Audits of Instant-Runoff Voting Elections: AWAIRE [61.872917066847855]
  Methods for auditing instant-runoff voting (IRV) elections are either not risk-limiting or require cast vote records (CVRs), the voting system's electronic record of the votes on each ballot. We develop an RLA method that uses adaptively weighted averages of test supermartingales to efficiently audit IRV elections when CVRs are not available.
  arXiv  Detail & Related papers  (2023-07-20T15:55:34Z)
• Private Multi-Winner Voting for Machine Learning [48.0093793427039]
  We propose three new DP multi-winner mechanisms: Binary, $tau$, and Powerset voting. Binary voting operates independently per label through composition. $tau$ voting bounds votes optimally in their $ell$ norm for tight data-independent guarantees. Powerset voting operates over the entire binary vector by viewing the possible outcomes as a power set.
  arXiv  Detail & Related papers  (2022-11-23T20:06:46Z)
• Secure Order Based Voting Using Distributed Tallying [5.407319151576265]
  One of the main challenges in e-voting systems is to certify that the computed results are consistent with the cast ballots.<n>We propose a secure voting protocol for elections governed by order-based voting rules.<n>Our protocol, in which the tallying task is distributed among several independent talliers, offers perfect ballot secrecy.
  arXiv  Detail & Related papers  (2022-05-21T12:17:21Z)
• Expected Frequency Matrices of Elections: Computation, Geometry, and Preference Learning [58.23459346724491]
  We use the "map of elections" approach of Szufa et al. (AAMAS 2020) to analyze several well-known vote distributions. We draw the "skeleton map" of distributions, evaluate its robustness, and analyze its properties.
  arXiv  Detail & Related papers  (2022-05-16T17:40:22Z)
• Obvious Manipulability of Voting Rules [105.35249497503527]
  The Gibbard-Satterthwaite theorem states that no unanimous and non-dictatorial voting rule is strategyproof. We revisit voting rules and consider a weaker notion of strategyproofness called not obvious manipulability.
  arXiv  Detail & Related papers  (2021-11-03T02:41:48Z)
• Security Survey and Analysis of Vote-by-Mail Systems [0.0]
  We examine the security of electronic systems used in the process of voting by mail, including online voter registration and online ballot tracking systems. We find that online voter registration systems in some states have vulnerabilities that allow adversaries to alter or effectively prevent a voter's registration. We additionally find that ballot tracking systems raise serious privacy questions surrounding ease of access to voter data.
  arXiv  Detail & Related papers  (2020-05-18T02:18:15Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.