Byzantine agreement with homonyms in synchronous systems

DOI10.1016/J.TCS.2012.11.012zbMath1294.68039OpenAlexW2033188329MaRDI QIDQ391249

Hung Tran-The, Hugues Fauconnier, Carole Delporte-Gallet

Publication date: 10 January 2014

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.11.012

zbMATH Keywords

Byzantine agreementByzantine processesdistribution of the identifierssynchronous systems with homonyms

Mathematics Subject Classification ID

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

Cites Work

• Computing in totally anonymous asynchronous shared memory systems
• On the importance of having an identity or, is consensus really universal?
• Anonymous and fault-tolerant shared-memory computing
• On the minimal synchronism needed for distributed consensus
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• Byzantine agreement with homonyms
• Unnamed Item
• Unnamed Item

This page was built for publication: Byzantine agreement with homonyms in synchronous systems