Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Efficient Algorithms for System Diagnosis with Both Processor and Comparator Faults
IEEE Transactions on Parallel and Distributed Systems
Relative Signatures for Fault Tolerance and their Implementation
EDCC-1 Proceedings of the First European Dependable Computing Conference on Dependable Computing
On Distributed System-Level Self-Diagnosis
Fehlertolerierende Rechensysteme / Fault-Tolerant Computing Systems, Automatisierungssysteme, Methoden, Anwendungen / Automation Systems, Methods, Applications; 4. Internationale GI/ITG/GMA-Fachtagung
A multiple bus broadcast protocol resilient to non-cooperative Byzantine faults
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
Fault-Tolerant Broadcasts in CAN
FTCS '98 Proceedings of the The Twenty-Eighth Annual International Symposium on Fault-Tolerant Computing
Avoiding the Babbling-Idiot Failure in a Time-Triggered Communication System
FTCS '98 Proceedings of the The Twenty-Eighth Annual International Symposium on Fault-Tolerant Computing
Streets of Byzantium: Network Architectures for Fast Reliable Broadcasts
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
Agreement problems like interactive consistency, reliable broadcast, group membership, etc. require a high protocol overhead when they must be solved under general (and thus hard) fault assumptions. Known signature methods contribute to more efficient solutions by protecting forwarded information from being altered undetectably. This paper presents a new signature generation technique, which prevents the occurrence of malicious Byzantine faults in the sender with very high probability. Hence, it is not necessary to exchange multicast messages among the receivers for an equality check. This advantage opens an extended design space of agreement protocols with fewer messages, fewer timeouts and thus lower execution times. The new unique signature generation algorithm (called UniSig) is based on alternately stepwise generation of coded sequence numbers and digital signatures. Different messages cannot obtain the same valid signature, because the steps to increment the coded sequence number are included in UniSig. Deviations from the program execution path are very likely to lead to detectably corrupted signatures. Hence, for each sequence number a valid signature can be generated only once.