Authenticated Algorithms for Byzantine Agreement

By Danny Dolev, H. Strong. 1983

How researchers see this paper

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

Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries (2007, background): “As default, we also assume synchronous network and a broadcast channel (or public-key infrastructure for running authenticated Byzantine agreement [9]).”
Secure and Efficient Asynchronous Broadcast Protocols (2001, methodology): “The use of cryptographic methods for maintaining consistent state in a distributed system has a long history and originates with the seminal work of Pease, Shostak, and Lamport [33]; Dolev and Strong [14] derive lower bounds for protocols that use authentication.”
Consensus in the presence of partial synchrony (1988, unknown): “Results in the synchronous column are due to [3], [5], and [ 151, and those in the asynchronous column are due to [4] and [lo].”
Hybrid Consensus: Efficient Consensus in the Permissionless Model (2016, methodology): “For example, the authenticated Byzantine model [24] makes use of digital signatures, and cryptographers refer to this setup assumption as the public-key infrastructure [16, 17,20].”