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 20 of 21 for “"Byzantine faults"”.

  1. Secure Harmonized Speed Under Byzantine Faults for Autonomous Vehicle Platoons Using Blockchain Technology

    … and maintain secure, cooperative behavior. Byzantine behavior [1,2], characterized by vehicles transmitting incorrect or conflicting information, threatens the integrity of platoon coordination. Vehicles within the platoon share vital data such as position, speed, and other relevant …

    waterloo Repository record for Secure Harmonized Speed Under Byzantine Faults for Autonomous Vehicle Platoons Using Blockchain Technology (opens in a new tab)

  2. Highly available storage with minimal trust

    … (system crashes, power out- ages etc.) and Byzantine faults (memory or disk corruption, software or configuration errors etc.) plague the availability of these services. Furthermore, the goal of high availability conflicts with our desire to provide good performance and strong correctness …

    texas Repository record for Highly available storage with minimal trust (opens in a new tab)

  3. Fault tolerant pulse synchronization

    … to this algorithm for tolerating arbitrary or Byzantine faults of nodes. Our algorithm queues up all the firings heard in the current cycle and discards outliers at the end of the cycle. An adjustment is computed with the remaining values and used as a starting point of the next cycle. Through …

    tamu Repository record for Fault tolerant pulse synchronization (opens in a new tab)

  4. 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 …

    uiuc Repository record for Eventual fault recovery strategies for Byzantine failures (opens in a new tab)

  5. Byzantine fault tolerance in autonomous robots evacuation problems

    … circle addressing scenarios that involve f crash faults or one Byzantine fault. We extend the discussion to circle evacuation under one and two Byzantine faults and under f Byzantine faults presenting detailedalgorithms and conducting an in-depth analysis of their time requirements.

    greece Repository record for Byzantine fault tolerance in autonomous robots evacuation problems (opens in a new tab)

  6. BUILDING AND MAINTAINING STRUCTURE IN DISTRIBUTED NETWORKS

    … distributed networks, prioritizing efficiency, Byzantine fault tolerance, and recovery. To address modern routing challenges, the research introduces a branching random walk algorithm that localizes complexity to subnetworks, achieving routing overhead factors subpolynomial in the subnetwork …

    nus Repository record for BUILDING AND MAINTAINING STRUCTURE IN DISTRIBUTED NETWORKS (opens in a new tab) Download file for BUILDING AND MAINTAINING STRUCTURE IN DISTRIBUTED NETWORKS (opens in a new tab)

  7. Anchor: Bridging the Gap between Paxos Efficiency and Raft Simplicity

    … σε απλές διακοπές λειτουργίας κόμβων (crash faults), αποφεύγοντας έτσι το πρόσθετο κόστος μηχανισμών που χειρίζονται κόμβους με αυθαίρετη ή κακόβουλη συμπεριφορά (byzantine faults). Εστιάζει στην απόδοση, την κλιμάκωση και την εύκολη υλοποίηση. Χρησιμοποιεί κυκλική εναλλαγή ηγεσίας και κάθε …

    athens Repository record for Anchor: Bridging the Gap between Paxos Efficiency and Raft Simplicity (opens in a new tab)

  8. Byzantine-tolerant erasure coding for blockchains

    … problem in distributed networks vulnerable to Byzantine faults—scenarios where network components may fail or behave maliciously. Both solutions employ advanced erasure coding and cryptographic schemes to ensure reliable data transfer and integrity verification. Aurora utilizes Maximum Distance …

    ubc Repository record for Byzantine-tolerant erasure coding for blockchains (opens in a new tab) Download PDF for Byzantine-tolerant erasure coding for blockchains (opens in a new tab)

  9. 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 …

    uiuc Repository record for Exact Byzantine consensus under local-broadcast channels (opens in a new tab)

  10. 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 …

    unlv Repository record for Asynchronous neighborhood task synchronization (opens in a new tab) Download PDF for Asynchronous neighborhood task synchronization (opens in a new tab)

  11. Byzantine fault tolerant web applications using the UpRight library

    … tolerant protocols in order to tolerate crash faults. However, recent system-wide failures have been caused by arbitrary or Byzantine faults which these applications are not capable of handling. Despite the abundance of research on adding Byzantine fault tolerance (BFT) to a system, BFT systems …

    texas Repository record for Byzantine fault tolerant web applications using the UpRight library (opens in a new tab)

  12. 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 …

    uiuc Repository record for Parsimonious Service Replication for Tolerating Malicious Attacks in Asynchronous Environments (opens in a new tab)

  13. Efficient and Scalable Consensus Algorithms

    … 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 under BFT, respectively. Specifically, Cabinet …

    toronto-retro Repository record for Efficient and Scalable Consensus Algorithms (opens in a new tab)

  14. Understanding, evaluating, and improving the availability of BFT protocols

    … must run correctly and continuously despite faults—deviations can lead to the loss of money, sensitive information, and even human life. Most commercial systems only tolerate benign faults, where a faulty component stops participating in the system as soon as it fails. However, these services …

    rice Repository record for Understanding, evaluating, and improving the availability of BFT protocols (opens in a new tab)

  15. Self-Stabilizing Byzantine Fault-Tolerant State Machine Replication - Rust Implementation, Experimental Evaluation and Applications in Trucks

    … framework of Dolev et al., which considers both Byzantine faults and arbitrary transient faults. Our evaluation shows that the latency of the global reset algorithm is around four times the slowest network round trip time of the participating nodes.

    chalmers Repository record for Self-Stabilizing Byzantine Fault-Tolerant State Machine Replication - Rust Implementation, Experimental Evaluation and Applications in Trucks (opens in a new tab)

  16. Reducing Costs Of Byzantine Fault Tolerant Distributed Applications

    Byzantine fault tolerance (BFT) is a powerful technique for building software that tolerates arbitrary failures. The technique has been developed since the 70s and has a rich research literature. Yet no production system has adopted the technique, despite an increasing need from today's large and …

    cornell Repository record for Reducing Costs Of Byzantine Fault Tolerant Distributed Applications (opens in a new tab)

  17. Deterministic byzantine-resilient robot gathering

    Gathering is a fundamental problem in the field of mobile robot algorithms. The goal is to gather the robots at a single point, which can be useful for sharing information or coordinating future actions. In this thesis, we consider models in which m robots are placed at nodes in a graph of size n, …

    manitoba Repository record for Deterministic byzantine-resilient robot gathering (opens in a new tab)

  18. 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 …

    vt Repository record for Scalable Byzantine State Machine Replication: Designs, Techniques, and Implementations (opens in a new tab)

  19. Secure Time-Aware Provenance for Distributed Systems

    Operators of distributed systems often find themselves needing to answer forensic questions, to perform a variety of managerial tasks including fault detection, system debugging, accountability enforcement, and attack analysis. In this dissertation, we present Secure Time-Aware Provenance (STAP), a …

    penn Repository record for Secure Time-Aware Provenance for Distributed Systems (opens in a new tab)

  20. Resource-Efficient Communication in the Presence of Adversaries

    … device to all others in a WSN in the presence of faults; this is the problem of reliable broadcast. Second, we examine how our algorithms can mitigate application-level distributed denial-of-service attacks in wired client-server scenarios. The second major result deals with a single-hop …

    waterloo Repository record for Resource-Efficient Communication in the Presence of Adversaries (opens in a new tab)

Page 1 of 2