Optimal algorithms for Byzantine agreement
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)
Failure Detection and Consensus in the Crash-Recovery Model
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Encapsulating Failure Detection: From Crash to Byzantine Failures
Ada-Europe '02 Proceedings of the 7th Ada-Europe International Conference on Reliable Software Technologies
Fair Computation of General Functions in Presence of Immoral Majority
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Bounds on information exchange for Byzantine Agreement
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
ACM SIGecom Exchanges
Simple and fast optimistic protocols for fair electronic exchange
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Optimistic fair contract signing for Web services
Proceedings of the 2003 ACM workshop on XML security
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
Implementing Fair Non-repudiable Interactions with Web Services
EDOC '05 Proceedings of the Ninth IEEE International EDOC Enterprise Computing Conference
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
Building reliable mix networks with fair exchange
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
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
| Hi-index | 0.00 |
In this paper, we propose a modular and fully decentralized protocol to orchestrate fair exchanges between mutually distrustful yet collaborating web services. Our motivation roots in the observation that fair exchange is a key problem in settings where mutually distrustful entities are willing to exchange critical digital items in the absence of a trusted third party, which is typically the case of web services collaborating on a peer-to-peer basis. Examples of such scenarios include multiparty exchanges of security information (e.g., cryptographic keys), multiparty sharing of digital rights (e.g., to display some digital content), digital contract signing, etc. Our fair exchange orchestration protocol is based on two key building blocks, namely a tamperproof secure box and a module solving the well-known Byzantine agreement problem. The tamperproof secure boxes need not communicate directly with each other and are only required in a limited number of key steps of our algorithm. Our approach has the advantage to allow fair exchanges to complete even though truly malicious participants have aborted.