Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
A tradeoff between safety and liveness for randomized coordinated attack
Information and Computation
Distributed Algorithms
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Synchronization protocols for reliable communication in fully distributed agent systems
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Hi-index | 0.89 |
In the secure communication problem, we focus on safe termination. In applications such as electronic transactions, we want each party to be ensured that both sides agree on the same state: success or failure. This problem is equivalent to the well-known coordinated attack problem. Solutions exist. They, however, concentrate on the probability of disagreement, and attack incentives have been overlooked so far. Furthermore, they focus on a notion of round and are not optimal in terms of communication complexity. To solve the safe termination problem, we revisit the Keep-in-Touch protocol that we introduced in 2003. Considering the communication complexity, the probability of unsafe termination, and the attack incentive, we prove that the Keep-in-Touch protocol is optimal.