论文标题
投票争议解决
Dispute Resolution in Voting
论文作者
论文摘要
在投票时，当选民声称投票权是不诚实的，并且在当局声称遵守该协议的同时未正确处理他的投票时，出现争议。如果任何第三方能够明确确定谁是对的，则可以解决争议。我们系统地描述了一项通用，实际相关的投票协议的所有相关争议。根据我们的特征，我们提出了针对投票的争议解决的新定义，以说明选民和投票机构都可以提出虚假索赔，并且选民可以弃权投票。 我们工作的一个主要方面是及时性：选民应在不迟于选举结束时拥有解决争议所需的证据。我们表征了哪些假设在我们的投票协议类别的通信拓扑上是必要的，足以及时。我们象征性地将争议解决属性和通信拓扑形式化。这为验证广泛协议的争议解决方案提供了基础。为了证明我们的模型的实用性，我们分析了基于混合网的投票协议，并证明它可以满足争议解决方案，以及可验证性和收据。为了证明我们的主张，我们将机器检查的证明与传统的笔和纸证明相结合。
In voting, disputes arise when a voter claims that the voting authority is dishonest and did not correctly process his ballot while the authority claims to have followed the protocol. A dispute can be resolved if any third party can unambiguously determine who is right. We systematically characterize all relevant disputes for a generic, practically relevant, class of voting protocols. Based on our characterization, we propose a new definition of dispute resolution for voting that accounts for the possibility that both voters and the voting authority can make false claims and that voters may abstain from voting. A central aspect of our work is timeliness: a voter should possess the evidence required to resolve disputes no later than the election's end. We characterize what assumptions are necessary and sufficient for timeliness in terms of a communication topology for our voting protocol class. We formalize the dispute resolution properties and communication topologies symbolically. This provides the basis for verification of dispute resolution for a broad class of protocols. To demonstrate the utility of our model, we analyze a mixnet-based voting protocol and prove that it satisfies dispute resolution as well as verifiability and receipt-freeness. To prove our claims, we combine machine-checked proofs with traditional pen-and-paper proofs.
