Towards Practical Sleepy BFT
Open Access
- 15 November 2023
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 490-503
Abstract
No abstract availableFunding Information
- NSF (National Science Foundation) (2143058)
This publication has 21 references indexed in Scilit:
- Analysis of the Blockchain Protocol in Asynchronous Networks2017
- On expected constant-round protocols for Byzantine agreementJournal of Computer and System Sciences, 2009
- Atomic Broadcast: From Simple Message Diffusion to Byzantine AgreementInformation and Computation, 1995
- Consensus in the presence of partial synchronyJournal of the ACM, 1988
- Optimal algorithms for Byzantine agreement1988
- Asynchronous consensus and broadcast protocolsJournal of the ACM, 1985
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985
- Authenticated Algorithms for Byzantine AgreementSIAM Journal on Computing, 1983
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982
- Reaching Agreement in the Presence of FaultsJournal of the ACM, 1980