Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography

By Christian Cachin, Klaus Kursawe, Victor Shoup. Journal of Cryptology, 2000

545 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/0098c0407d9ade8c2e37a5f65cc1121b6d55cf94

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

Citations in the corpus

A Vademecum on Blockchain Technologies: When, Which, and How (2019, background): “Authors in [243] proposed cryptographic solutions with computational bounded adversary (see Appendix C-D) to overcome it.”
Proofs-of-delay and randomness beacons in Ethereum (2017, methodology): “Because no ideal beacon exists, traditional approaches include emulating an ideal beacon using a trusted third party (such as the NIST beacon [19]) or generating randomness from the parties in a protocol using a commit-and-reveal approach [10] in which each party commits to a nonce before all commit”
Variations of Diffie-Hellman Problem (2003, background): “These assumptions play central role for the construction of dynamic group protocols([1], [3], [ 6 ], [7], [19], [20]).”
The Honey Badger of BFT Protocols (2016, background): “Indeed we know of asynchronous BFT protocols for a variety of tasks such as binary agreement (ABA), reliable broadcast (RBC), and more [13, 15, 16].”
All You Need is DAG (2021, methodology): “Implementation examples can be found in [13, 34].”
RapidChain: Scaling Blockchain via Full Sharding (2018, background): “In particular, traditional Byzantine consensus mechanisms such as [44, 20, 17] can only work in a closed membership setting, where the set of participants is xed and their identities are known to everyone via a trusted third party.”
HotStuff: BFT Consensus with Linearity and Responsiveness (2019, methodology): “HotStuffmakes use of threshold signatures [14, 18, 48].”
Scalable Bias-Resistant Distributed Randomness (2017, background): “Other use-cases for public randomness include voting systems [1] for sampling ballots for manual recounts, lotteries for choosing winning numbers, and Byzantine agreement algorithms [15], [46] for achieving scalability.”
Tendermint: Byzantine Fault Tolerance in the Age of Blockchains (2016, methodology): “The solution was iteratively improved to achieve optimal Byzantine agreement with low overhead [35, 16, 13].”
Bullshark: DAG BFT Protocols Made Practical (2022, methodology): “Implementation examples that use PKI and a threshold signature scheme [11, 29, 34] can be found in [14, 30].”
Blockchain Consensus Protocols in the Wild (2017, methodology): “Without this assumption, only randomized protocols for Byzantine consensus are possible, such as the practical variations relying on distributed cryptography [20] as prototyped by SINTRA [21] or, much more recently, HoneyBadger [53].”
SoK: Consensus in the Age of Blockchains (2017, background): “[39] is of notable theoretical value, it does not resolve the issue of the need for a ‘closed’ group and therefore those solutions cannot be a drop-in replacement for open Nakamoto consensus.”