发表机构
Shandong University of Science and Technology; Beijing University of Technology（山东科技大学; 北京工业大学）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
本文提出一种支持多选投票的自计票量子匿名投票协议，利用纠缠态分组与测量编码实现多选功能，并满足自计票、不可重用、可验证和公平性。
AI 中文摘要
自计票量子匿名投票（SQAV）自提出以来便引起了广泛关注。然而，受设计挑战的限制，所有现有协议仅支持单选投票，无法支持多选投票。在本文中，我们提出了一种具有多选投票功能的SQAV协议。在我们的协议中，$nm$个$n$粒子纠缠态被均分为$n$组，每个纠缠态中的$n$个粒子被分发给$n$位投票者，每位投票者获得一个粒子。每位投票者通过依次测量其属于$n$个不同组的所有粒子，获得$n$个投票向量，然后将其投票信息编码到与秘密索引对应的向量中。由于纠缠关联，每位投票者可以通过计算验证其选票是否正确，而任何参与者都可以通过计算获得每位候选人的得票数。我们的协议满足自计票、不可重用性、可验证性和公平性。
英文摘要
Self-tallying quantum anonymous voting (SQAV) has drawn considerable attention since it was proposed. However, constrained by design challenges, all existing protocols only accommodate single-selection voting and cannot support multi-selection voting. In this paper, we propose a SQAV protocol with multi-selection voting functionality. In our protocol, $nm$ $n$-particle entangled states are equally divided into $n$ groups, and the $n$ particles in each entangled state are delivered to $n$ voters, one particle per voter. Each voter obtains $n$ voting vectors by sequentially measuring all his (or her) particles that belong to $n$ different group, and then encodes his or her voting information into the vector corresponding to the secret index. Due to entanglement correlation, each voter can verify whether his or her ballot is correct through computation, while any participant can obtain the vote count for each candidate through computation. Our protocol satisfies self-tallying, nonreusability, verifiability, and fairness.
