Brief announcement: byzantine agreement with homonyms

Authors:
Carole Delporte-Gallet;Hugues Fauconnier;Rachid Guerraoui;Anne-Marie Kermarrec
Affiliations:
University Paris Diderot, PARIS, France;University Paris Diderot, PARIS, France;Ecole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland;INRIA Rennes-Bretagne Atlantique, RENNES, France
Venue:
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Year:
2010

Citing 13
Cited 1

Consensus in the presence of partial synchrony

Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
From binary consensus to multivalued consensus in asynchronous message-passing systems

Information Processing Letters
Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Distributed Algorithms

Distributed Algorithms
Computing in totally anonymous asynchronous shared memory systems

Information and Computation
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Distributed Computing: Fundamentals, Simulations and Advanced Topics

Distributed Computing: Fundamentals, Simulations and Advanced Topics
On the importance of having an identity or, is consensus really universal?

Distributed Computing - Special issue: DISC 04
Efficient Algorithms for Anonymous Byzantine Agreement

Theory of Computing Systems
The anonymous consensus hierarchy and naming problems

OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Stabilizing consensus in mobile networks

DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
How to break MD5 and other hash functions

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques

Byzantine agreement with homonyms

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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, if (and only if) l 3t, in an asynchronous model.