Hash-based Byzantine fault tolerant agreement with enhanced view consistency
by Poonam Saini; Awadhesh Kumar Singh
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 12, No. 2, 2014

Abstract: 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.

Online publication date: Sat, 21-Jun-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Communication Networks and Distributed Systems (IJCNDS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com