Fetching the paper…
Reading the bibliography…
This paper introduces a deterministic Byzantine consensus algorithm that relies on a new weak coordinator.
Lamport L., Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558-565 (1978)
1978
Earlier work this paper cites.
Pease M., R. Shostak R., and Lamport L., Reaching agreement in the presence of faults. Journal of the ACM, 27:228-234 (1980)
1980
Earlier work this paper cites.
Fischer M.J. and Lynch N.A., A lower bound for the time to assure interactive consistency. Information Processing Letters, 14(4):183-186 (1982)
1982
Earlier work this paper cites.
Lamport L., Shostack R., and Pease M., The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3)-382-401 (1982)
1982
Earlier work this paper cites.
Bracha G. and Toueg S., Asynchronous consensus and broadcast protocols
1985
Earlier work this paper cites.
Fischer M.J., Lynch N.A., and Paterson M.S., Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374-382 (1985)
1985
Earlier work this paper cites.
Bracha G., Asynchronous Byzantine agreement protocols
1987
Earlier work this paper cites.
Dolev D., Dwork C. and Stockmeyer L., On the minimal synchronism needed for distributed consensus. Journal of the ACM, 34(1):77-97 (1987)
1987
Earlier work this paper cites.
Srikanth, T., Simulating Authenticated Broadcasts to Derive Simple Fault-Tolerant Algorithms. Distributed Computing, 2(2): 80-94 (1987)
1987
Earlier work this paper cites.
Dwork C., Lynch N., and Stockmeyer L., Consensus in the presence of partial synchrony. Journal of the ACM, 35(2):288-323 (1988)
1988
Earlier work this paper cites.
Schneider F.B., Implementing fault-tolerant services using the state machine approach. ACM Computing Surveys, 22(4):299-319 (1990)
1990
Earlier work this paper cites.
Canetti, R., Fast asynchronous Byzantine agreement with optimal resilience
1993
Earlier work this paper cites.
Ben-Or M., Kelmer B., and Rabin T., Asynchronous Secure Computations with Optimal Resilience
1994
Earlier work this paper cites.
Chandra T. and Toueg S., Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225-267 (1996)
1996
Earlier work this paper cites.
Lynch N.A., Distributed algorithms. Morgan Kaufmann Pub., San Francisco (CA), 872 pages (1996) ISBN 1-55860-384-4
1996
Cited alongside, same era.
Kursawe K., Optimistic asynchronous Byzantine agreement. Manuscript (2000)
2000
Cited alongside, same era.
Cachin C., Kursawe K., Petzold F., and Shoup V., Secure and Efficient Asynchronous Broadcast Protocols
2001
Cited alongside, same era.
Castro M. and Liskov B., Practical Byzantine fault tolerance and proactive recovery. ACM Transactions on Computer Systems, 20(4):398-461 (2002)
2002
Cited alongside, same era.
Aspnes J., Randomized protocols for asynchronous consensus
2003
Cited alongside, same era.
Ben-Or M., El-Yaniv R., Resilient-optimal interactive consistency in constant time
Raynal M., Communication and agreement abstractions for fault-tolerant asynchronous distributed systems. Morgan & Claypool, 251 pages (2010) ISBN 978-1-60845-293-4
2010
Later among the works it cites.
Cachin C., Guerraoui R., and Rodrigues L.,
2011
Later among the works it cites.
Aublin P.-L., Ben Mokhtar, S., Quema V., RBFT: Redundant Byzantine Fault Tolerance
2013
Later among the works it cites.
Bessani, A., Sousa, J., Alchieri, E.A.P., State Machine Replication for the Masses with BFT-SMART
2014
Later among the works it cites.
Aublin P.-L., Guerraoui R., Knezevic N., Quema V., and Vukolić M., The next 700 BFT protocols
2015
Later among the works it cites.
Buterin V., Ethereum: platform review, opportunites and challenges for private and consortium blockchains (2016)
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2003
Cited alongside, same era.
Kihlstrom K.P., Moser L.E., and Melliar-Smith P.M., Byzantine fault detectors for solving consensus. The Computer Journal, 46(1):16-35 (2003)
2003
Cited alongside, same era.
Neves N. F. and Correia M. and Verissimo P., Solving vector consensus with a wormhole, IEEE Transactions on Parallel and Distributed Systems, 16(12):1120-1131 (2005)
2005
Cited alongside, same era.
Correia M., Ferreira Neves N., and Verissimo P., From consensus to atomic broadcast: time-free Byzantine-resistant protocols without signatures. The Computer Journal, 49(1):82-96 (2006)
2006
Cited alongside, same era.
Martin J.-Ph. and Alvisi L., Fast Byzantine consensus. IEEE Transactions on Dependable and Secure Computing, 3(3):202-215 (2006)
2006
Cited alongside, same era.
Nakamoto S., Bitcoin: a peer-to-peer electronic cash system. http://www.bitcoin.org (2008)
2008
Cited alongside, same era.
Brief Announcement: A Leader-free Byzantine Consensus Algorithm. Fatemeh Borran and André Schiper. DISC 2009
2009
Cited alongside, same era.
2016
Later among the works it cites.
King V. and Saia J., Byzantine agreement in expected polynomial time. Journal of the ACM, 63(2), Article 13, 21 pages (2016)
2016
Later among the works it cites.
Liu S., Viotti P., Cachin C., Quéma V., and Vukolić M., XFT: practical fault tolerance beyond crashes. Proc. 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI’16), ACM Press, pp. 485-500 (2016)
2016
Later among the works it cites.
Micali, S. ALGORAND: The Efficient and Democratic Ledger. arXiv:1607.01341v7 (2016)
2016
Later among the works it cites.
Miller A., Xia Y., Croman K., Shi E., and Song D., The Honey Badger of BFT Protocols Proc. of the 2016 ACM SIGSAC Conference on Computer and Communications Security, p.31-42 (2016)
2016
Later among the works it cites.
Mostéfaoui A. and Raynal M., Intrusion-tolerant broadcast and agreement abstractions in the presence of Byzantine processes. IEEE Transactions on Parallel and Distributed Systems, 27(4):1085-1098 (2016)
2016
Later among the works it cites.
Abraham, I., Malkhi, D., Nayak, K., Ren, L., Spiegelman, A. Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus
2017
Closest in time.
Androulaki, E., Barger, A., Bortnikov, V., Cachin, C., Christidis, K., De Caro, A., Enyeart, D., Ferris, C., Laventman, G. Manevich, Y., Muralidharan, S., Murthy, C., Nguyen, B., Sethi, M., Singh, G., Smith, K., Sorniotti, A., Stathakopoulou, C., Vukolic, M. Weed Cocco, S. and Yellick, J. Hyperledger fabric: a distributed operating system for permissioned blockchains
2018
Closest in time.