Message authentication with one-way hash functions
ACM SIGCOMM Computer Communication Review
Practical Byzantine fault tolerance
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
Practical byzantine fault tolerance and proactive recovery
ACM Transactions on Computer Systems (TOCS)
A Quorum-Based Extended Group Mutual Exclusion Algorithm without Unnecessary Blocking
ICPADS '04 Proceedings of the Parallel and Distributed Systems, Tenth International Conference
Fault-scalable Byzantine fault-tolerant services
Proceedings of the twentieth ACM symposium on Operating systems principles
HQ replication: a hybrid quorum protocol for byzantine fault tolerance
OSDI '06 Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7
Zyzzyva: speculative byzantine fault tolerance
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
A Byzantine Fault Tolerant Distributed Commit Protocol
DASC '07 Proceedings of the Third IEEE International Symposium on Dependable, Autonomic and Secure Computing
Classification and generation of disturbance vectors for collision attacks against SHA-1
Designs, Codes and Cryptography
| Hi-index | 0.00 |
This paper presents an authentication-based Byzantine fault tolerant agreement protocol that is capable of detecting the tentative failures in transaction processing systems. The protocol employs a cryptographic hash function to detect crash as well as a few more types of commonly faced arbitrary behaviours manifested by the participating server replicas in the system. We show that the use of hash functions can successfully handle various types of arbitrary faults. In addition, it suggests a preemptive mechanism to proactively detect the malicious replicas. The protocol avoids frequent view changes that contributes to the liveness of the system and ensures continuity in transaction processing.