Byzantine agreement with homonyms
From MaRDI portal
Publication:5920298
DOI10.1007/s00446-013-0190-3zbMath1284.68067OpenAlexW2611856048MaRDI QIDQ5920298
Hugues Fauconnier, Anne-Marie Kermarrec, Rachid Guerraoui, Eric Ruppert, Carole Delporte-Gallet, Hung Tran-The
Publication date: 28 March 2014
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: http://infoscience.epfl.ch/record/208944
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Easy impossibility proofs for distributed consensus problems
- Computing in totally anonymous asynchronous shared memory systems
- On the importance of having an identity or, is consensus really universal?
- Relationships between broadcast and shared memory in reliable anonymous distributed systems
- Anonymous and fault-tolerant shared-memory computing
- Renaming in synchronous message passing systems with Byzantine failures
- Efficient algorithms for anonymous Byzantine agreement
- Impossibility of distributed consensus with one faulty process
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- Group Signatures
- Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
- Byzantine agreement with homonyms
