Practical byzantine fault tolerance and proactive recovery
Top Cited Papers
- 1 November 2002
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
- Vol. 20 (4) , 398-461
- https://doi.org/10.1145/571637.571640
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Muteness Failure Detectors: Specification and ImplementationPublished by Springer Nature ,1999
- Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 RoundsSIAM Journal on Computing, 1998
- A New Paradigm for Collision-Free Hashing: Incrementality at Reduced CostPublished by Springer Nature ,1997
- The Exact Security of Digital Signatures-How to Sign with RSA and RabinPublished by Springer Nature ,1996
- Optimal asymmetric encryptionPublished by Springer Nature ,1995
- Checking the correctness of memoriesAlgorithmica, 1994
- Experimental quantum cryptographyJournal of Cryptology, 1992
- Multicast routing in datagram internetworks and extended LANsACM Transactions on Computer Systems, 1990
- Asynchronous consensus and broadcast protocolsJournal of the ACM, 1985
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985