A randomized protocol for signing contracts
Communications of the ACM
Easy impossibility proofs for distributed consensus problems
Distributed Computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Introduction to distributed algorithms
Introduction to distributed algorithms
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
Atomicity in electronic commerce
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Optimal efficiency of optimistic contract signing
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Fairness in electronic commerce
Fairness in electronic commerce
Avoiding loss of fairness owing to failures in fair data exchange systems
Decision Support Systems
Inductive methods and contract-signing protocols
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Distributed Algorithms
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Secure Group Barter: Multi-party Fair Exchange with Semi-Trusted Neutral Parties
FC '98 Proceedings of the Second International Conference on Financial Cryptography
Exclusion-Freeness in Multi-party Exchange Protocols
ISC '02 Proceedings of the 5th International Conference on Information Security
A Different Look at Secure Distributed Computation
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Simple and fast optimistic protocols for fair electronic exchange
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Non-blocking atomic commit in asynchronous distributed systems with failure detectors
Distributed Computing
A Family of Trusted Third Party Based Fair-Exchange Protocols
IEEE Transactions on Dependable and Secure Computing
A formal model of rational exchange and its application to the analysis of Syverson's protocol
Journal of Computer Security - Special issue on CSFW15
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
A topological condition for solving fair exchange in byzantine environments
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
FC'05 Proceedings of the 9th international conference on Financial Cryptography and Data Security
Gracefully degrading fair exchange with security modules
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
TrustedPals: secure multiparty computation implemented with smart cards
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
| Hi-index | 0.00 |
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.