利用信任图连通性构建抗女巫攻击的数字社区
Building a Sybil-Resilient Digital Community Utilizing Trust-Graph Connectivity
AI总结：
本文提出利用身份信任图的电导或顶点扩张来限制女巫及腐败身份渗透，证明在相应假设下数字社区可安全无限增长，并将拜占庭比例控制在三分之一以下。
摘要：
防止虚假或重复的数字身份（即女巫，sybils）加入数字社区，可能对其生存至关重要，尤其是当社区在成员之间使用共识协议或采用民主治理时，因为女巫身份可能破坏共识、左右决策，甚至接管社区。本文探索使用身份信任图（其中边表示身份所有者之间的信任），使社区能够无限增长，同时不增加女巫的渗透程度。由于身份是基于现有数字社区成员对其的信任而被接纳进入数字社区的，可能信任女巫的腐败身份同样会对数字社区构成威胁。女巫及其腐败作恶者统称为拜占庭节点（byzantines），总体目标是限制它们对数字社区的渗透。我们提出实现这一目标的两种可选工具。第一种是图电导（graph conductance），它在诚实者厌恶腐败者并倾向于不信任他们的假设下有效。第二种是顶点扩张（vertex expansion），它依赖于社区中腐败身份数量不多的假设。尤其值得关注的是将拜占庭节点比例保持在三分之一以下，因为这将允许使用 Byzantine Agreement [15] 进行共识，以及实现抗女巫的社会选择 [19]。本文考虑增量增长的信任图，并表明在其关键假设和额外要求下——包括保持社区信任图的电导或顶点扩张足够高——社区可以安全地无限增长。
英文摘要：
Preventing fake or duplicate digital identities (aka sybils) from joining a digital community may be crucial to its survival, especially if it utilizes a consensus protocol among its members or employs democratic governance, where sybils can undermine consensus, tilt decisions, or even take over. Here, we explore the use of a trust-graph of identities, with edges representing trust among identity owners, to allow a community to grow indefinitely without increasing its sybil penetration. Since identities are admitted to the digital community based on their trust by existing digital community members, corrupt identities, which may trust sybils, also pose a threat to the digital community. Sybils and their corrupt perpetrators are together referred to as byzantines, and the overarching aim is to limit their penetration into a digital community. We propose two alternative tools to achieve this goal. One is graph conductance, which works under the assumption that honest people are averse to corrupt ones and tend to distrust them. The second is vertex expansion, which relies on the assumption that there are not too many corrupt identities in the community. Of particular interest is keeping the fraction of byzantines below one third, as it would allow the use of Byzantine Agreement [15] for consensus as well as for sybil-resilient social choice [19]. This paper considers incrementally growing a trust graph and shows that, under its key assumptions and additional requirements, including keeping the conductance or vertex expansion of the community trust graph sufficiently high, a community may grow safely, indefinitely.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
