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.

翻译：投票是一种基本的民主活动，选民通过投票选择代表或批准政策。传统的纸质选票选举存在若干缺陷，可能损害投票过程的公平性、有效性和可访问性。因此，设计更安全、有效且易于访问的替代方案的需求日益增长。电子投票正是利用数字工具简化投票的解决方案之一。现有最先进的安全电子投票方案基于数论困难性假设。由于Shor算法等量子算法的出现，这些方案已不再安全。为解决这一问题，我们首次提出并分析了一种基于多元多项式的后量子安全端到端可验证电子投票协议。该方案的安全性依赖于MQ问题的困难性，这是一个NP难问题。我们提出了一种简洁高效的设计方案，仅使用标准密码学原语作为构建模块。