可验证安全的比例委员会选举规则
A verifiably secure and proportional committee election rule
摘要：
在基于批准的委员会选举中，比例代表制的属性在社会选择文献中已经出现了一个多世纪，通常被理解为避免少数民族代表不足。然而，我们认为，一些分布式系统的安全性是直接联系到相反的目标，避免任何少数民族的代表性过高，一个目标，以前没有正式的，导致我们的优化目标称为最大最小支持。在对这一目标的计算复杂性进行了深入分析之后，我们提出了一种新的有效的选举规则，该规则同时实现了a）恒定因子近似保证，以及b）比例合理代表制（PJR）的属性-比例代表制的最强形式之一。然而，新规则最显著的特点是，人们可以在线性时间内验证获胜的委员会是否满足上述两个保证，即使算法是由只传达输出的不可信方执行的。因此，该规则可以适用于一个可验证的计算方案。此外，它的验证过程很容易承认并行处理，以进一步提高效率。我们的工作是由区块链网络上的一个应用程序驱动的，该应用程序实现了提名权益证明，社区选举一个验证者委员会参与共识协议，防止过度代表性保护网络免受敌对少数的攻击。我们的选举规则使验证者选择协议具有对安全性和比例性的正式保证，并且考虑到区块链架构的计算有限性，其作为具有并行验证的可验证计算方案的适应性被证明是其成功实现的关键。
英文摘要：
The property of proportional representation in approval-based committee elections has appeared in the social choice literature for over a century, and is typically understood as avoiding the underrepresentation of minorities. However, we argue that the security of some distributed systems is directly linked to the opposite goal of avoiding the overrepresentation of any minority, a goal not previously formalized that leads us to an optimization objective known as maximin support. After providing a thorough analysis of the computational complexity of this objective, we propose a new efficient election rule that simultaneously achieves a) a constant-factor approximation guarantee for it, and b) the property of proportional justified representation (PJR) - one of the strongest forms of proportional representation. However, the most striking feature of the new rule is that one can verify in linear time that the winning committee satisfies the two aforementioned guarantees, even when the algorithm is executed by an untrusted party who only communicates the output. As a result, the rule can be adapted into a verifiable computing scheme. Moreover, its verification procedure easily admits parallel processing for further efficiency. Our work is motivated by an application on blockchain networks that implement Nominated Proof-of-Stake, where the community elects a committee of validators to participate in the consensus protocol, and where preventing overrepresentation protects the network against attacks by an adversarial minority. Our election rule enables a validator selection protocol with formal guarantees on security and proportionality, and its adaptation as a verifiable computing scheme with a parallelized verification proves to be key for its successful implementation given the computationally limited nature of the blockchain architecture.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
