• Corpus ID: 5703513

Blockchain Consensus Protocols in the Wild

  title={Blockchain Consensus Protocols in the Wild},
  author={Christian Cachin and Marko Vukolic},
A blockchain is a distributed ledger for recording transactions, maintained by many nodes without central authority through a distributed cryptographic protocol. All nodes validate the information to be appended to the blockchain, and a consensus protocol ensures that the nodes agree on a unique order in which entries are appended. Consensus protocols for tolerating Byzantine faults have received renewed attention because they also address blockchain systems. This work discusses the process of… 

Tables from this paper

SoK: Sharding on Blockchain

A systematic and comprehensive review on blockchain sharding techniques and a general design flow of sharding protocols is presented and key design challenges are discussed and analyzed and the techniques in state-of-the-art solutions are analyzed.

Blockchain and Trusted Computing: Problems, Pitfalls, and a Solution for Hyperledger Fabric

This work introduces an architecture and a prototype for smart-contract execution within Intel SGX technology for Hyperledger Fabric and prevents rollback attacks on TEE-based execution as far as possible, and resolves difficulties posed by the execute-order-validate architecture of Fabric.

Consensus in the Age of Blockchains

A systematic and comprehensive study of blockchain consensus protocols is conducted, developing a framework to evaluate their performance, security and design properties, and using it to systematize key themes in the protocol categories described above.

A Survey of Distributed Consensus Protocols for Blockchain Networks

This survey will provide blockchain developers and researchers a comprehensive view on the state-of-the-art consensus protocols and facilitate the process of designing future protocols.

Blockchain Consensus Algorithm Design Based on Consistent Hash Algorithm

  • Jian YangHong Shen
  • Computer Science, Mathematics
    2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)
  • 2019
A new consensus algorithm in permissioned blockchain based on consistent hashing based on pseudo-randomness of the hash operation is presented, which is applicable to blockchain systems containing Byzantine nodes and has a high throughput, low delay and many other advantages.

Assessing Security and Performances of Consensus algorithms for Permissioned Blockchains

This work has shown that the lack of adequate analysis on these algorithms hinders any cautious evaluation of their effectiveness in a real-world setting where systems are deployed over trustless networks, i.e. Internet ...

Evaluating Blockchain Systems: A Comprehensive Study of Security and Dependability Attributes

This work refers to the well-established concepts of security and dependability, broadly used in distributed systems, to identify the most relevant properties for blockchains and uses such properties to evaluate five of the most prominent, platforms, such as three permissionless blockchains, and two permissioned blockchains -Ethereum-private and Hyperledger Fabric.

SoK : Consensus in the Age of Blockchains Shehar Bano

This survey highlights the various building blocks of blockchain consensus design, along with a discussion on their security and performance properties, and identifies research gaps and insights for the community to consider in future research endeavours.



Architecture of the Hyperledger Blockchain Fabric

A report of Swanson compares the two models of blockchains, where anyone can operate a node and participate through spending CPU cycles and demonstrating a “proof-of-work” in the “permissioned” model.

Rethinking Permissioned Blockchains

These limitations in the context of permissioned blockchains, including an early version of the Hyperledger Fabric blockchain platform, are discussed, and how a re-design of HyperLedger Fabric's architecture addresses them are discussed.

Tendermint: Byzantine Fault Tolerance in the Age of Blockchains

Tendermint modernizes classic academic work on the subject to provide a secure consensus protocol with accountability guarantees, as well as an interface for building arbitrary applications above the consensus.

Inclusive Block Chain Protocols

The mechanics of the block chain and block propagation are constrained: if blocks are created at a high rate compared to their propagation time in the network, many conflicting blocks arecreated and performance suffers greatly, and transactions take long to securely confirm, and their throughput is greatly limited.

Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography

A new protocol for Byzantine agreement in a completely asynchronous network is presented that makes use of new cryptographic protocols, specifically protocols for threshold signatures and coin-tossing based on the Diffie-Hellman problem.

The Stellar Consensus Protocol : A Federated Model for Internet-level Consensus

A new model for consensus called federated Byzantine agreement (FBA), which achieves robustness through quorum slices—individual trust decisions made by each node that together determine system-level quorums.

Distributing trust on the Internet

  • C. Cachin
  • Computer Science
    2001 International Conference on Dependable Systems and Networks
  • 2001
This paper describes an architecture for secure and fault-tolerant service replication in an asynchronous network such as the Internet, where a malicious adversary may corrupt some servers and

Bitcoin: A Peer-to-Peer Electronic Cash System

This work proposes a solution to the double-spending problem using a peer-to-peer network, where the network timestamps transactions by hashing them into an ongoing chain of hash-based proof-of-work, forming a record that cannot be changed without redoing the proof- of-work.

Secure INtrusion-Tolerant Replication on the Internet

  • C. CachinJ. Poritz
  • Computer Science
    Proceedings International Conference on Dependable Systems and Networks
  • 2002
The implementation of SINTRA in Java is described and timing measurements are given for a test-bed of servers distributed over three continents, showing that extensive use of public-key cryptography does not impose a large overhead for secure coordination in wide-area networks.

Asynchronous Byzantine Agreement Protocols