How Hard is Takeover in DPoS Blockchains? Understanding the Security of Coin-based Voting Governance

• URL: http://arxiv.org/abs/2310.18596v1
• Date: Sat, 28 Oct 2023 05:22:54 GMT
• Title: How Hard is Takeover in DPoS Blockchains? Understanding the Security of Coin-based Voting Governance
• Authors: Chao Li, Balaji Palanisamy, Runhua Xu, Li Duan, Jiqiang Liu, Wei Wang,
• Abstract summary: Delegated-Proof-of-Stake (DPoS) blockchains are governed by a committee of block producers elected via a coin-based voting system. This paper presents the first large-scale empirical study of the passive takeover resistance of EOSIO, Steem and TRON.
• Score: 10.452241620239814
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Delegated-Proof-of-Stake (DPoS) blockchains, such as EOSIO, Steem and TRON, are governed by a committee of block producers elected via a coin-based voting system. We recently witnessed the first de facto blockchain takeover that happened between Steem and TRON. Within one hour of this incident, TRON founder took over the entire Steem committee, forcing the original Steem community to leave the blockchain that they maintained for years. This is a historical event in the evolution of blockchains and Web 3.0. Despite its significant disruptive impact, little is known about how vulnerable DPoS blockchains are in general to takeovers and the ways in which we can improve their resistance to takeovers. In this paper, we demonstrate that the resistance of a DPoS blockchain to takeovers is governed by both the theoretical design and the actual use of its underlying coin-based voting governance system. When voters actively cooperate to resist potential takeovers, our theoretical analysis reveals that the current active resistance of DPoS blockchains is far below the theoretical upper bound. However in practice, voter preferences could be significantly different. This paper presents the first large-scale empirical study of the passive takeover resistance of EOSIO, Steem and TRON. Our study identifies the diversity in voter preferences and characterizes the impact of this diversity on takeover resistance. Through both theoretical and empirical analyses, our study provides novel insights into the security of coin-based voting governance and suggests potential ways to improve the takeover resistance of any blockchain that implements this governance model.

Related papers

• Breaking the Balance of Power: Commitment Attacks on Ethereum's Reward Mechanism [4.524180577541776]
  We show a series of commitment attacks on LMD GHOST, a core part of the consensus mechanism. These attacks disrupt the intended balance of power between proposers and voters. We introduce a novel reward mechanism that restores the voters' role as a check against proposer power.
  arXiv  Detail & Related papers  (2024-07-28T12:17:17Z)
• The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
  We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols. Existing approaches for threshold cryptosystems introduce a latency overhead of at least one message delay for running the threshold cryptographic protocol. We propose a mechanism to eliminate this overhead for blockchain-native threshold cryptosystems with tight thresholds.
  arXiv  Detail & Related papers  (2024-07-16T20:53:04Z)
• On Fairness Concerns in the Blockchain Ecosystem [0.0]
  We audit the Bitcoin and blockchains to investigate the norms followed by miners in determining the transaction prioritization. Our findings have significant implications for future developments of blockchains and decentralized applications.
  arXiv  Detail & Related papers  (2024-05-29T08:35:37Z)
• Enhancing Trust and Privacy in Distributed Networks: A Comprehensive Survey on Blockchain-based Federated Learning [51.13534069758711]
  Decentralized approaches like blockchain offer a compelling solution by implementing a consensus mechanism among multiple entities. Federated Learning (FL) enables participants to collaboratively train models while safeguarding data privacy. This paper investigates the synergy between blockchain's security features and FL's privacy-preserving model training capabilities.
  arXiv  Detail & Related papers  (2024-03-28T07:08:26Z)
• Generative AI-enabled Blockchain Networks: Fundamentals, Applications, and Case Study [73.87110604150315]
  Generative Artificial Intelligence (GAI) has emerged as a promising solution to address challenges of blockchain technology. In this paper, we first introduce GAI techniques, outline their applications, and discuss existing solutions for integrating GAI into blockchains.
  arXiv  Detail & Related papers  (2024-01-28T10:46:17Z)
• Liquid Democracy in DPoS Blockchains [4.42985313903391]
  Liquid democracy, also known as delegative voting, allows voters to vote directly or delegate their voting power to others. This paper explores the practical implementation of liquid democracy in Delegated-Proof-of-Stake (DPoS) blockchain systems.
  arXiv  Detail & Related papers  (2023-09-03T06:04:11Z)
• Unpacking How Decentralized Autonomous Organizations (DAOs) Work in Practice [54.47385318258732]
  Decentralized Autonomous Organizations (DAOs) have emerged as a novel way to coordinate a group of entities towards a shared vision. In just a few years, over 4,000 DAOs have been launched in various domains, such as investment, education, health, and research. Despite such rapid growth and diversity, it is unclear how theses actually work in practice and to what extent they are effective in achieving their goals.
  arXiv  Detail & Related papers  (2023-04-17T01:30:03Z)
• SoK: Blockchain Governance [13.95507600720467]
  The topic of blockchain governance is a fertile domain for a thorough systematization. We start by distilling a comprehensive array of properties for sound governance systems. While all properties are satisfied, even partially, by at least one system, no system that most of them.
  arXiv  Detail & Related papers  (2022-01-18T18:38:26Z)
• Quantum-resistance in blockchain networks [46.63333997460008]
  This paper describes the work carried out by the Inter-American Development Bank, the IDB Lab, LACChain, Quantum Computing (CQC), and Tecnologico de Monterrey to identify and eliminate quantum threats in blockchain networks. The advent of quantum computing threatens internet protocols and blockchain networks because they utilize non-quantum resistant cryptographic algorithms.
  arXiv  Detail & Related papers  (2021-06-11T23:39:25Z)
• Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security [67.06003361150228]
  A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task. In this work, we examine the hardness of finding such chain of PoWs against quantum strategies. We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
  arXiv  Detail & Related papers  (2020-12-30T18:03:56Z)
• Zero-Knowledge Proof-of-Identity: Sybil-Resistant, Anonymous Authentication on Permissionless Blockchains and Incentive Compatible, Strictly Dominant Cryptocurrencies [0.0]
  Zero-Knowledge Proof-of-Identity from trusted public certificates (e.g., national identity cards and/or ePassports; eSIM) is introduced here to permissionless blockchains. The proposed solution effectively limits the number of mining nodes a single individual would be able to run while keeping membership open to everyone.
  arXiv  Detail & Related papers  (2019-05-22T12:06:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.