Resilient Consensus Sustained Collaboratively

• URL: http://arxiv.org/abs/2302.02325v5
• Date: Fri, 19 Jul 2024 02:29:07 GMT
• Title: Resilient Consensus Sustained Collaboratively
• Authors: Junchao Chen, Suyash Gupta, Alberto Sonnino, Lefteris Kokoris-Kogias, Mohammad Sadoghi,
• Abstract summary: We present the design of our Power-of-Collaboration protocol, which guards existing PoS/BFT blockchains against long-range attacks. PoC guarantees fairness and accountability and only marginally degrades the throughput of the underlying system.
• Score: 6.090550359575682
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Decentralized systems built around blockchain technology promise clients an immutable ledger. They add a transaction to the ledger after it undergoes consensus among the replicas that run a Proof-of-Stake (PoS) or Byzantine Fault-Tolerant (BFT) consensus protocol. Unfortunately, these protocols face a long-range attack where an adversary having access to the private keys of the replicas can rewrite the ledger. One solution is forcing each committed block from these protocols to undergo another consensus, Proof-of-Work(PoW) consensus; PoW protocol leads to wastage of computational resources as miners compete to solve complex puzzles. In this paper, we present the design of our Power-of-Collaboration (PoC) protocol, which guards existing PoS/BFT blockchains against long-range attacks and requires miners to collaborate rather than compete. PoC guarantees fairness and accountability and only marginally degrades the throughput of the underlying system.

Related papers

• A Study on Asynchronous Vote-based Blockchains [4.79997217554732]
  Vote-based blockchains use Byzantine Fault Tolerance consensus protocols to transition from one state to another. This paper proposes a emphvalidated strong BFT consensus model that allows leader-based coordination in asynchronous settings. Our protocol greatly reduces message complexity and is the first one to achieve linear view changes without relying on threshold signatures.
  arXiv  Detail & Related papers  (2024-09-12T15:54:40Z)
• Generative Blockchain: Transforming Blockchain from Transaction Recording to Transaction Generation through Proof-of-Merit [5.801684954657074]
  generative blockchain aims to transform conventional blockchain technology by combining transaction generation and recording. Central to our design is a novel consensus mechanism, Proof-of-Merit (PoM) We demonstrate PoM on a ride service on-demand platform, where the task of solving complex transaction-generating problems is delegated to a pool of independent problem solvers.
  arXiv  Detail & Related papers  (2024-08-23T20:51:10Z)
• Securing Proof of Stake Blockchains: Leveraging Multi-Agent Reinforcement Learning for Detecting and Mitigating Malicious Nodes [0.2982610402087727]
  MRL-PoS+ is a novel consensus algorithm to enhance the security of PoS blockchains. We show that MRL-PoS+ significantly improves the attack resilience of PoS blockchains.
  arXiv  Detail & Related papers  (2024-07-30T17:18:03Z)
• 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)
• Flashback: Enhancing Proposer-Builder Design with Future-Block Auctions in Proof-of-Stake Ethereum [27.386337024680245]
  Auction mechanisms used between searchers, builders and proposers are crucial to the overall health of the blockchain. In this paper, we consider PBS design in as a game between searchers, builders and proposers. A key novelty in our design is the inclusion of future block proposers, as all proposers of an epoch are decided ahead of time in proof-of-stake (PoS) Our analysis shows the existence of alternative auction mechanisms that result in a better equilibrium to players compared to state-of-the-art.
  arXiv  Detail & Related papers  (2024-05-15T15:58:21Z)
• Sequencer Level Security [2.756899615600916]
  We introduce the Sequencer Level Security (SLS) protocol, an enhancement to sequencing protocols of rollups. We describe the mechanics of the protocol for both the transactions submitted to the rollup mempool, as well as transactions originating from Layer one. We implement a prototype of the SLS protocol, Zircuit, which is built on top of Geth and the OP stack.
  arXiv  Detail & Related papers  (2024-05-03T02:47:40Z)
• 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)
• A Two-Layer Blockchain Sharding Protocol Leveraging Safety and Liveness for Enhanced Performance [5.344231997803284]
  Existing protocols overlook diverse adversarial attacks, limiting transaction throughput. This paper presents Reticulum, a groundbreaking sharding protocol addressing this issue. It comprises "control" and "process" shards in two layers.
  arXiv  Detail & Related papers  (2023-10-17T16:15:28Z)
• ACon$^2$: Adaptive Conformal Consensus for Provable Blockchain Oracles [31.439376852065713]
  Power of smart contracts is enabled by interacting with off-chain data, which in turn opens the possibility to undermine the block state consistency. We propose an adaptive conformal consensus (ACon$2$) algorithm, which derives consensus from multiple oracle contracts. In particular, the proposed algorithm returns a consensus set, which quantifies the uncertainty of data and achieves a desired correctness guarantee.
  arXiv  Detail & Related papers  (2022-11-17T04:37:24Z)
• 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)

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.