The bitcoin backbone protocol: Analysis and applications
Bitcoin is the first and most popular decentralized cryptocurrency to date. In this work, we
extract and analyze the core of the Bitcoin protocol, which we term the Bitcoin backbone …
extract and analyze the core of the Bitcoin protocol, which we term the Bitcoin backbone …
Time, clocks, and the ordering of events in a distributed system
L Lamport - Concurrency: the Works of Leslie Lamport, 2019 - dl.acm.org
The concept of one event happening before another in a distributed system is examined,
and is shown to define a partial ordering of the events. A distributed algorithm is given for …
and is shown to define a partial ordering of the events. A distributed algorithm is given for …
The Byzantine generals problem
L Lamport, R Shostak, M Pease - Concurrency: the works of leslie …, 2019 - dl.acm.org
Reliable computer systems must handle malfunctioning components that give conflicting
information to different parts of the system. This situation can be expressed abstractly in …
information to different parts of the system. This situation can be expressed abstractly in …
The part-time parliament
L Lamport - Concurrency: the Works of Leslie Lamport, 2019 - dl.acm.org
Recent archaeological discoveries on the island of Paxos reveal that the parliament
functioned despite the peripatetic propensity of its part-time legislators. The legislators …
functioned despite the peripatetic propensity of its part-time legislators. The legislators …
Bft in blockchains: From protocols to use cases
A blockchain is a distributed system that achieves strong security guarantees in storing,
managing, and processing data. All blockchains achieve a common goal: building a …
managing, and processing data. All blockchains achieve a common goal: building a …
Dumbo-ng: Fast asynchronous bft consensus with throughput-oblivious latency
Despite recent progresses of practical asynchronous Byzantine-fault tolerant (BFT)
consensus, the state-of-the-art designs still suffer from suboptimal performance. Particularly …
consensus, the state-of-the-art designs still suffer from suboptimal performance. Particularly …
A new solution of Dijkstra's concurrent programming problem
L Lamport - Concurrency: the works of leslie lamport, 2019 - dl.acm.org
Knuth [1], deBruijn [2], and Eisenberg and McGuire [3] have given solutions to a concurrent
programming problem originally proposed and solved by Dijkstra [4]. A simpler solution …
programming problem originally proposed and solved by Dijkstra [4]. A simpler solution …
Sync hotstuff: Simple and practical synchronous state machine replication
Synchronous solutions for Byzantine Fault Tolerance (BFT) can tolerate up to minority faults.
In this work, we present Sync HotStuff, a surprisingly simple and intuitive synchronous BFT …
In this work, we present Sync HotStuff, a surprisingly simple and intuitive synchronous BFT …
Dumbo-mvba: Optimal multi-valued validated asynchronous byzantine agreement, revisited
Multi-valued validated asynchronous Byzantine agreement (MVBA), proposed in the elegant
work of Cachin et al.(CRYPTO'01), is fundamental for critical fault-tolerant services such as …
work of Cachin et al.(CRYPTO'01), is fundamental for critical fault-tolerant services such as …
Asymptotically optimal validated asynchronous byzantine agreement
We provide a new protocol for Validated Asynchronous Byzantine Agreement in the
authenticated setting. Validated (multi-valued) Asynchronous Byzantine Agreement is a key …
authenticated setting. Validated (multi-valued) Asynchronous Byzantine Agreement is a key …