Towards the minimal synchrony for byzantine consensus

DOI10.1145/1281100.1281149zbMATH Open1283.68100OpenAlexW2055646258MaRDI QIDQ5401430FDOQ5401430

Authors: Achour Mostefaoui, Gilles Tredan 

Publication date: 13 March 2014

Published in: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1281100.1281149

zbMATH Keywords

consensusfault-toleranceauthenticationdistributed algorithmresilienceByzantine processasynchronous distributed systemeventually timely link

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Distributed systems (68M14)

This page was built for publication: Towards the minimal synchrony for byzantine consensus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5401430)