Byzantine Generals in the Permissionless Setting-Reference-Cited by-同舟云学术

Byzantine Generals in the Permissionless Setting

Published:2023-12-01 Issue: Volume: Page:21-37
ISSN:0302-9743
Container-title:Financial Cryptography and Data Security
language:
Short-container-title:

Author:

Lewis-Pye Andrew^ORCID,Roughgarden Tim^ORCID

Publisher

Springer Nature Switzerland

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-47754-6_2

Reference21 articles.

1. Brewer, E.A.: Towards robust distributed systems. In: PODC, Portland, OR, vol. 7, pp. 343477–343502 (2000)

2. Brown-Cohen, J., Narayanan, A., Psomas, A., Weinberg, S.M.: Formal barriers to longest-chain proof-of-stake protocols. In: Proceedings of the 2019 ACM Conference on Economics and Computation, pp. 459–473 (2019)

3. Buterin, V.: What is Ethereum? Ethereum Official webpage. www.ethdocs.org/en/latest/introduction/what-is-ethereum.html. Accessed 14 2018

4. Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: Proceedings 42nd IEEE Symposium on Foundations of Computer Science, pp. 136–145. IEEE (2001)

5. Chen, J., Gorbunov, S., Micali, S., Vlachos, G.: ALGORAND AGREEMENT: super fast and partition resilient Byzantine agreement. IACR Cryptol. ePrint Arch. 2018, 377 (2018)

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Asynchrony-Resilient Sleepy Total-Order Broadcast Protocols;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

2. Unsealing the secrets of blockchain consensus: A systematic comparison of the formal security of proof-of-work and proof-of-stake;Proceedings of the 39th ACM/SIGAPP Symposium on Applied Computing;2024-04-08