Two distributed problems involving Byzantine processes

DOI10.1016/0304-3975(92)90072-NMaRDI QIDQ1186434zbMATH OpenFDO

Authors J. Beauquier

Publication date 28 June 1992

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

distributed systemsprotocolsmutual exclusion problemnaming problem

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Distributed computability in Byzantine asynchronous systems
• scientific article; zbMATH DE number 2080904
• scientific article; zbMATH DE number 3994384
• Highly dynamic distributed computing with Byzantine failures
• The Byzantine generals problem
• The Do-All problem with Byzantine processor failures
• Distributed agreement in the presence of processor and communication faults
• On Optimal Probabilistic Asynchronous Byzantine Agreement

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• Distributed network protocols
• Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation
• How to share a secret
• Reaching Agreement in the Presence of Faults

Cited in

(10)

• Byzantine agreement with homonyms in synchronous systems
• The Weak Byzantine Generals Problem
• scientific article; zbMATH DE number 1696685 (Why is no real title available?)
• Objects shared by Byzantine processes
• Byzantine agreement with homonyms
• Byzantine agreement with homonyms
• Distributed name assignment in computer networks
• The Do-All problem with Byzantine processor failures
• Bee's strategy against Byzantines. Replacing Byzantine participants (extended abstract)
• Renaming in Message Passing Systems with Byzantine Failures

This page was built for publication: Two distributed problems involving Byzantine processes

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