Agreement under faulty interfaces

DOI10.1016/S0020-0190(97)00202-0zbMath1338.68021OpenAlexW1980514553MaRDI QIDQ293206

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)

Related Items (3)

Distributed computations in fully-defective networks ⋮ Making Asynchronous Distributed Computations Robust to Channel Noise ⋮ Making asynchronous distributed computations robust to noise

Cites Work

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

This page was built for publication: Agreement under faulty interfaces