Show simple item record

dc.contributor.authorCastro, Miguelen_US
dc.contributor.authorLiskov, Barbaraen_US
dc.date.accessioned2023-03-29T14:41:29Z
dc.date.available2023-03-29T14:41:29Z
dc.date.issued1999-06
dc.identifier.urihttps://hdl.handle.net/1721.1/149288
dc.description.abstractWe have developed a practical state-machine replication algorithm that tolerates Byzantine faults: it works correctly in asynchronous systems like the Internet and it incorporates several optimizations that improve the response time of previous algorithms by more than an order of magnitude.en_US
dc.relation.ispartofseriesMIT-LCS-TM-595
dc.titleAuthenticated Byzantine Fault Tolerance Without Public-Key Cryptographyen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record