Analysis of the Blockchain Protocol in Asynchronous Networks

By Rafael Pass, Lior Seeman, Abhi Shelat. International Conference on the Theory and Application of Cryptographic Techniques, 2017

734 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications, Information Systems

View Paper: https://www.semanticscholar.org/paper/161c24b98ce3af2c0f8a5e96d5055a367b81801e

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computer Networks and Communications

In Information Systems

Citations in the corpus

A Survey on Consensus Mechanisms and Mining Strategy Management in Blockchain Networks (2018, methodology): “With such a consideration in mind, a theoretical study is provided in [89] between the upper bound of the information latency and the persistence of the block data in a node’s local view of the blockchain.”
Hybrid Consensus: Efficient Consensus in the Permissionless Model (2016, methodology): “For any constants η0, η1, η2, η, ρ > 0, let Q = 1− (1+η0) q γ , let G = γ/(1+η1), let G ′ = (1+η2)nρ, the Nakamoto consensus protocol [46,47] (henceforth referred to as snailchain) parametrized with mining difficulty parameter ρ satisfies ηλconsistency, (ηλ,Q)-chain quality, and (ηλ,G,G′)-chain grow”
Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol (2017, background): “In [13,22] it was shown that persistence and liveness can be derived from the following three elementary properties provided that protocol Π derives the ledger from a data structure in the form of a blockchain.”
Ouroboros Genesis: Composable Proof-of-Stake Blockchains with Dynamic Availability (2018, methodology): “As shown in [4], assuming the honest parties are strongly connected, this setup can realize the multicast network with eventual delivery [18, 25, 33].”
On Security Analysis of Proof-of-Elapsed-Time (PoET) (2017, positive): “[26] further verified these security features.”
Redactable Blockchain – or – Rewriting History in Bitcoin and Friends (2017, background): “Blockchain based technologies, and the properties they achieve, were also studied in recent work, both for the synchronous [27] and asynchronous [42] network model.”
Towards Scaling Blockchain Systems via Sharding (2018, background): “However, this threshold drops quickly in a partially synchronous network, going below 33% when the latency is equal to the block time [43].”
Tesseract: Real-Time Cryptocurrency Exchange using Trusted Hardware (2017, background): “Bitcoin [63, 35, 67] and similar cryptocurrencies derive their security from two assumptions:”
Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain (2018, methodology): “In [KP15,PSS17] it was shown that persistence and liveness can be derived from the following three elementary properties provided that protocol Π derives the ledger from a data structure in the form of a blockchain.”
REM: Resource-Efficient Mining for Blockchains (2017, background): “Despite their imperfections [26, 35, 37, 65, 71], blockchains [38, 64, 67] have attracted the interest of the ﬁnancial and technology industries [16, 25, 34, 47, 69, 74] as a way to build a transaction systems with distributed trust.”
SPECTRE: A Fast and Scalable Cryptocurrency Protocol (2016, background): “Unfortunately, recent research has shown that the Nakamoto consensus has severe scalability limitations [3, 19, 7, 15].”
From blockchain consensus back to Byzantine consensus (2017, background): “extended the analysis for when the bound on message delivery is unknown and showed in their model that the difficulty of Bitcoin’s crypto-difficulty has to be adapted depending on the bound on the communication delays [38].”
OmniLedger: A Secure, Scale-Out, Decentralized Ledger via Sharding (2018, background): “, that if an honest validator broadcasts a message, then all honest validators receive the message within a known maximum delay ∆ [39].”