France’s June 2022 legislative elections, which collected over 524,000 electronic ballots from overseas residents, represent the largest e-voting deployment to date in terms of ballots cast, and subsequent reverse engineering by French researchers uncovered critical vulnerabilities in the system. The platform, used to elect 11 deputies and involving 1.6 million eligible voters, lacked the robust security needed for reliable remote elections.

Researchers uncovered these flaws after the vote, prompting a search for more secure alternatives; post-quantum cryptography and quantum electronic voting are now being explored. The work demonstrates a quantum e-voting protocol operating under realistic conditions, taking a step toward quantum-secure democratic election procedures.

France’s Largest E-Vote Revealed Systemic Vulnerabilities

The platform, designed to facilitate voting for French residents abroad, underwent a reverse engineering analysis by French researchers who identified vulnerabilities, raising concerns about the integrity of the 11 deputies elected through the system. This subsequent analysis uncovered critical vulnerabilities, raising serious concerns about its long-term security. Although information-theoretic e-voting protocols have been proposed, they often rely on strong assumptions such as trusted authorities or simultaneous broadcast channels, both of which are impractical in many real-world scenarios, according to the study.

This prompted exploration of post-quantum cryptography as a potential solution, though long-term security guarantees remain an open question. The work builds upon a previously proposed information-theoretically secure quantum e-voting protocol, leveraging multipartite entanglement where each agent receives a qubit from an N-qubit GHZ state and performs local measurements. This approach aims to eliminate reliance on trusted authorities, a significant weakness in many classical e-voting systems.

The protocol incorporates quantum verification and classical anonymous transmission subroutines, ensuring both privacy and correctness, and the current implementation enhances and extends the original protocol with privacy enhancements and support for multiple candidates and voting pools. Technically, the improved protocol relies on the efficient composition of repeated executions of the original system, increasing its practicality and scalability. The experimental setup utilizes a compact, high-fidelity GHZ source operating at telecom wavelengths.

Researchers demonstrated the protocol in practice with two distinct election scenarios: a two-candidate election with four voters and a multicandidate election involving two independent pools of four voters, highlighting its potential for broader application. “We demonstrate, for the first time to our knowledge, a quantum electronic voting protocol operating under realistic conditions,” the researchers state.

The core of the protocol involves a secret index assigned to each agent via a classical subroutine called UniqueIndex, ensuring each voter knows when they are scheduled to vote while keeping the overall schedule confidential. The second phase consists of multiple repetitions of a core procedure, comprising rounds of verification followed by a vote, with all results aggregated on a bulletin board. The bulletin board collects data from each round and voter.

“Compute the exclusive OR (XOR) over each row, obtaining a N × ⌈ log 2 ( C ) ⌉ vertical vector; from this it is straightforward to compute the tally,” the study explains. The protocol’s security hinges on a verification step where agents measure their state on the Hadamard basis and broadcast the result, encoding randomness or the vote itself depending on the round.

Agents then perform a LogicalOR operation to ensure the integrity of the encoded information, reverting to an earlier stage if discrepancies are detected. While the current setup does not include quantum memories, an essential component for a fully functional system, the researchers note that such devices are continuously improving, aligning the demonstration with the capabilities of near-term quantum technologies. This advancement offers a potential pathway toward building truly secure and verifiable electronic voting systems, addressing the vulnerabilities exposed by the French election and paving the way for a more trustworthy democratic process.

This protocol, detailed in a recent publication, moves beyond cryptographic assumptions and aims to provide information-theoretic security, a level of assurance unattainable with existing systems.

GHZ Source & Telecom Wavelengths Enable Experimental Setup

Søren Wilkening and colleagues at the University of Vienna recently demonstrated a functional quantum e-voting protocol, addressing vulnerabilities exposed in France’s June 2022 legislative elections for overseas residents. Unlike previous quantum e-voting proposals that often demanded specialized hardware or unrealistic conditions, this approach leverages established technology to transmit quantum information.

The researchers constructed a system capable of distributing entangled qubits to multiple agents, forming the foundation for a secure voting process. This distribution is central to the protocol’s security, as it allows for verification of the quantum state before voting commences. A key innovation lies in the protocol’s ability to enhance privacy through repeated executions and the composition of multiple rounds of verification and voting.

The core procedure begins with a secret order assignment to each agent, ensuring anonymity while maintaining the integrity of the election. This is achieved through a classical subroutine called UniqueIndex, which assigns each voter a unique, secret random index. The protocol then cycles through multiple rounds, where agents randomly choose between verification and voting subroutines, adding layers of obfuscation to protect individual ballots. In both scenarios, the protocol successfully processed votes while maintaining the security guarantees.

This method ensures that the tally accurately reflects the voters’ preferences without revealing individual choices. They acknowledge that the continuous advancements in quantum memory technology align with the capabilities of their demonstration. The work demonstrates a pathway toward addressing the vulnerabilities inherent in classical e-voting systems, as highlighted by the issues encountered in the French elections, and offers a promising solution for securing future democratic processes.

Protocol 1: Enhancements for Multiple Candidates & Pools

Researchers have now detailed enhancements to this protocol, specifically designed to support multiple candidates and voting pools, significantly increasing its practicality for larger-scale deployments. The refined protocol, termed Protocol 1, addresses limitations in earlier quantum e-voting proposals by focusing on efficient composition of repeated executions of a core procedure. This approach allows for enhanced privacy and scalability, crucial for handling elections with numerous participants and diverse candidate fields. The current iteration expands on this by incorporating privacy enhancement techniques and extending the protocol’s capabilities to accommodate multiple voting pools, improving both efficiency and real-world applicability.

These tests demonstrate the protocol’s ability to handle varying complexities and highlight its practical viability. All agents agree on the bulletin board B. Every agent publicly broadcasts their result; the vector collecting all the results d j ( p, k, n ) j ∈ [ N ] is the n th row of the ( p, k ) -subround.

Verification Subroutine Ensures Source Trustlessness & Fidelity

This discovery catalyzed research into protocols that minimize reliance on trusted authorities, a critical step toward building truly secure remote voting systems. A new quantum e-voting protocol, detailed in a recent publication, addresses these vulnerabilities by incorporating a verification subroutine designed to ensure both the fidelity and trustlessness of the voting process. This verification step is crucial; it establishes a threshold of fidelity above which the election can proceed with confidence, effectively removing a single point of failure.

The bulletin board itself serves as a central repository for collected votes, with the final tally computed by evaluating the data it contains. Each agent broadcasts their result, forming a vector that, when processed, reveals the aggregated voting preferences.

👉 More information
🗞 Experimental Quantum Electronic Voting
✍️ Nicolas Laurent-Puig, Matilde Baroni, Federico Centrone and Eleni Diamanti
🧠 DOI: http://link.aps.org/doi/10.1103/scjl-5ygh

More like this