A Post-Quantum Secure End-to-End Verifiable E-Voting Protocol Based on Multivariate Polynomials

• URL: http://arxiv.org/abs/2512.17613v1
• Date: Fri, 19 Dec 2025 14:16:37 GMT
• Title: A Post-Quantum Secure End-to-End Verifiable E-Voting Protocol Based on Multivariate Polynomials
• Abstract summary: Existing state-of-the-art designs for secure E-Voting are based on number-theoretic hardness assumptions.<n>We present a simple yet efficient design involving only standard primitives as building blocks.
• Score: 18.694840473622605
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Voting is a primary democratic activity through which voters select representatives or approve policies. Conventional paper ballot elections have several drawbacks that might compromise the fairness, effectiveness, and accessibility of the voting process. Therefore, there is an increasing need to design safer, effective, and easily accessible alternatives. E-Voting is one such solution that uses digital tools to simplify voting. Existing state-of-the-art designs for secure E-Voting are based on number-theoretic hardness assumptions. These designs are no longer secure due to quantum algorithms such as Shor's algorithm. We present the design and analysis of \textit{first} post-quantum secure end-to-end verifiable E-Voting protocol based on multivariate polynomials to address this issue. The security of our proposed design depends on the hardness of the MQ problem, which is an NP-hard problem. We present a simple yet efficient design involving only standard cryptographic primitives as building blocks.

Related papers

• Algorithms for Structured Elections under Thiele Voting Rules [50.74668888214481]
  We study the computational complexity of winner determination problems in approval-based committee elections under Thiele voting rules.<n>We first analyze the structure of optimal solutions based on the sets of voters who approve each candidate.<n>We show that every Thiele rule on VI is FPT with respect to a parameter for which the problem is NP-hard on general instances.
  arXiv  Detail & Related papers  (2026-07-30T17:37:14Z)
• Quantum Voting Protocol for Centralized and Distributed Voting Based on Phase-Flip Counting [0.0]
  We introduce a novel quantum voting protocol that leverages quantum superposition and entanglement to achieve secure, anonymous voting.<n>Our approach utilizes phase-flip encoding on entangled candidate states, where votes are recorded as controlled phase operations conditioned on voter identity registers.<n>The protocol ensures voter anonymity through quantum superposition, prevents double-voting through entanglement mechanisms, and can offer speedup potential for large-scale elections.
  arXiv  Detail & Related papers  (2025-10-17T02:14:54Z)
• MARS-Sep: Multimodal-Aligned Reinforced Sound Separation [72.85468563236005]
  MARS-Sep is a reinforcement learning framework for sound separation.<n>It learns a factorized Beta mask policy that is optimized by a clipped trust-region surrogate.<n>Experiments on multiple benchmarks demonstrate consistent gains in Text-, Audio-, and Image-Queried separation.
  arXiv  Detail & Related papers  (2025-10-12T09:05:28Z)
• A Quantum-Secure Voting Framework Using QKD, Dual-Key Symmetric Encryption, and Verifiable Receipts [0.4511923587827302]
  We introduce a quantum-secure voting framework that integrates Quantum Key Distribution (QKD), Dual-Key Symmetric Encryption, and verifiable receipt mechanisms.<n>The framework enables voters to establish encryption keys securely, cast encrypted ballots, and verify their votes through receipt-based confirmation.<n>Results demonstrate that the system can process large numbers of votes efficiently with low latency and minimal error rates.
  arXiv  Detail & Related papers  (2025-10-03T20:13:30Z)
• 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)
• NoVo: Norm Voting off Hallucinations with Attention Heads in Large Language Models [70.02816541347251]
  This paper presents a lightweight method, Norm Voting (NoVo), which harnesses the untapped potential of attention head norms to enhance factual accuracy. On TruthfulQA MC1, NoVo surpasses the current state-of-the-art and all previous methods by an astounding margin -- at least 19 accuracy points.
  arXiv  Detail & Related papers  (2024-10-11T16:40:03Z)
• Efficient Weighting Schemes for Auditing Instant-Runoff Voting Elections [57.67176250198289]
  AWAIRE involves adaptively weighted averages of test statistics, essentially "learning" an effective set of hypotheses to test. We explore schemes and settings more extensively, to identify and recommend efficient choices for practice. A limitation of the current AWAIRE implementation is its restriction to a small number of candidates.
  arXiv  Detail & Related papers  (2024-02-18T10:13:01Z)
• The #DNN-Verification Problem: Counting Unsafe Inputs for Deep Neural Networks [94.63547069706459]
  #DNN-Verification problem involves counting the number of input configurations of a DNN that result in a violation of a safety property. We propose a novel approach that returns the exact count of violations. We present experimental results on a set of safety-critical benchmarks.
  arXiv  Detail & Related papers  (2023-01-17T18:32:01Z)
• Anonymous voting scheme using quantum assisted blockchain [0.39146761527401425]
  We propose an anonymous voting scheme based on quantum assisted blockchain. The voting scheme is auditable and can be implemented using the currently available technology.
  arXiv  Detail & Related papers  (2022-06-07T11:07:28Z)
• 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)
• Quantum protocol for electronic voting without election authorities [3.4806267677524896]
  We present a quantum protocol that exploits an untrusted source of multipartite entanglement to carry out an election without relying on election authorities, simultaneous broadcasting or computational assumptions, and whose result is publicly verifiable. The level of security depends directly on the fidelity of the shared multipartite entangled quantum state, and the protocol can be readily implemented for a few voters with state-of-the-art photonic technology.
  arXiv  Detail & Related papers  (2021-07-30T15:43:48Z)
• Bribery as a Measure of Candidate Success: Complexity Results for Approval-Based Multiwinner Rules [58.8640284079665]
  We study the problem of bribery in multiwinner elections, for the case where the voters cast approval ballots (i.e., sets of candidates they approve) We consider a number of approval-based multiwinner rules (AV, SAV, GAV, RAV, approval-based Chamberlin--Courant, and PAV) In general, our problems tend to be easier when we limit out bribery actions on increasing the number of approvals of the candidate that we want to be in a winning committee.
  arXiv  Detail & Related papers  (2021-04-19T08:26:40Z)

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.