Agreement under faulty interfaces

DOI10.1016/S0020-0190(97)00202-0MaRDI QIDQ293206zbMATH OpenOpenAlexFDO

Authors Pallab Dasgupta

Publication date 9 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0020019097002020?np=y

zbMATH Keywords

distributed systemsByzantine agreementByzantine generals problemmessage corruptionmessage lossspurious message generation

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• Distributed agreement in the presence of processor and communication faults
• Authenticated Algorithms for Byzantine Agreement
• Unconditional Byzantine agreement for any number of faulty processors (extended abstract)
• Message-optimal protocols for Byzantine Agreement
• Efficient agreement using fault diagnosis.

Cites work

• An efficient algorithm for byzantine agreement without authentication
• Authenticated Algorithms for Byzantine Agreement
• Early stopping in Byzantine agreement
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• The Byzantine generals strike again
• The Weak Byzantine Generals Problem

Cited in

(3)

• Making asynchronous distributed computations robust to noise
• scientific article; zbMATH DE number 2051906 (Why is no real title available?)
• Making Asynchronous Distributed Computations Robust to Channel Noise

This page was built for publication: Agreement under faulty interfaces

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