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 30 for “"Byzantine fault"”.

  1. Practical Byzantine fault tolerance

    Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 2001.

    mit Repository record for Practical Byzantine fault tolerance (opens in a new tab)

  2. Combining abstraction with Byzantine fault-tolerance

    Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001.

    mit Repository record for Combining abstraction with Byzantine fault-tolerance (opens in a new tab)

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

    mit Repository record for Authentication in a reconfigurable Byzantine fault tolerant system (opens in a new tab)

  4. A scalable Byzantine fault tolerant secure domain name system

    … we present the design and implementation of a Byzantine-fault-tolerant domain name system. The system consists of 3f+1 tightly coupled name servers and guarantees safety and liveness properties assuming no more than f replicas are faulty within a small window of vulnerability. To authenticate …

    mit Repository record for A scalable Byzantine fault tolerant secure domain name system (opens in a new tab)

  5. Using a Byzantine-fault-tolerant algorithm to provide a secure DNS

    Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.

    mit Repository record for Using a Byzantine-fault-tolerant algorithm to provide a secure DNS (opens in a new tab)

  6. A synchronous communication system for a software-based Byzantine fault tolerant computer

    This thesis describes the redesign of a Byzantine-resilient, quad-redundant computer to remove proprietary hardware components. The basic architecture consists of four Commercial Off-The-Shelf (COTS) processors in a completely-connected network of point-to-point ethernet connections. In particular, …

    mit Repository record for A synchronous communication system for a software-based Byzantine fault tolerant computer (opens in a new tab)

  7. Generalized Consensus for Practical Fault-Tolerance

    Despite extensive research on Byzantine Fault Tolerant (BFT) systems, overheads associated with such solutions preclude widespread adoption. Past efforts such as the Cross Fault Tolerance (XFT) model address this problem by making a weaker assumption that a majority of processes are correct and …

    vt Repository record for Generalized Consensus for Practical Fault-Tolerance (opens in a new tab)

  8. 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)

  9. HQ replication

    There are currently two approaches to providing Byzantine-fault-tolerant state machine replication: an agreement-based approach, e.g., BFT, that uses communication between replicas to agree on a proposed ordering of requests, and a quorum-based approach, such as Q/U, in which clients contact …

    mit Repository record for HQ replication (opens in a new tab)

  10. Liveness analysis, modeling, and simulation of blockchain consensus algorithms' ability to tolerate malicious miners

    … is used to provide a liveness analysis of byzantine consensus algorithms for permissioned blockchains. We provide a Digital Ledger Technologies (DLTs) consensus algorithm classification to understand the miner-selection process. We compile the ``security ingredients'' that enable consensus …

    utc Repository record for Liveness analysis, modeling, and simulation of blockchain consensus algorithms' ability to tolerate malicious miners (opens in a new tab)

  11. Scaling asynchronous multi-party computation: A systems perspective

    … an infrastructure which is end-to-end robust, fault-tolerant and scalable. Unfortunately, existing frameworks fail to satisfy all of these requirements. Hence, many MPC applications are not yet practical due to the lack of an MPC framework that meets these needs. This work presents a scalable …

    uiuc Repository record for Scaling asynchronous multi-party computation: A systems perspective (opens in a new tab)

  12. Fault Tolerant Broadcast in Bandwidth-Constrained Networks

    … addresses the problem of achieving scalable fault-tolerant broadcast in networks with limited bandwidth. We begin by examining the limitations of leaderbased protocols, such as HotStuff, which suffer from a leader bottleneck and reduced system throughput as the number of servers increases. To …

    mit Repository record for Fault Tolerant Broadcast in Bandwidth-Constrained Networks (opens in a new tab)

  13. Robust services in dynamic systems

    … This thesis extends previous work on Byzantine-fault-tolerant replication to meet the new requirements of current Internet services: scalability and the ability to reconfigure the service automatically in the presence of a changing system membership. Our solution addresses two …

    mit Repository record for Robust services in dynamic systems (opens in a new tab)

  14. Permissioned blockchain in a supply chain problem

    … this technology can offer through the Practical Byzantine Fault Tolerance consensus (PBFT) that guarantees the correctness of the information. Finally, using a two-sided markets model we provide a preliminary setup of a fee system that creates incentives to enter the platform: the blockchain …

    rosario Repository record for Permissioned blockchain in a supply chain problem (opens in a new tab)

  15. Trustworthy and Efficient Blockchain-based E-commerce Model

    … consensus mechanism named Modified- Practical Byzantine Fault Tolerance (M-PBFT), derived from the Practical Byzantine Fault Tolerance (PBFT) protocol to minimize communication overhead and improve overall efficiency. The modifications primarily target the leader election process and the …

    iupui Repository record for Trustworthy and Efficient Blockchain-based E-commerce Model (opens in a new tab)

  16. The novel Proof of Efficiency (PoEf) Consensus Mechanism: improved efficiency and cybersecurity for Blockchain-based Supply Chain Management Systems.

    … an improvement over the traditional Practical Byzantine Fault Tolerance (PBFT) system. PoEf integrates sharding and a reputation-level score to enhance scalability and security. This mechanism dynamically adjusts the reputation of nodes based on their performance, ensuring high throughput, low …

    uwtsd Repository record for The novel Proof of Efficiency (PoEf) Consensus Mechanism: improved efficiency and cybersecurity for Blockchain-based Supply Chain Management Systems. (opens in a new tab)

  17. ON SCALABILITY OF BLOCKCHAIN TECHNOLOGIES

    … frequent, high-volume interactions. This Byzantine fault tolerant blockchain protocol is robust to extreme churn and shares the same trust model as Bitcoin. We experimentally demonstrate that Bitcoin-NG scales optimally, with bandwidth limited only by the capacity of the individual nodes …

    cornell Repository record for ON SCALABILITY OF BLOCKCHAIN TECHNOLOGIES (opens in a new tab)

  18. Understanding the interaction between reliability and wireless broadcast

    … for reliable com- munication between a fault-free source-destination pair and design Byzantine fault tolerance protocols based on the proposed algorithms. In view of the fact that wireless networks have become an integral part of communication networks, reliability concerns arise when …

    uiuc Repository record for Understanding the interaction between reliability and wireless broadcast (opens in a new tab)

  19. Security for proof of work blockchains via checkpointing

    Finality gadgets are comprised of a Byzantine Fault Tolerant (BFT) protocol finalizing blocks produced by a Proof-of-Work (PoW) or Proof-of-Stake (PoS) chain protocol. They have become very popular methods for combining the best features of the BFT and PoW protocols and are proposed for deployment …

    uiuc Repository record for Security for proof of work blockchains via checkpointing (opens in a new tab)

  20. 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)

Page 1 of 2