Search Results

An ideal permissionless consensus protocol would, in addition to satisfying standard consistency and liveness guarantees, render consistency violations prohibitively expensive for the attacker without collateral damage to honest participants---for ...

With the proliferation of blockchain technology in high-value sectors, consensus protocols are becoming critical infrastructures. The rapid innovation cycle in Byzantine fault tolerant (BFT) consensus protocols has culminated in HotStuff, which provides ...

Byzantine fault-tolerant state machine replication (SMR) protocols, such as PBFT, HotStuff, and Jolteon, are essential for modern blockchain technologies. However, they are challenging to implement correctly because they have to deal with any unexpected ...

We address the self-stabilizing bit-dissemination problem, designed to capture the challenges of spreading information and reaching consensus among entities with minimal cognitive and communication capacities. Specifically, a group of n agents is ...

Achieving consensus is a challenging and ubiquitous problem in distributed systems that is only made harder by the introduction of malicious byzantine servers. While significant effort has been devoted to the benign and byzantine failure models ...

In the high-stakes race for scalability, some blockchains have turned to committee-based consensus (CBC), whereby the chain’s recordkeeping rights are entrusted to a committee of block producers elected via approval voting. Smaller committees boost speed ...

How to efficiently and reliably spread information in a system is one of the most fundamental problems in distributed computing. Recently, inspired by biological scenarios, several works focused on identifying the minimal communication resources ...

Finding the right abstraction is critical for reasoning about complex systems such as distributed protocols like Paxos and Raft. Despite a recent abundance of impressive verification work in this area, we claim the ways that past efforts model ...

Blockchain technology and related frameworks have recently received extensive attention. Blockchain systems use multi-party consensus protocols to reach agreements on transactions. Hyperledger Fabric framework exposes a multi-party consensus, based on ...

In recent times, blockchain has encouraged innovations to handle challenges in many practical applications in which traditional approaches are not found to be successful. This work has proposed a game theory-based approach for consensus building in a ...

Current leader-based Byzantine fault-tolerant (BFT) protocols aim to improve the efficiency for achieving consensus while tolerating failures; however, Byzantine servers are able to repeatedly impair BFT systems as faulty servers launch attacks without ...

Blockchains are intended to be immutable, so an attacker who is able to delete transactions through a chain reorganization (a malicious reorg) can perform a profitable double-spend attack. We study the rate at which an attacker can execute reorgs in the ...

In this paper, we present the progress of blockchain technology from the advent of the original publication titled “Bitcoin: A Peer-to-Peer Electronic Cash System,” written by the mysterious Satoshi Nakamoto, until the current days. Historical background ...

We design and implement TwinsCoin, the first cryptocurrency based on a provably secure and scalable public blockchain design using both proof-of-work and proof-of-stake mechanisms. Different from the proof-of-work based Bitcoin, our construction uses ...

Many multi-agent coordination problems can be understood as autonomous local choices between a finite set of options, with each local choice undertaken simultaneously without explicit coordination between decision-makers, and with a shared goal of ...

We provide a protocol for real-valued average consensus by networks of agents which exchange only a single message from the ternary alphabet $\{-1,0,1\}$ between neighbors at each step. Our protocol works on time-varying undirected graphs subject to a ...

In this paper, an optimal control design strategy for guaranteeing consensus achievement in a network of multiagent systems is developed. Minimization of a global cost function for the entire network guarantees a stable consensus with an optimal control ...

The modeling of switching systems describing networks where death and duplication processes occur is described. A dissensus protocol, complementary to consensus protocol, is introduced and the convergence or divergence of the agents' state evolution is ...

This paper studies design, convergence, stability and optimality of a distributed consensus protocol for n-player repeated non cooperative games under incomplete information. Information available to each player concerning the other players' strategies ...

The design of most distributed consensus protocols doesnot take into account the fact that, over time, the differentprocesses running the protocol are subject to a varyingavailability of processing and communication resources.Because of that, ...