当前位置: X-MOL 学术Pervasive Mob. Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
ReCon: Sybil-resistant consensus from reputation
Pervasive and Mobile Computing ( IF 3.0 ) Pub Date : 2019-12-05 , DOI: 10.1016/j.pmcj.2019.101109
Alex Biryukov , Daniel Feher

In this paper we describe how to couple reputation systems with distributed consensus protocols to provide a scalable permissionless consensus protocol with a low barrier of entry, while still providing strong resistance against Sybil attacks for large peer-to-peer networks of untrusted validators.

We introduce reputation module ReCon, which can be laid on top of various consensus protocols such as PBFT or HoneyBadger. The protocol takes external reputation ranking as input and then ranks nodes based on the outcomes of consensus rounds run by a small committee, and adaptively selects the committee based on the current reputation. ReCon can tolerate larger threshold of malicious nodes (up to slightly above 1/2) compared to the 1/3 limit of BFT consensus algorithms.



中文翻译:

ReCon:来自声誉的抗Sybil共识

在本文中,我们描述了如何将信誉系统与分布式共识协议耦合在一起,以提供一种具有低进入门槛的可扩展的无许可共识协议,同时仍然为不受信任的验证者的大型对等网络提供强大的Sybil攻击抵抗能力。

我们引入信誉模块ReCon,该模块可以放在各种共识协议之上,例如PBFT或HoneyBadger。该协议将外部信誉排名作为输入,然后根据由小型委员会进行的共识轮次的结果对节点进行排名,然后根据当前信誉来自适应地选择委员会。与BFT共识算法的1/3限制相比,ReCon可以容忍更大的恶意节点阈值(最高略高于1/2)。

更新日期:2019-12-05
down
wechat
bug