Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Social and Information Networks

arXiv:2007.15949 (cs)
[Submitted on 31 Jul 2020]

Title:A Consensus Protocol for e-Democracy

Authors:Ouri Poupko, Nimrod Talmon
View PDF
Abstract: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.
Comments: 14 pages, 1 figure
Subjects: Social and Information Networks (cs.SI)
Cite as: arXiv:2007.15949 [cs.SI]
  (or arXiv:2007.15949v1 [cs.SI] for this version)
  https://doi.org/10.48550/arXiv.2007.15949

Submission history

From: Ouri Poupko [view email]
[v1] Fri, 31 Jul 2020 10:31:28 UTC (91 KB)
Full-text links:

Access Paper:

license icon view license
Current browse context:
cs.SI
< prev   |   next >
new | recent | 2020-07
Change to browse by:
cs

References & Citations

DBLP - CS Bibliography

listing | bibtex
Ouri Poupko
Nimrod Talmon
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)