Distributed agreement in the presence of processor and communication faults
IEEE Transactions on Software Engineering
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Proceedings of CRYPTO 84 on Advances in cryptology
STOC '87 Proceedings of the nineteenth 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)
A General Theory of Composition for a Class of "Possibilistic" Properties
IEEE Transactions on Software Engineering
A tradeoff between safety and liveness for randomized coordinated attack
Information and Computation
Optimistic protocols for fair exchange
Proceedings of the 4th ACM conference on Computer and communications security
Distributed Algorithms
Detectable byzantine agreement secure against faulty majorities
Proceedings of the twenty-first annual symposium on Principles of distributed computing
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Abuse-Free Multi-party Contract Signing
Proceedings of the 13th International Symposium on Distributed Computing
Secure Computation without Agreement
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Round-Optimal and Abuse Free Optimistic Multi-party Contract Signing
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Efficient Fair Exchange with Verifiable Confirmation of Signatures
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Off-Line Fair Payment Protocols Using Convertible Signatures
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Secure Group Barter: Multi-party Fair Exchange with Semi-Trusted Neutral Parties
FC '98 Proceedings of the Second International Conference on Financial Cryptography
Exploring Fair Exchange Protocols Using Specification Animation
ISW '00 Proceedings of the Third International Workshop on Information Security
Supporting fair exchange in mobile environments
Mobile Networks and Applications - Security in mobile computing environments
Multi-Party Fair Exchange with an Off-Line Trusted Neutral Party
DEXA '99 Proceedings of the 10th International Workshop on Database & Expert Systems Applications
Polynomial Fairness and Liveness
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Optimal early stopping uniform consensus in synchronous systems with process omission failures
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
A Family of Trusted Third Party Based Fair-Exchange Protocols
IEEE Transactions on Dependable and Secure Computing
Orchestrating fair exchanges between mutually distrustful web services
Proceedings of the 3rd ACM workshop on Secure web services
Fair Exchange Is Incomparable to Consensus
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Nuovo DRM Paradiso: Designing a Secure, Verified, Fair Exchange DRM Scheme
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
Nuovo DRM paradiso: towards a verified fair DRM scheme
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Secure failure detection in TrustedPals
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Dependability metrics
A topological condition for solving fair exchange in byzantine environments
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
An optimistic NBAC-Based fair exchange method for arbitrary items
CARDIS'06 Proceedings of the 7th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications
Revisiting failure detection and consensus in omission failure environments
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
TrustedPals: secure multiparty computation implemented with smart cards
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Optimal randomized fair exchange with secret shared coins
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Nuovo DRM Paradiso: Designing a Secure, Verified, Fair Exchange DRM Scheme
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
From crash-stop to permanent omission: automatic transformation and weakest failure detectors
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Hi-index | 0.00 |
The fair exchange problem is key to trading electronic items in systems of mutually untrusted parties. In modern variants of such systems, each party is equipped with a security module. The security modules trust each other but can only communicate by exchanging messages through their untrusted host parties, that could drop those messages. We describe a synchronous algorithm that ensures deterministic fair exchange if a majority of parties are honest, which is optimal in terms of resilience. If there is no honest majority, our algorithm degrades gracefully: it ensures that the probability of unfairness can be made arbitrarily low. Our algorithm uses, as an underlying building block, an early-stopping subprotocol that solves, in a general omission failure model, a specific variant of consensus we call biased consensus. Interestingly, this modular approach combines concepts from both cryptography and distributed computing, to derive new results on the classical fair exchange problem.