Brief announcement: byzantine agreement with homonyms

  title={Brief announcement: byzantine agreement with homonyms},
  author={Carole Delporte-Gallet and Hugues Fauconnier and Rachid Guerraoui and Anne-Marie Kermarrec},
  booktitle={SPAA '10},
In this work, we address Byzantine agreement in a message passing system with homonyms, i.e. a system with a number l of authenticated identities that is independent of the total number of processes n, in the presence of t < n Byzantine processes. We prove the following results: (i) agreement is possible if (and only if) l > 3t in a synchronous model; (ii) agreement is impossible, independently of the number of failures, in an eventually synchronous model; (iii) eventual agreement is possible… 

Byzantine Consensus from Moderately-Hard Puzzles : A Model for Bitcoin

A proof is a proof that the Bitcoin protocol achieves consensus in this model, except for a negligible probability, when Byzantine faults make up less than half the network.

Byzantine agreement with homonyms

This paper asks how many identifiers are actually needed to reach agreement in a distributed system with Byzantine processes and demonstrates two differences from the classical model: there are situations where relaxing synchrony to partial synchrony renders agreement impossible; and, in the partially synchronous case, increasing the number of correct processes can actually make it harder to reached agreement.



Efficient Algorithms for Anonymous Byzantine Agreement

A polynomial-time agreement algorithm that requires 3⌊(n−t)t/(n−2t)⌋+4 rounds, where n>3t is the number of processors and t is the maximal number of faulty processors that the algorithm can tolerate.

Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures

A universal construction is given that proves the new theoretical model of ad hoc mobile computing in which agents have restricted memory, highly unpredictable movement and no initial knowledge of the system can solve any decision problem in NSPACE (n logn).

Anonymous and fault-tolerant shared-memory computing

This work considers asynchronous shared-memory systems that are anonymous, and investigates, for the first time, what can be implemented deterministically in this model when processes can fail.

Consensus in the presence of partial synchrony

Fault-tolerant consensus protocols are given for various cases of partial synchrony and various fault models that allow partially synchronous processors to reach some approximately common notion of time.

Computing in Totally Anonymous Asynchronous Shared Memory Systems

A complete characterization of the functions and relations that can be computed within the totally anonymous shared memory model of asynchronous distributed computing, which assumes that processes do not fail, and the shared memory consists only of read/write registers, which are initialized to some default value.

Impossibility of distributed consensus with one faulty process

In this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process.

The Anonymous Consensus Hierarchy and Naming Problems

This paper investigates whether the assumption of unique identifiers is essential for wait-free distributed computing using shared objects of various types and studies the anonymous solvability of two key problems, consensus and naming.

How to Break MD5 and Other Hash Functions

A new powerful attack on MD5 is presented, which unlike most differential attacks, does not use the exclusive-or as a measure of difference, but instead uses modular integer subtraction as the measure.

Distributed Computing: Fundamentals, Simulations and Advanced Topics

This chapter discusses how to improve the Fault Tolerance of Algorithms in Message-Passing Systems andSimulating Synchrony, and some of the approaches taken in this chapter to achieve this aim.

On the Importance of Having an Identity or is Consensus Really Universal?

It is shown that Naming-the existence of distinct IDs known to all- is a necessary assumption of Herlihy's universality result for Consensus and Naming is harder than Consensus.