Fair Exchange Is Incomparable to Consensus

DOI10.1007/978-3-540-85762-4_24zbMath1161.68347OpenAlexW1502046895MaRDI QIDQ5505613

Mohammad Torabi Dashti, Simona Orzan

Publication date: 27 January 2009

Published in: Theoretical Aspects of Computing - ICTAC 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85762-4_24

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Easy impossibility proofs for distributed consensus problems
• Optimal efficiency of optimistic contract signing
• Impossibility of distributed consensus with one faulty process
• On the security of public key protocols
• Unreliable failure detectors for reliable distributed systems
• The weakest failure detector for solving consensus
• Fair Exchange
• Introduction to Distributed Algorithms
• Non-blocking atomic commit in asynchronous distributed systems with failure detectors
• Financial Cryptography and Data Security

This page was built for publication: Fair Exchange Is Incomparable to Consensus