Corpus ID: 10883061

SCP: A Computationally-Scalable Byzantine Consensus Protocol For Blockchains

@article{Luu2015SCPAC,
  title={SCP: A Computationally-Scalable Byzantine Consensus Protocol For Blockchains},
  author={Loi Luu and Viswesh Narayanan and Kunal Baweja and Chaodong Zheng and Seth Gilbert and P. Saxena},
  journal={IACR Cryptol. ePrint Arch.},
  year={2015},
  volume={2015},
  pages={1168}
}
In this paper, we design a new blockchain Byzantine consensus protocol SCP where the throughput scales nearly linearly with the computation: the more computing power available, the more blocks selected per unit time. [...] Key Method We further design a mechanism to allow reaching consensus on blocks without broadcasting actual block data, while still enabling efficient block verification. We prove that our protocol is secure, efficient and applicable to several case studies. We conduct scalability experiments…Expand
2 Implicit Consensus : Blockchain with Unbounded Throughput 1 . 1 Problem Statement
TLDR
This paper proposes a novel consensus model, namely the implicit consensus, with a distinctive blockchain-based distributed ledger in which each node holds its individual blockchain, and achieves unbounded throughput which is by far the best throughput achieved by any blockchain technique. Expand
A Survey of Distributed Consensus Protocols for Blockchain Networks
TLDR
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. Expand
Implicit Consensus: Blockchain with Unbounded Throughput
TLDR
This paper proposes a novel consensus model, namely the implicit consensus, with a distinctive blockchain-based distributed ledger in which each node holds its individual blockchain in which the consensus is not on the transactions, but on a special type of blocks called Check Points that are used to validate individual transactions. Expand
Evaluation and Comparison of Blockchain Consensus Algorithms
While the public catched the interest in blockchains through cryptocurrencies like Bitcoin, the technology behind these currencies emerged to a general field of research around secure, decentralizedExpand
Microchain: A Hybrid Consensus Mechanism for Lightweight Distributed Ledger for IoT
TLDR
The experimental results verify that the Micorchain is able to offer a partially decentralized, scalable and lightweight distributed ledger protocol for IoT applications. Expand
GEEC: Scalable, Efficient, and Consistent Consensus for Blockchains
TLDR
GEEC, a inital blockchain protocol and its runtime system by leveraging the Intel Software Guard eXtentions (SGX) hardware, achieves privacy and security for permissioned blockchains and leveraging Intel SGX. Expand
EPBC: Efficient Public Blockchain Client for lightweight users
TLDR
EPBC, a novel and efficient transaction verification scheme for public ledgers, which only requires lightweight users to store a small amount of data that is independent of the size of the blockchain, is proposed. Expand
UTXOs as a Proof of Membership for Byzantine Agreement Based Cryptocurrencies
  • E. Anceaume, Antoine Guellier, Romaric Ludinard
  • Computer Science
  • 2018 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData)
  • 2018
TLDR
A solution that combines the best features of optimistic and pessimistic approaches is presented: the presence of Unspent Transaction Output (UTXO)owners and “the public-key as identities” principle to make UTXO owners self-organize in small Byzantine resilient committees “around” each new object (i.e., blocks and transactions) to decide on their validity. Expand
Scalable Dynamic Multi-Agent Practical Byzantine Fault-Tolerant Consensus in Permissioned Blockchain
The permissioned blockchain system has recently become popular in a wide range of scenarios, such as artificial intelligence, financial applications and the Internet of things, due to its dominanceExpand
Protecting Early Stage Proof-of-Work Based Public Blockchain
TLDR
This work proposes a new hybrid blockchain construction scheme that uses the combination of proof-of-work and the stake, which is the number of coins produced by a miner, to determine whether this miner is allowed to construct a block, and proves that stakes play an important role in the hybrid scheme at the beginning. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 51 REFERENCES
Notes on Scalable Blockchain Protocols (version 0.3.2)
TLDR
A technique for achieving scalable blockchain consensus by means of a “sample-and-fallback” game that can be applied to any underlying blockchain consensus algorithm and almost any state transition function, provided that state changes are sufficiently “localized”. Expand
Bitcoin-NG: A Scalable Blockchain Protocol
TLDR
This paper implements Bitcoin-NG, a new blockchain protocol designed to scale, which is Byzantine fault tolerant, is robust to extreme churn, and shares the same trust model obviating qualitative changes to the ecosystem. Expand
Demystifying Incentives in the Consensus Computer
TLDR
This work calls the framework of computation through a scriptable cryptocurrency a consensus computer and develops a model that captures incentives for verifying computation in it and proposes a resolution to the verifier's dilemma which incentivizes correct execution of certain applications, including outsourced computation, where scripts require minimal time to verify. Expand
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
TLDR
A synchronous algorithm which uses polylogarithmic time and O(√n) bits of communication per processor to bring all processors to agreement on a collection of n good quorums, solving Byzantine agreement as well. Expand
Enabling Blockchain Innovations with Pegged Sidechains
Since the introduction of Bitcoin[Nak09] in 2009, and the multiple computer science and electronic cash innovations it brought, there has been great interest in the potential of decentralisedExpand
Towards Secure and Scalable Computation in Peer-to-Peer Networks
TLDR
This work designs the first scalable protocols for Byzantine agreement and leader election, where a constant fraction b < 1/3 of processors are controlled by a malicious adversary, for a network whose degree is polylogarithmic in its size. Expand
Breaking the O(n2) bit barrier: scalable byzantine agreement with an adaptive adversary
TLDR
To the best of the knowledge, this work is the first algorithm to solve Byzantine agreement against an adaptive adversary, while requiring o(n2) total bits of communication, which is polylogarithmic in n. Expand
The Bitcoin Backbone Protocol: Analysis and Applications
TLDR
This work extracts and analyzes the core of the Bitcoin protocol, which is term the Bitcoin backbone, and proves two of its fundamental properties which are called common prefix and chain quality in the static setting where the number of players remains fixed. Expand
Fast distributed agreement (preliminary version)
TLDR
A non-authenticated Byzantine Generals algorithm, with early stopping, for systems with arbitrary process failures, is described, which is as efficient as previously proposed algorithms that do not exhibit the early-stopping property. Expand
From Almost Everywhere to Everywhere: Byzantine Agreement with Õ(n3/2) Bits
TLDR
A polylogarithmic time algorithm to agree on a small representative committee of processors using only O(n 3/2 ) total bits which succeeds with high probability which can then be used to efficiently solve Byzantine agreement, leader election, or other problems. Expand
...
1
2
3
4
5
...