On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communications of the ACM
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
ACM SIGecom Exchanges
Simple and fast optimistic protocols for fair electronic exchange
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Orchestrating fair exchanges between mutually distrustful web services
Proceedings of the 3rd ACM workshop on Secure web services
A topological condition for solving fair exchange in byzantine environments
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
Risk balance in optimistic non-repudiation protocols
FAST'11 Proceedings of the 8th international conference on Formal Aspects of Security and Trust
| Hi-index | 0.00 |
Electronic fair-exchange protocols have received significant attention from the research community in the recent past. In loose terms, the fair exchange problem is defined as atomically exchanging electronic items between two parties. All the known fair exchange protocols today utilize a centralized trusted third party server either actively or passively. In this paper, we propose a distributed protocol for exchange of electronic items using untrusted servers. We perform detailed security analysis and show that the protocol guarantees effectiveness and fairness with Byzantine failures of up to one third of the untrusted servers. We also give the probability of a fair exchange otherwise. Finally we discuss how to deploy the protocol to large online electronic communities and peer-to-peer systems and demonstrate its security guarantees, scalability and load balancing properties.