Fetching the paper…
Reading the bibliography…
Since the inception of Bitcoin, cryptocurrencies and the underlying blockchain technology have attracted an increasing interest from both academia and industry.
L. Lamport, “Time, clocks, and the ordering of events in a distributed system,” Communications of the ACM , vol. 21, no. 7, pp. 558–565, 1978
1978
Earlier work this paper cites.
M. Pease, R. Shostak, and L. Lamport, “Reaching agreement in the presence of faults,” Journal of the ACM (JACM) , vol. 27, no. 2, pp. 228–234, 1980
1980
Earlier work this paper cites.
L. Lamport, R. Shostak, and M. Pease, “The byzantine generals problem,” ACM Transactions on Programming Languages and Systems (TOPLAS) , vol. 4, no. 3, pp. 382–401, 1982
1982
Earlier work this paper cites.
M. Ben-Or, “Another advantage of free choice (extended abstract): Completely asynchronous agreement protocols,” in Proceedings of the second annual ACM symposium on Principles of distributed computing . ACM, 1983, pp. 27–30
1983
Earlier work this paper cites.
M. O. Rabin, “Randomized byzantine generals,” in 24th Annual Symposium on Foundations of Computer Science (sfcs 1983) . IEEE, 1983, pp. 403–409
1983
Earlier work this paper cites.
——, “Using time instead of timeout for fault-tolerant distributed systems,” ACM Transactions on Programming Languages and Systems (TOPLAS) , vol. 6, no. 2, pp. 254–280, 1984
1984
Earlier work this paper cites.
G. Bracha, “An asynchronous [(n-1)/3]-resilient consensus protocol,” in Proceedings of the third annual ACM symposium on Principles of distributed computing . ACM, 1984, pp. 154–162
1984
Earlier work this paper cites.
M. J. Fischer, N. A. Lynch, and M. S. Paterson, “Impossibility of distributed consensus with one faulty process,” Journal of the ACM (JACM) , vol. 32, no. 2, pp. 374–382, 1985
1985
Earlier work this paper cites.
B. Alpern and F. B. Schneider, “Defining liveness,” Information processing letters , vol. 21, no. 4, pp. 181–185, 1985
1985
Earlier work this paper cites.
G. Bracha and S. Toueg, “Asynchronous consensus and broadcast protocols,” Journal of the ACM (JACM) , vol. 32, no. 4, pp. 824–840, 1985
1985
Earlier work this paper cites.
F. Cristian, H. Aghili, R. Strong, and D. Dolev, Atomic broadcast: From simple message diffusion to Byzantine agreement . International Business Machines Incorporated, Thomas J. Watson Research Center, 1986
1986
Earlier work this paper cites.
G. Bracha, “Asynchronous byzantine agreement protocols,” Information and Computation , vol. 75, no. 2, pp. 130–143, 1987
1987
Earlier work this paper cites.
R. C. Merkle, “A digital signature based on a conventional encryption function,” in Conference on the theory and application of cryptographic techniques . Springer, 1987, pp. 369–378
1987
Earlier work this paper cites.
C. Dwork, N. Lynch, and L. Stockmeyer, “Consensus in the presence of partial synchrony,” Journal of the ACM (JACM) , vol. 35, no. 2, pp. 288–323, 1988
1988
Earlier work this paper cites.
B. M. Oki and B. H. Liskov, “Viewstamped replication: A new primary copy method to support highly-available distributed systems,” in Proceedings of the seventh annual ACM Symposium on Principles of distributed computing . ACM, 1988, pp. 8–17
1988
Earlier work this paper cites.
T. Rabin and M. Ben-Or, “Verifiable secret sharing and multiparty protocols with honest majority,” in Proceedings of the twenty-first annual ACM symposium on Theory of computing . ACM, 1989, pp. 73–85
1989
Earlier work this paper cites.
F. B. Schneider, “Implementing fault-tolerant services using the state machine approach: A tutorial,” ACM Computing Surveys (CSUR) , vol. 22, no. 4, pp. 299–319, 1990
1990
Earlier work this paper cites.
R. Canetti and T. Rabin, “Fast asynchronous byzantine agreement with optimal resilience,” in Proceedings of the twenty-fifth annual ACM symposium on Theory of computing . ACM, 1993, pp. 42–51
1993
Earlier work this paper cites.
M. Ben-Or, B. Kelmer, and T. Rabin, “Asynchronous secure computations with optimal resilience,” in Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing . ACM, 1994, pp. 183–192
1994
Earlier work this paper cites.
H. Attiya, A. Bar-Noy, and D. Dolev, “Sharing memory robustly in message-passing systems,” Journal of the ACM (JACM) , vol. 42, no. 1, pp. 124–142, 1995
1995
Earlier work this paper cites.
T. D. Chandra and S. Toueg, “Unreliable failure detectors for reliable distributed systems,” Journal of the ACM (JACM) , vol. 43, no. 2, pp. 225–267, 1996
1996
Earlier work this paper cites.
M. K. Reiter, “A secure group membership protocol,” IEEE Transactions on Software Engineering , vol. 22, no. 1, pp. 31–42, 1996
1996
Earlier work this paper cites.
L. Lamport, “The part-time parliament,” ACM Transactions on Computer Systems (TOCS) , vol. 16, no. 2, pp. 133–169, 1998
1998
Earlier work this paper cites.
V. Shoup and R. Gennaro, “Securing threshold cryptosystems against chosen ciphertext attack,” in International Conference on the Theory and Applications of Cryptographic Techniques . Springer, 1998, pp. 1–16
1998
Earlier work this paper cites.
M. Castro, B. Liskov et al. , “Practical byzantine fault tolerance,” in OSDI , vol. 99, 1999, pp. 173–186
1999
Earlier work this paper cites.
S. Micali, M. Rabin, and S. Vadhan, “Verifiable random functions,” in 40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039) . IEEE, 1999, pp. 120–130
1999
Earlier work this paper cites.
L. Lamport et al. , “Paxos made simple,” ACM Sigact News , vol. 32, no. 4, pp. 18–25, 2001
2001
Earlier work this paper cites.
C. Cachin, K. Kursawe, F. Petzold, and V. Shoup, “Secure and efficient asynchronous broadcast protocols,” in Annual International Cryptology Conference . Springer, 2001, pp. 524–541
2001
Earlier work this paper cites.
R. Canetti, “Universally composable security: A new paradigm for cryptographic protocols,” in Proceedings 42nd IEEE Symposium on Foundations of Computer Science . IEEE, 2001, pp. 136–145
2001
Earlier work this paper cites.
J. Baek and Y. Zheng, “Simple and efficient threshold cryptosystem from the gap diffie-hellman group,” in GLOBECOM’03. IEEE Global Telecommunications Conference (IEEE Cat. No. 03CH37489) , vol. 3. IEEE, 2003, pp. 1491–1495
2003
Earlier work this paper cites.
J. Yin, J.-P. Martin, A. Venkataramani, L. Alvisi, and M. Dahlin, “Separating agreement from execution for byzantine fault tolerant services,” in ACM SIGOPS Operating Systems Review , vol. 37, no. 5. ACM, 2003, pp. 253–267
2003
Earlier work this paper cites.
H. Attiya and J. Welch, Distributed computing: fundamentals, simulations, and advanced topics . John Wiley & Sons, 2004, vol. 19
2004
Earlier work this paper cites.
X. Défago, A. Schiper, and P. Urbán, “Total order broadcast and multicast algorithms: Taxonomy and survey,” ACM Computing Surveys (CSUR) , vol. 36, no. 4, pp. 372–421, 2004
2004
Earlier work this paper cites.
R. Canetti, O. Goldreich, and S. Halevi, “The random oracle methodology, revisited,” Journal of the ACM (JACM) , vol. 51, no. 4, pp. 557–594, 2004
2004
Earlier work this paper cites.
M. Abd-El-Malek, G. R. Ganger, G. R. Goodson, M. K. Reiter, and J. J. Wylie, “Fault-scalable byzantine fault-tolerant services,” ACM SIGOPS Operating Systems Review , vol. 39, no. 5, pp. 59–74, 2005
2005
Earlier work this paper cites.
C. Cachin and S. Tessaro, “Asynchronous verifiable information dispersal,” in Reliable Distributed Systems, 2005. SRDS 2005. 24th IEEE Symposium on . IEEE, 2005, pp. 191–201
2005
Earlier work this paper cites.
J. Cowling, D. Myers, B. Liskov, R. Rodrigues, and L. Shrira, “Hq replication: A hybrid quorum protocol for byzantine fault tolerance,” in Proceedings of the 7th symposium on Operating systems design and implementation . USENIX Association, 2006, pp. 177–190
2006
Earlier work this paper cites.
J.-P. Martin and L. Alvisi, “Fast byzantine consensus,” IEEE Transactions on Dependable and Secure Computing , vol. 3, no. 3, pp. 202–215, 2006
2006
Earlier work this paper cites.
M. Franklin, “A survey of key evolving cryptosystems,” International Journal of Security and Networks , vol. 1, no. 1-2, pp. 46–53, 2006
2006
Earlier work this paper cites.
R. Kotla, L. Alvisi, M. Dahlin, A. Clement, and E. Wong, “Zyzzyva: speculative byzantine fault tolerance,” ACM SIGOPS Operating Systems Review , vol. 41, no. 6, pp. 45–58, 2007
2007
Earlier work this paper cites.
A. Juels and B. S. Kaliski Jr, “Pors: Proofs of retrievability for large files,” in Proceedings of the 14th ACM conference on Computer and communications security . Acm, 2007, pp. 584–597
2007
Earlier work this paper cites.
S. Nakamoto, “Bitcoin: A peer-to-peer electronic cash system,” 2008
2008
Earlier work this paper cites.
G. S. Veronese, M. Correia, A. N. Bessani, and L. C. Lung, “Spin one’s wheels? byzantine fault tolerance with a spinning primary,” in Reliable Distributed Systems, 2009. SRDS’09. 28th IEEE International Symposium on . IEEE, 2009, pp. 135–144
2009
Earlier work this paper cites.
A. Clement, E. L. Wong, L. Alvisi, M. Dahlin, and M. Marchetti, “Making byzantine fault tolerant systems tolerate byzantine faults.” in NSDI , vol. 9, 2009, pp. 153–168
2009
Cited alongside, same era.
R. Guerraoui, N. Knežević, V. Quéma, and M. Vukolić, “The next 700 bft protocols,” in Proceedings of the 5th European conference on Computer systems . ACM, 2010, pp. 363–376
2010
Cited alongside, same era.
S. King and S. Nadal, “Ppcoin: Peer-to-peer crypto-currency with proof-of-stake,” self-published paper, August , 2012. [Online]. Available: https://bitcoin.peryaudo.org/vendor/peercoin-paper.pdf
2012
Cited alongside, same era.
B. Liskov and J. Cowling, “Viewstamped replication revisited,” MIT-CSAIL: Computer Science and Artificial Intelligence Laboratory Technical Report , 2012
2012
Cited alongside, same era.
A. Kiayias, A. Russell, B. David, and R. Oliynykov, “Ouroboros: A provably secure proof-of-stake blockchain protocol,” in Annual International Cryptology Conference . Springer, 2017, pp. 357–388
2017
Later among the works it cites.
P. Daian, R. Pass, and E. Shi, “Snow white: Robustly reconfigurable consensus and applications to provably secure proofs of stake,” Technical Report. Cryptology ePrint Archive, Report 2016/919, Tech. Rep., 2017
2017
Later among the works it cites.
Y. Gilad, R. Hemo, S. Micali, G. Vlachos, and N. Zeldovich, “Algorand: Scaling byzantine agreements for cryptocurrencies,” in Proceedings of the 26th Symposium on Operating Systems Principles . ACM, 2017, pp. 51–68
2017
Later among the works it cites.
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. N. Bessani, “(BFT) state machine replication: the hype, the virtue, and even some practice,” Tutorials in EuroSys 2012. [Online]. Available: http://www.di.fc.ul.pt/~bessani/publications/T1-bftsmr.pdf
2012
Cited alongside, same era.
C. Decker and R. Wattenhofer, “Information propagation in the bitcoin network,” in Peer-to-Peer Computing (P2P), 2013 IEEE Thirteenth International Conference on . IEEE, 2013, pp. 1–10
2013
Cited alongside, same era.
J. Y. Kwon, “Tendermint: Consensus without mining,” 2014. [Online]. Available: https://cdn.relayto.com/media/files/LPgoWO18TCeMIggJVakt_tendermint.pdf
2014
Cited alongside, same era.
D. Ongaro and J. Ousterhout, “In search of an understandable consensus algorithm,” in 2014 USENIX Annual Technical Conference (USENIX ATC 14) , 2014, pp. 305–319
2014
Cited alongside, same era.
A. Mostéfaoui, H. Moumen, and M. Raynal, “Signature-free asynchronous byzantine consensus with t < n / 3 t<n/3 and o ( n 2 ) o(n^{2}) messages,” in Proceedings of the 2014 ACM symposium on Principles of distributed computing . ACM, 2014, pp. 2–9
2014
Cited alongside, same era.
G. Wood, “Ethereum: A secure decentralised generalised transaction ledger,” Ethereum Project Yellow Paper , vol. 151, pp. 1–32, 2014
2014
Cited alongside, same era.
I. Eyal and E. G. Sirer, “Majority is not enough: Bitcoin mining is vulnerable,” in International conference on financial cryptography and data security . Springer, 2014, pp. 436–454
2014
Cited alongside, same era.
D. Kondor, M. Pósfai, I. Csabai, and G. Vattay, “Do the rich get richer? an empirical analysis of the bitcoin transaction network,” PloS one , vol. 9, no. 2, p. e86197, 2014
2014
Cited alongside, same era.
C. Cachin and M. Vukolić, “Blockchain consensus protocols in the wild,” in 31 International Symposium on Distributed Computing (DISC) , 2017
2017
Later among the works it cites.
2017
Later among the works it cites.
I. Abraham, D. Malkhi et al. , “The blockchain consensus layer and bft,” Bulletin of EATCS , vol. 3, no. 123, 2017
2017
Later among the works it cites.
R. Pass and E. Shi, “Hybrid consensus: Efficient consensus in the permissionless model,” in 31st International Symposium on Distributed Computing (DISC 2017) . Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2017
2017
Later among the works it cites.
——, “Fruitchains: A fair blockchain,” in Proceedings of the ACM Symposium on Principles of Distributed Computing . ACM, 2017, pp. 315–324
2017
Later among the works it cites.
R. Pass and E. Shi, “The sleepy model of consensus,” in International Conference on the Theory and Application of Cryptology and Information Security . Springer, 2017, pp. 380–409
2017
Later among the works it cites.
F. Brasser, U. Müller, A. Dmitrienko, K. Kostiainen, S. Capkun, and A.-R. Sadeghi, “Software grand exposure: SGX cache attacks are practical,” in 11th USENIX Workshop on Offensive Technologies (WOOT 17) , 2017
2017
Later among the works it cites.
W. Li, S. Andreina, J.-M. Bohli, and G. Karame, “Securing proof-of-stake blockchain protocols,” in Data Privacy Management, Cryptocurrencies and Blockchain Technology . Springer, 2017, pp. 297–315
2017
Later among the works it cites.
“EOS.IO technical white paper v2,” EOS.IO, 2018. [Online]. Available: https://github.com/EOSIO/Documentation/blob/master/TechnicalWhitePaper.md
2018
Later among the works it cites.
“POA network whitepaper,” POA Network, 2018. [Online]. Available: https://github.com/poanetwork/wiki/wiki/POA-Network-Whitepaper
2018
Later among the works it cites.
E. Androulaki, A. Barger, V. Bortnikov, C. Cachin, K. Christidis, A. De Caro, D. Enyeart, C. Ferris, G. Laventman, Y. Manevich et al. , “Hyperledger fabric: a distributed operating system for permissioned blockchains,” in Proceedings of the Thirteenth EuroSys Conference . ACM, 2018, p. 30
2018
Later among the works it cites.
K. Wüst and A. Gervais, “Do you need a blockchain?” in 2018 Crypto Valley Conference on Blockchain Technology (CVCBT) . IEEE, 2018, pp. 45–54
2018
Later among the works it cites.
D. Gutteridge, “Japanese cryptocurrency monacoin hit by selfish mining attack,” 2018. [Online]. Available: https://www.ccn.com/japanese-cryptocurrency-monacoin-hit-by-selfish-mining-attack/
2018
Later among the works it cites.
A. E. Gencer, S. Basu, I. Eyal, R. van Renesse, and E. G. Sirer, “Decentralization in bitcoin and ethereum networks.” in Proc. of the Financial Cryptography and Data Security Conference , 2018
2018
Later among the works it cites.
2018
Later among the works it cites.
B. David, P. Gaži, A. Kiayias, and A. Russell, “Ouroboros praos: An adaptively-secure, semi-synchronous proof-of-stake blockchain,” in Annual International Conference on the Theory and Applications of Cryptographic Techniques . Springer, 2018, pp. 66–98
2018
Later among the works it cites.
2018
Later among the works it cites.
D. Larimer, “DPOS BFT— pipelined byzantine fault tolerance,” 2018. [Online]. Available: https://medium.com/eosio/dpos-bft-pipelined-byzantine-fault-tolerance-8a0634a270ba
2018
Later among the works it cites.
J. Martinez, “Understanding proof of stake: The nothing at stake theory,” 2018. [Online]. Available: https://medium.com/coinmonks/understanding-proof-of-stake-the-nothing-at-stake-theory-1f0d71bc027
2018
Later among the works it cites.
P. Gaži, A. Kiayias, and A. Russell, “Stake-bleeding attacks on proof-of-stake blockchains,” in 2018 Crypto Valley Conference on Blockchain Technology (CVCBT) . IEEE, 2018, pp. 85–92
2018
Later among the works it cites.
“Hyperledger sawtooth project,” The Linux Foundation, 2018. [Online]. Available: https://www.hyperledger.org/projects/sawtooth
2018
Later among the works it cites.
“Introducing arm trustzone,” Arm Ltd, 2018. [Online]. Available: https://developer.arm.com/technologies/trustzone
2018
Later among the works it cites.
“Hyperledger sawtooth RFC,” The Linux Foundation, 2018. [Online]. Available: https://github.com/hyperledger/sawtooth-rfcs/blob/master/text/0019-pbft-consensus.md
2018
Later among the works it cites.
J. Van Bulck, M. Minkin, O. Weisse, D. Genkin, B. Kasikci, F. Piessens, M. Silberstein, T. F. Wenisch, Y. Yarom, and R. Strackx, “Foreshadow: Extracting the keys to the intel SGX kingdom with transient out-of-order execution,” in 27th USENIX Security Symposium (USENIX Security 18) , 2018, pp. 991–1008
2018
Later among the works it cites.
O. Weisse, J. Van Bulck, M. Minkin, D. Genkin, B. Kasikci, F. Piessens, M. Silberstein, R. Strackx, T. F. Wenisch, and Y. Yarom, “Foreshadow-ng: Breaking the virtual memory abstraction with transient out-of-order execution,” Technical report, Tech. Rep., 2018
2018
Later among the works it cites.
Y. Sompolinsky and A. Zohar, “Phantom: A scalable blockdag protocol.” IACR Cryptology ePrint Archive , vol. 2018, p. 104, 2018
2018
Later among the works it cites.
C. LeMahieu, “Nano: A feeless distributed cryptocurrency network,” URL: https://nano. org/en/whitepaper , 2018
2018
Later among the works it cites.
T. Rocket, “Snowflake to avalanche: A novel metastable consensus protocol family for cryptocurrencies,” 2018
2018
Later among the works it cites.
W. Wang, H. Dinh Thai, P. Hu, Z. Xiong, D. Niyato, P. Wang, Y. Wen, and D. In Kim, “A survey on consensus mechanisms and mining strategy management in blockchain networks,” IEEE Access , vol. PP, pp. 1–1, 01 2019
2019
Closest in time.
Y. Xiao, N. Zhang, J. Li, W. Lou, and Y. T. Hou, “Distributed consensus protocols and algorithms,” Blockchain for Distributed Systems Security , p. 25, 2019
2019
Closest in time.
M. Belotti, N. Božić, G. Pujolle, and S. Secci, “A vademecum on blockchain technologies: When, which and how,” IEEE Communications Surveys & Tutorials , 2019
2019
Closest in time.
“Bitcoin wire protocol 101,” Bitcoin Developer Network, 2019. [Online]. Available: https://bitcoindev.network/bitcoin-wire-protocol/
2019
Closest in time.
“Ethereum wire protocol,” Ethereum Foundation, 2019. [Online]. Available: https://github.com/ethereum/devp2p/blob/master/caps/eth.md
2019
Closest in time.
J. Long and R. Wei, “Scalable bft consensus mechanism through aggregated signature gossip,” in 2019 IEEE International Conference on Blockchain and Cryptocurrency (ICBC) . IEEE, 2019, pp. 360–367
2019
Closest in time.
“Casper proof of stake compendium,” The Ethereum Foundation, 2019. [Online]. Available: https://github.com/ethereum/wiki/wiki/Casper-Proof-of-Stake-compendium
2019
Closest in time.
“Sharding introduction R&D compendium.” The Ethereum Foundation, 2019. [Online]. Available: https://github.com/ethereum/wiki/wiki/Sharding-introduction-R&D-compendium
2019
Closest in time.
C. Cachin and B. Tackmann, “Asymmetric distributed trust,” arXiv preprint arXiv:1906.09314 , 2019
2019
Closest in time.
2019
Closest in time.
S. Duan, M. K. Reiter, and H. Zhang, “Beat: Asynchronous bft made practical,” in Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security (CCS 18) . ACM, 2018, pp. 2028–2041
2041
Closest in time.