Fair exchange is incomparable to consensus

S.M. Orzan, M. Torabi Dashti

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

1 Citation (Scopus)


In asynchronous systems where processes are prone to crash failures, we show that fair exchange is incomparable to distributed consensus. By incomparability we mean there exist failure detector classes that solve fair exchange and not distributed consensus, and vice versa. Remarkably, this is in contrast to the folklore belief that solving fair exchange is generally harder than solving distributed consensus.
Original languageEnglish
Title of host publicationTheoretical Aspects of Computing - ICTAC 2008 (5th International Colloquium, Istanbul, Turkey, September 1-3, 2008, Proceedings)
EditorsJ.S. Fitzgerald, A.E. Haxthausen, H. Yenigun
Place of PublicationBerlin
ISBN (Print)978-3-540-85761-7
Publication statusPublished - 2008

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743


Dive into the research topics of 'Fair exchange is incomparable to consensus'. Together they form a unique fingerprint.

Cite this