论文标题

电子民主共识协议

A Consensus Protocol for e-Democracy

论文作者

Poupko, Ouri, Talmon, Nimrod

论文摘要

鉴于工作证明(POW)和验证证明(POS)是庞大的,而其他共同的共识协议主要基于许可,因此我们寻找一种共识协议,该协议适合电子民主的需求。特别是,我们需要的是一个分布式分类帐,它将记录并在可能的范围内执行公众意志。我们建议将任何给定权限的协议以及节点之间的信任图组合在一起,该节点为新节点提供所需的许可。结果,共识协议在已知代理列表之间的每一个迭代中达成共识,然后在迭代之间更新此列表。本文基于先前的工作,该工作表明社区可以在维持有限数量的拜占庭人的情况下增长的条件。它将基于许可的共识协议(例如PBFT)与社区扩展算法(例如先前工作中的一个)结合在一起,以达到共识协议,其中一组代理可以在sybil-comilient的同时随时间变化。

Given that Proof-of-Work (PoW) and Proof-of-Stake (PoS) are plutocratic, and other common consensus protocols are mostly permission-based, we look for a consensus protocol that will suit the needs of e-Democracy. In particular, what we need is a distributed ledger that will record and, to the possible extent, execute the public will. We propose a combination of any given permission-based protocol together with a trust graph between the nodes, which supplies the required permission for new nodes. As a result, the consensus protocol reaches consensus at every iteration between a known list of agents and then updates this list between iterations. This paper is based on prior work that shows the conditions under which a community can grow while maintaining a bounded number of byzantines. It combines a permission-based consensus protocol (such as pBFT) with a community expansion algorithm (such as the one in the prior work) to arrive at a consensus protocol in which the set of agents can change in time, while being sybil-resilient.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源