Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Value exchange systems enabling security and unobservability
Computers and Security
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)
Fair exchange with a semi-trusted third party (extended abstract)
Proceedings of the 4th ACM conference on Computer and communications security
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Efficient verifiable encryption (and fair exchange) of digital signatures
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Round-Optimal and Abuse Free Optimistic Multi-party Contract Signing
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Fair Computation of General Functions in Presence of Immoral Majority
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
ACM SIGecom Exchanges
Simple and fast optimistic protocols for fair electronic exchange
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
ExchangeGuard: A Distributed Protocol for Electronic Fair-Exchange
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Efficient Byzantine Broadcast in Wireless Ad-Hoc Networks
DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
An anonymous and failure resilient fair-exchange e-commerce protocol
Decision Support Systems
On fairness in exchange protocols
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Gracefully degrading fair exchange with security modules
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
Optimistic fair exchange of digital signatures
IEEE Journal on Selected Areas in Communications
Fair Exchange Is Incomparable to Consensus
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
| Hi-index | 0.00 |
In this paper, we study the solvability of fair exchange in the context of Byzantine failures. In doing so, we first present a generic model with trusted and untrusted processes, and propose a specification of the fair exchange problem that clearly separates safety and liveness, via fine-grained properties. We then show that the solvability of fair exchange depends on a necessary and sufficient topological condition, which we name the reachable majority condition. The first part of this result, i.e., the condition is necessary, was shown in a companion paper and is briefly recalled here. The second part, i.e., the condition is sufficient, is the focal point of this paper. The correctness proof of this second part consists in proposing a solution to fair exchange in the aforementioned model.