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 15 of 15 for “"Byzantine Failures"”.
-
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 …
-
Network-aware mechanisms for tolerating Byzantine failures in distributed systems
… For the point-to-point model, we mainly consider Byzantine agreement algorithms. We develop algorithms that require only O(nL) total bits of communication for achieving agreement of L bits among n nodes for sufficiently large L, without making any cryptographic assumption. Previous algorithms …
-
The lattice agreement problem in distributed systems
… message passing systems with only crash failures. Then we switch our attention to message passing systems with Byzantine failures. At last, we explore the application of lattice agreement in implementing linearizable and sequentially consistent snapshot objects.
-
Replicating multithreaded services
… protocols that tolerate a wide range of failures (from simple crashes to malicious "Byzantine" failures) in a wide range of settings (e.g. synchronous or asynchronous communication, with or without stable storage), optimizing various metrics (e.g. number of messages, latency, throughput). …
-
Safe Permissionless Consensus
… with probability 1, under general omission failures. It operates under a \emph{hybrid synchronous} communication model, where, despite the unknown number and dynamic participation of nodes, a majority are consistently correct and synchronously connected. Further building on the framework of …
-
The weighted Byzantine Agreement Problem
This report presents a weighted version of the Byzantine Agreement Problem and its solution under various conditions. In this version, each machine is assigned a weight depending on the application. Instead of assuming that at most $f$ out of $N$ machines fail, the algorithm assumes that the total …
-
Robust and Efficient Federated Learning Algorithms against Adaptive Model Poisoning Attacks
… attacks. However, FL systems are vulnerable to Byzantine failures due to the distributed operation. Byzantine failures include various types of failures in distributed systems such as poisoning attacks, malicious users, software bugs, communication delays, hacked machines etc. This thesis …
-
Defending distributed systems against adversarial attacks: consensus, consensus-based learning, and statistical learning
… consensus to be achievable in the presence of Byzantine components. Our results bridge the gap of previous work. (2) Consensus-Based Learning: We propose, to the best of our knowledge, consensus-based Byzantine-tolerant learning problems: Consensus-Based Multi-Agent Optimization and …
-
Protocols for Building Secure and Scalable Decentralized Applications
… of distributed systems and enables tolerating Byzantine failures. However, current protocols for such decentralized ledgers are limited in performance as they require every participant of the protocol to execute and validate every operation. Because of this, systems such as Bitcoin or Ethereum …
-
Efficient and Scalable Consensus Algorithms
… algorithms typically operate under benign failures (Crash Fault Tolerance (CFT)) and Byzantine failures (Byzantine Fault Tolerance (BFT)). This thesis proposes two approaches, Cabinet and PrestigeBFT, to improve the efficiency of replication consensus under CFT and view-change consensus …
-
Toward communication-efficient and secure distributed machine learning
… the distributed system vulnerable to systematic failures and malicious attacks. In this dissertation, we aim to find new approaches to make distributed SGD faster and more secure. We present four main parts of research. We first study approaches for reducing the communication overhead, including …
-
Robust peer-to-peer systems
… administrative domains, and thus vulnerable to Byzantine failures and users who may act selfishly. This dissertation explores how to construct p2p systems to tolerate Byzantine participants while also incentivizing selfish participants to contribute resources. We describe how to balance …
-
Towards better asynchronous systems: advances in cryptography and distributed protocols
… within the asynchronous setting. 1.Asynchronous Byzantine reliable broadcast (BRB) protocols enable a dealer to send a message to n parties in a consistent way, even in the presence of Byzantine failures. If a message is accepted as valid by an honest party, then all honest parties will also …
-
Security and privacy in resource constrained wireless networks
… incorrect reporting of signal measurement due to byzantine failures. The first is a multi-fusion based distributed spectrum sensing (MFDSS) using reputation propagation. In the second solution, a continuously evolving virtual neighbor cluster of past neighbor devices aid in validating the input …
-
System support for the fault tolerance, testing and orchestration of drone applications
… first part of the thesis, we focus on tolerating failures critical to the target mission in application scenarios where a centralized mission controller entity is responsible for executing the application logic by coordinating a team of drones via high-level commands. We propose an active …