The latest gossip on BFT consensus

L. Lamport, “Time, clocks, and the ordering of events in a distributed system,” Commun. ACM , 1978

1978

Earlier work this paper cites.

A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry, “Epidemic algorithms for replicated database maintenance,” in Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing , ser. PODC ’87. New York, NY, USA: ACM, 1987, pp. 1–12. [Online]. Available: http://doi.acm.org/10.1145/41840.41841

1987

Earlier work this paper cites.

C. Dwork, N. Lynch, and L. Stockmeyer, “Consensus in the presence of partial synchrony,” JACM , 1988

1988

Earlier work this paper cites.

F. B. Schneider, “Implementing fault-tolerant services using the state machine approach: a tutorial,” ACM Comput. Surv. , vol. 22, no. 4, Dec. 1990

1990

Earlier work this paper cites.

——, “Practical byzantine fault tolerance and proactive recovery,” in Proceedings of the 3rd Symposium on Operating Systems Design and Implementation , Feb. 1999

1999

Earlier work this paper cites.

D. Boneh, B. Lynn, and H. Shacham, “Short signatures from the weil pairing,” in Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology , ser. ASIACRYPT ’01. Berlin, Heidelberg: Springer-Verlag, 2001, pp. 514–532. [Online]. Available: http://dl.acm.org/citation.cfm?id=647097.717005

2001

Earlier work this paper cites.

M. Castro and B. Liskov, “Practical byzantine fault tolerance and proactive recovery,” ACMTCS , 2002

2002

Cited alongside, same era.

M. Burrows, “The chubby lock service for loosely-coupled distributed systems,” in OSDI , 2006, pp. 335–350

2006

Cited alongside, same era.

J.-P. Martin and L. Alvisi, “Fast Byzantine consensus,” TDSC , 2006

2006

Cited alongside, same era.

S. Nakamoto, “Bitcoin: A peer-to-peer electronic cash system,” 2009. [Online]. Available: http://www.bitcoin.org/bitcoin.pdf

2009

Cited alongside, same era.

Z. Milosevic, M. Hutle, and A. Schiper, “Unifying Byzantine consensus algorithms with Weak Interactive Consistency,” to appear in OPODIS 2009

2009

Cited alongside, same era.

A. Clement, E. Wong, L. Alvisi, M. Dahlin, and M. Marchetti, “Making byzantine fault tolerant systems tolerate byzantine faults,” in NSDI , 2009, pp. 153–168

2009

Later among the works it cites.

O. Rütti, Z. Milosevic, and A. Schiper, “Generic construction of consensus algorithms for benign and byzantine faults,” in DSN , 2010, pp. 343–352

2010

Later among the works it cites.

T. Crain, V. Gramoli, M. Larrea, and M. Raynal, “Leader/randomization/signature-free byzantine consensus for consortium blockchains,” CoRR , vol. abs/1702.03068, 2017. [Online]. Available: http://arxiv.org/abs/1702.03068

Original

2017

Later among the works it cites.

V. Buterin, “Ethereum: A next-generation smart contract and decentralized application platform,” https://github.com/ethereum/wiki/wiki/White-Paper, 2014, accessed: 2018-07-11. [Online]. Available: https://github.com/ethereum/wiki/wiki/White-Paper

2018

Closest in time.