Distributed agreement in the presence of processor and communication faults
IEEE Transactions on Software Engineering
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
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)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
Failure detectors in omission failure environments
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Specification and verification of fault-tolerance, timing, and scheduling
ACM Transactions on Programming Languages and Systems (TOPLAS)
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Failure Detectors in Omission Failure Environments
Failure Detectors in Omission Failure Environments
On implementing omega with weak reliability and synchrony assumptions
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Issues of fault tolerance in concurrent computations (databases, reliability, transactions, agreement protocols, distributed computing)
Communication-efficient leader election and consensus with limited link synchrony
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Gracefully degrading fair exchange with security modules
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
Secure failure detection in TrustedPals
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
On the probabilistic omission adversary
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Brief announcement: an efficient failure detector for omission environments
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The failure detector abstraction
ACM Computing Surveys (CSUR)
Communication-efficient failure detection and consensus in omission environments
Information Processing Letters
Efficient fault tolerant consensus using preemptive token
ACAI '11 Proceedings of the International Conference on Advances in Computing and Artificial Intelligence
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
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 |
It has recently been shown that fair exchange, a security problem in distributed systems, can be reduced to a fault tolerance problem, namely a special form of distributed consensus. The reduction uses the concept of security modules which reduce the type and nature of adversarial behavior to two standard fault-assumptions: message omission and process crash. In this paper, we investigate the feasibility of solving consensus in asynchronous systems in which crash and message omission faults may occur. Due to the impossibility result of consensus in such systems, following the lines of unreliable failure detectors of Chandra and Toueg, we add to the system a distributed device that gives information about the failure of other processes. Then we give an algorithm using this device to solve the consensus problem. Finally, we show how to implement such a device in an asynchronous system using some weak timing assumptions.