Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 11 of 11 for “"Byzantine Faults"”.
-
Detecting and tolerating Byzantine faults in database systems
… and evaluation of a replication scheme to handle Byzantine faults in transaction processing database systems. The scheme compares answers from queries and updates on multiple replicas which are off-the-shelf database systems, to provide a single database that is Byzantine fault tolerant. The …
-
Computing network coordinates in the presence of Byzantine faults
… these systems do not behave well when nodes are Byzantine. These Byzantine failures, wherein a faulty node can behave arbitrarily, can make the coordinate-based distance estimates meaningless. For example, a Byzantine node can delay responding to some other node, thus distorting that node's …
-
Eventual fault recovery strategies for Byzantine failures
Byzantine faults in distributed systems can have very destructive consequences for services built on top of these systems but are not commonly tolerated in production systems due to the overhead and scalability limitations with existing approaches such as Byzantine fault tolerance. This work …
-
Randomized algorithms for reliable broadcast
… of two efficient randomized protocols for Byzantine agreement, a classical problem in distributed computing. Byzantine agreement is the problem of simulating the reliable broadcast functionality in a network where all communication is person-to-person. We design two randomized Byzantine …
-
Exact Byzantine consensus under local-broadcast channels
… the problem of achieving exact consensus with Byzantine faults under a local-broadcast communication channel. We prove necessary and sufficient conditions on the underlying communication graph to achieve consensus. We show that under this model consensus is possible on undirected graphs that …
-
Practical Mobile Proactive Secret Sharing
… with dynamic redistribution that can adapt to Byzantine faults and remain secure for the duration of long-lived systems. This thesis describes the simulation, testing, and evaluation of the MPSS protocol to better understand the performance trade-offs and practicality of secret sharing …
-
Asynchronous neighborhood task synchronization
Faults are likely to occur in distributed systems. The motivation for designing self-stabilizing system is to be able to automatically recover from a faulty state. As per Dijkstra's definition, a system is self-stabilizing if it converges to a desired state from an arbitrary state in a finite …
-
Parsimonious Service Replication for Tolerating Malicious Attacks in Asynchronous Environments
… subject of tolerance of the most severe kind of faults, namely Byzantine faults, through state machine replication in asynchronous environments such as the Internet. In Byzantine-fault-tolerant (BFT) state machine replication, state consistency among the replicas of a service is maintained by …
-
Authentication in a reconfigurable Byzantine fault tolerant system
Byzantine (i.e. arbitrary) faults occur as a result of software errors and malicious attacks; they are increasingly a problem as people come to depend more and more on online services. Systems that provide critical services must behave correctly in the face of Byzantine faults. Correct service in …
-
Scalable Byzantine State Machine Replication: Designs, Techniques, and Implementations
… and adversarial behaviors as well as non-crash faults such as software bugs. The Byzantine fault-tolerance (BFT) model and its trust-based variant, the hybrid model, permit stronger failure adversaries. However, state-of-the-art Byzantine and hybrid consensus protocols have performance …
-
Selfishness and Malice in Distributed Systems
Large-scale distributed systems are increasingly prevalent. Two issues can impact the performance of such systems: selfishness and malice. Selfish players can reduce social welfare of games, and malicious nodes can disrupt networks. In this dissertation, we provide algorithms to address both of …