Byzantine agreement with homonyms

DOI10.1145/1993806.1993810zbMath1321.68070OpenAlexW1974886366MaRDI QIDQ5892120

Anne-Marie Kermarrec, Hugues Fauconnier, Hung Tran-The, Carole Delporte-Gallet, Eric Ruppert, Rachid Guerraoui

Publication date: 11 September 2015

Published in: Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: http://infoscience.epfl.ch/record/208944

zbMATH Keywords

synchronylower boundsconsensusagreementByzantine failuresidentifiers

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items

Who are you? Secure identities in single hop ad hoc networks, Byzantine agreement with homonyms in synchronous systems, Agreeing within a few writes, Homonym population protocols, Wait-free solvability of colorless tasks in anonymous shared-memory model, Byzantine agreement with homonyms, How Many Cooks Spoil the Soup?, How many cooks spoil the soup?

Cites Work

• Unnamed Item
• Gradient clock synchronization in dynamic networks
• Consensus algorithms with one-bit messages
• Knowledge and common knowledge in a Byzantine environment: Crash failures
• Broadcasting in dynamic radio networks
• Programming simultaneous actions using common knowledge
• Continuous consensus via common knowledge
• Distributed computation in dynamic networks
• Flooding time in edge-Markovian dynamic graphs
• Knowledge and common knowledge in a distributed environment
• How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
• Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony
• Fault Tolerance in Networks of Bounded Degree
• Reaching Agreement in the Presence of Faults
• Perfectly secure message transmission
• Parsimonious flooding in dynamic graphs
• Optimal gradient clock synchronization in dynamic networks
• Almost-Everywhere Secure Computation