Unsealing the secrets of blockchain consensus: A systematic comparison of the formal security of proof-of-work and proof-of-stake

• URL: http://arxiv.org/abs/2401.14527v2
• Date: Wed, 31 Jan 2024 09:24:07 GMT
• Title: Unsealing the secrets of blockchain consensus: A systematic comparison of the formal security of proof-of-work and proof-of-stake
• Authors: Iván Abellán Álvarez, Vincent Gramlich, Johannes Sedlmeir,
• Abstract summary: The choice of consensus mechanism is at the core of many controversial discussions. PoW-based consensus with the longest chain rule provides the strongest formal security guarantees. PoS can achieve similar guarantees when addressing its more pronounced tradeoff between safety and liveness.
• Score: 0.40964539027092917
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: With the increasing adoption of decentralized information systems based on a variety of permissionless blockchain networks, the choice of consensus mechanism is at the core of many controversial discussions. Ethereum's recent transition from (PoW) to proof-of-stake (PoS)-based consensus has further fueled the debate on which mechanism is more favorable. While the aspects of energy consumption and degree of (de-)centralization are often emphasized in the public discourse, seminal research has also shed light on the formal security aspects of both approaches individually. However, related work has not yet comprehensively structured the knowledge about the security properties of PoW and PoS. Rather, it has focused on in-depth analyses of specific protocols or high-level comparative reviews covering a broad range of consensus mechanisms. To fill this gap and unravel the commonalities and discrepancies between the formal security properties of PoW- and PoS-based consensus, we conduct a systematic literature review over 26 research articles. Our findings indicate that PoW-based consensus with the longest chain rule provides the strongest formal security guarantees. Nonetheless, PoS can achieve similar guarantees when addressing its more pronounced tradeoff between safety and liveness through hybrid approaches.

Related papers

• Decentralization in PoS Blockchain Consensus: Quantification and Advancement [10.679753825744964]
  This study quantifies the decentralization of consensus mechanisms in proof-of-stake (PoS) blockchains. We introduce two alternative weighting models for PoS consensus: Square Root Stake Weight (SRSW) and Logarithmic Stake Weight (LSW) Results demonstrate that SRSW and LSW models improve decentralization metrics by an average of 51% and 132%, respectively.
  arXiv  Detail & Related papers  (2025-04-19T16:33:30Z)
• From Data Behavior to Code Analysis: A Multimodal Study on Security and Privacy Challenges in Blockchain-Based DApp [1.6081378516701994]
  The recent proliferation of blockchain-based decentralized applications (DApp) has catalyzed transformative advancements in distributed systems. This study initiates with a systematic analysis of behavioral patterns derived from empirical DApp datasets. The principal security vulnerabilities in vulnerability-based smart contracts developed via Solidity are then critically examined.
  arXiv  Detail & Related papers  (2025-04-16T08:30:43Z)
• The future of secure communications: device independence in quantum key distribution [1.2145532233226684]
  Device-independent Quantum Key Distribution (DI-QKD) stands out for its unique approach to ensuring security. This review explores the pivotal role of nonclassicality and the challenges posed by various experimental loopholes for DI-QKD.
  arXiv  Detail & Related papers  (2025-04-08T18:00:32Z)
• Achieving Unanimous Consensus in Decision Making Using Multi-Agents [0.0]
  This paper introduces a novel deliberation-based consensus mechanism where Large Language Models (LLMs) act as rational agents engaging in structured discussions to reach a unanimous consensus. By leveraging graded consensus and a multi-round deliberation process, our approach ensures both unanimous consensus for definitive problems and graded confidence for prioritized decisions and policies. We also address key challenges with this novel approach such as degeneration of thoughts, hallucinations, malicious models and nodes, resource consumption, and scalability.
  arXiv  Detail & Related papers  (2025-04-02T21:02:54Z)
• A Fair and Lightweight Consensus Algorithm for IoT [0.0]
  This work introduces a fair and lightweight hybrid consensus algorithm tailored for IoT. The proposed approach minimizes resource demands on the nodes while ensuring a secure and fair agreement process. In addition, a reputation-based block voting mechanism is incorporated to enhance trust and establish finality.
  arXiv  Detail & Related papers  (2025-03-11T16:45:51Z)
• Discrete-modulated continuous-variable quantum key distribution secure against general attacks [0.0]
  This work presents a security analysis of DM-CV-QKD against general sequential attacks, including finite-size effects. Remarkably, our proof considers attacks that are neither independent nor identical, and makes no assumptions about the Hilbert space dimension of the receiver.
  arXiv  Detail & Related papers  (2024-09-04T11:50:18Z)
• Convergent Differential Privacy Analysis for General Federated Learning: the $f$-DP Perspective [57.35402286842029]
  Federated learning (FL) is an efficient collaborative training paradigm with a focus on local privacy. differential privacy (DP) is a classical approach to capture and ensure the reliability of private protections.
  arXiv  Detail & Related papers  (2024-08-28T08:22:21Z)
• A consolidated and accessible security proof for finite-size decoy-state quantum key distribution [0.0]
  We present an accessible and comprehensive security proof for the finite-size 1-decoy (and 2-decoy) BB84 protocol. This work can serve as a foundation for the discussion of QKD security and for the identification of potential vulnerabilities and device imperfections.
  arXiv  Detail & Related papers  (2024-05-26T14:13:33Z)
• A Novel Endorsement Protocol to Secure BFT-Based Consensus in Permissionless Blockchain [1.3723120574076126]
  BFT-based consensus mechanisms are widely adopted in the permissioned blockchain to meet the high scalability requirements of the network. Sybil attacks are one of the most potential threats when applying BFT-based consensus mechanisms in permissionless blockchain. This paper presents a novel endorsement-based bootstrapping protocol with a signature algorithm that offers a streamlined, scalable identity endorsement and verification process.
  arXiv  Detail & Related papers  (2024-05-04T03:00:33Z)
• 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)
• Quantum-Secure Certificate-Less Conditional Privacy-Preserving Authentication for VANET [4.8124555241328375]
  Existing lattice-based authentication schemes fall short of addressing the potential challenges of the leakage of the master secret key and key-escrow problem. This paper proposes the emphfirst quantum secure authentication scheme to eliminate the flaws while maintaining the system's overall efficiency intact.
  arXiv  Detail & Related papers  (2024-03-20T16:50:36Z)
• Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
  We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC) We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
  arXiv  Detail & Related papers  (2024-02-13T12:12:39Z)
• A Survey and Comparative Analysis of Security Properties of CAN Authentication Protocols [92.81385447582882]
  The Controller Area Network (CAN) bus leaves in-vehicle communications inherently non-secure. This paper reviews and compares the 15 most prominent authentication protocols for the CAN bus. We evaluate protocols based on essential operational criteria that contribute to ease of implementation.
  arXiv  Detail & Related papers  (2024-01-19T14:52:04Z)
• Consensus Algorithms of Distributed Ledger Technology -- A Comprehensive Analysis [0.0]
  This article provides a comprehensive analysis of the various consensus algorithms used in distributed ledger technologies (DLT) and blockchain networks. Eleven attributes including hardware requirements, pre-trust level, tolerance level, and more, were used to generate a series of comparison tables evaluating these consensus algorithms. We discuss the applicability of these consensus algorithms to various Cyber Physical System (CPS) use cases, including supply chain management, intelligent transportation systems, and smart healthcare.
  arXiv  Detail & Related papers  (2023-09-23T23:32:11Z)
• Practical quantum secure direct communication with squeezed states [55.41644538483948]
  We report the first table-top experimental demonstration of a CV-QSDC system and assess its security. This realization paves the way into future threat-less quantum metropolitan networks, compatible with coexisting advanced wavelength division multiplexing (WDM) systems.
  arXiv  Detail & Related papers  (2023-06-25T19:23:42Z)
• Single-Photon-Memory Measurement-Device-Independent Quantum Secure Direct Communication -- Part I: Its Fundamentals and Evolution [63.75763893884079]
  Quantum secure direct communication (QSDC) has attracted a lot of attention, which exploits deep-rooted quantum physical principles to guarantee unconditional security of communication in the face of eavesdropping. We first briefly review the fundamentals of QSDC, and then present its evolution, including its security proof, its performance improvement techniques, and practical implementation.
  arXiv  Detail & Related papers  (2023-04-19T02:26:25Z)

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.