I. Abraham and D. Malkhi, The blockchain consensus layer and bft, Bulletin of the European Association for Theoretical Computer Science, issue.123, 2017.

E. Anceaume, B. Sericola, R. Ludinard, and F. Tronel, Modeling and Evaluating Targeted Attacks in Large Scale Dynamic Systems, International Conference on Dependable Systems and Networks (DSN), 2011.
URL : https://hal.archives-ouvertes.fr/hal-00650095

E. Anceaume, R. Ludinard, A. Ravoaja, and F. Brasileiro, PeerCube: A HypercubeBased P2P Overlay Robust against Collusion and Churn, Proceedings of the IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO), 2008.

E. Anceaume, R. Ludinard, and B. Sericola, Performance evaluation of large-scale dynamic systems, ACM SIGMETRICS Performance Evaluation Review, vol.39, issue.4, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00653409

G. Ateniese, I. Bonacina, A. Faonio, and N. Galesi, Proofs of Space: When Space Is of the Essence, Proceedings of the International Conference on Security and Cryptography for Networks, 2014.

B. Awerbuch and C. Scheideler, Towards scalable and robust overay networks, Proceedings of the International Workshop on Peer-to-Peer Systems (IPTPS), 2007.

C. Badertscher, P. Ga?i, A. Kiayias, A. Russell, and V. Zikas, Ouroboros genesis: Composable proof-of-stake blockchains with dynamic availability, Proc. of the 2018 ACM SIGSAC Conference on Computer and Communications Security (CCS), 2018.

D. Bernardo, P. Ga?i, A. Kiayias, and A. Russell, Ouroboros praos: An adaptivelysecure, semi-synchronous proof-of-stake blockchain, Proc. of International Conference on the Theory and Applications of Cryptographic (EUROCRYPT), 2018.

I. Cascudo and B. David, SCRAPE: Scalable randomness attested by public entities, Proc. of the International Conference on Applied Cryptography and Network Security (ACNS, 2017.

D. Chaum, Untraceable electronic mail, return addresses, and digital pseudonyms, Communications of the ACM, vol.24, issue.2, pp.84-90, 1988.

J. Chen, S. Gorbunov, S. Micali, and G. Vlachos, Algorand agreement: Super Fast and Partition Resilient Byzantine Agreement, 2018.

M. Correia, N. F. Neves, and P. Veríssimo, From consensus to atomic broadcast: Timefree Byzantine-resistant protocols without signatures, The Computer Journal, vol.49, issue.1, 2006.

P. Daian, R. Pass, and E. Shi, Snow White: Provably Secure Proofs of Stake, Cryptology ePrint Archive, vol.919, 2016.

. Eos and . Io, Technical white paper v2, pp.2019-2022, 2019.

A. Fiat, J. Saia, and M. Young, Making chord robust to byzantine attacks, Proceedings of the Annual European Symposium on Algorithms (AESA), 2005.

Y. Gilad, R. Hemo, S. Micali, G. Vlachos, and N. Zeldovich, Algorand: Scaling Byzantine Agreements for Cryptocurrencies, Proceedings of the 26th Symposium on Operating Systems Principles (SOSP, 2017.

W. Hoeffding, Probability inequalities for sums of bounded random variables, The Collected Works of Wassily Hoeffding, 1994.

. Intel, , pp.2019-2022, 2019.

A. Kiayias, A. Russell, B. David, and R. Oliynykov, Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol. Cryptology ePrint Archive, vol.889, 2016.

E. Kokoris-kogias, P. Jovanovic, L. Gasser, N. Gailly, E. Syta et al., Omniledger: A secure, scale-out, decentralized ledger via sharding, IEEE Symposium on Security and Privacy, issue.SP, 2018.

S. Micali, M. O. Rabin, and S. P. Vadhan, Verifiable random functions, Proceedings of the IEEE Symposium on Foundations of Computer Science, 1999.

T. Moran and I. Orlov, Proofs of space-time and rational proofs of storage, Cryptology ePrint Archive, p.35, 2016.

S. Nakamoto, Bitcoin: A peer-to-peer electronic cash system, 2008.

M. O. Rabin, Transaction protection by beacons, Journal of Computer and System Sciences, vol.27, issue.2, pp.256-267, 1983.

E. Syta, P. Jovanovic, E. K. Kogias, N. Gailly, L. Gasser et al., Scalable bias-resistant distributed randomness, 2017 IEEE Symposium on Security and Privacy (SP), pp.444-460, 2017.