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 17 of 17 for “"Byzantine Fault Tolerant"”.
-
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 …
-
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 …
-
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.
-
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, …
-
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 …
-
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 …
-
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 …
-
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 …
-
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 …
-
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 …
-
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 …
-
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 …
-
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 …
-
Towards Fast and Adaptive Byzantine State Machine Replication for Planetary-Scale Systems
… for building resilient distributed systems. In Byzantine fault-tolerant (BFT) systems, no concrete assumptions are made about the behavior of faulty replicas. With the advancement of distributed ledger technologies (DLT), planetary-scale BFT SMR ist becoming practical and necessary as it can …
-
Improving Performance of Byzantine State Machine Replication through Self-Adaptation
Byzantine Fault-Tolerant (BFT) State Machine Replication (SMR) provides strong resilience against faults and intrusions, making it a solid foundation for building dependable distributed systems. However, its practical adoption remains limited due to several challenges: high operational costs …
-
Blockchain and Distributed Consensus: From Security Analysis to Novel Applications
… data mining technique called truth discovery and Byzantine fault-tolerant consensus to enable decentralized nodes to collectively extract truthful information from data submitted by untrusted external sources. In the second effort, we harness the security offerings of blockchain's smart contract …
-
Design, Implementation and Experiments for Moving Target Defense Framework
The traditional defensive security strategy for distributed systems employs well-established defensive techniques such as; redundancy/replications, firewalls, and encryption to prevent attackers from taking control of the system. However, given sufficient time and resources, all these methods can …