Publications related to Round-Based Consensus Algorithms, Predicate Implementations and Quantitative Analysis

Planetary-Scale Byzantine Fault Tolerance

The scale and pervasiveness of the Internet make it a pillar of planetary communication, industry and economy, as well as a fundamental medium for public discourse and democratic engagement. In stark contrast with the Internet's decentralized infrastructur ...

EPFL2024

Byzantine Fault-Tolerance in Federated Local SGD Under 2f-Redundancy

Nirupam Gupta

In this article, we study the problem of Byzantine fault-tolerance in a federated optimization setting, where there is a group of agents communicating with a centralized coordinator. We allow up to

f

Byzantine-faulty agents, which may not follow a prescr ...

Piscataway2023

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

Rachid Guerraoui, Jovan Komatovic, Pierre Philippe Civit, Vincent Gramoli, Seth Gilbert

In a non-synchronous system with n processes, no t(0)-resilient (deterministic or probabilistic) Byzantine consensus protocol can prevent a disagreement among correct processes if the number of faulty processes is > n - 2t(0). Therefore, the community defi ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2023

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

Rachid Guerraoui, Jovan Komatovic, Pierre Philippe Civit, Vincent Gramoli, Seth Gilbert

It is known that the agreement property of the Byzantine consensus problem among n processes can be violated in a non-synchronous system if the number of faulty processes exceeds t0 = ┌n/3┐ − 1 [10], [19]. In this paper, we investigate the accountable Byza ...

IEEE2022

Rational Agreement in the Presence of Crash Faults

Vincent Gramoli, Alejandro Ranchal Pedrosa

Blockchain systems need to solve consensus despite the presence of rational users and failures. The notion of (k, t)-robustness is key to derive impossibility results with k rational players and t faulty players. However, these t faulty players are always ...

IEEE2021

Mneme: A Mobile Distributed Ledger

Boi Faltings, Sujit Prakash Gujar, Dimitrios Chatzopoulos

Advances in mobile computing have paved the way for new types of distributed applications that can be executed solely by mobile devices on device-to-device (D2D) ecosystems (e.g., crowdsensing). More sophisticated applications, like cryptocurrencies, need ...

IEEE2020

The Impossibility of Fast Transactions

Rachid Guerraoui, Willy Zwaenepoel, Diego Didona, Karolos Antoniadis

We prove that transactions cannot be fast in an asynchronous fault-tolerant system. Our result holds in any system where we require transactions to ensure monotonic writes, or any stronger consistency model, such as, causal consistency. Thus, our result un ...

2019

Fixed-wing drones for communication networks

Maja Varga

In the last decade, drones became frequently used to provide eye-in-the-sky overview in the outdoor environment. Their main advantage compared to the other types of robots is that they can fly above obstacles and rough terrains and they can quickly cover l ...

EPFL2016

Creating Secrets Out Of Packet Erasures

Christina Fragouli, László Czap, Iris Safaka

We present protocols for creating pairwise secrets between nodes in a wireless network, so that these secrets are secure from an eavesdropper, Eve, with unbounded computational and memory capabilities, but with limited network presence. We first present a ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Never Say Never Probabilistic & Temporal Failure Detectors (Extended)

Rachid Guerraoui, David Kozhaya, Yvonne Anne Pignolet-Oswald

The failure detector approach for solving distributed computing problems has been celebrated for its modularity. This approach allows the construction of algorithms using abstract failure detection mechanisms, defined by axiomatic properties, as building b ...

IPDPS2016

Round-Based Consensus Algorithms, Predicate Implementations and Quantitative Analysis

Graph Chatbot

Chat with Graph Search

Planetary-Scale Byzantine Fault Tolerance

Byzantine Fault-Tolerance in Federated Local SGD Under 2f-Redundancy

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

Rational Agreement in the Presence of Crash Faults

Mneme: A Mobile Distributed Ledger

The Impossibility of Fast Transactions

Fixed-wing drones for communication networks

Creating Secrets Out Of Packet Erasures

Never Say Never Probabilistic & Temporal Failure Detectors (Extended)

Creating Secrets Out Of Packet Erasures

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

Byzantine Fault-Tolerance in Federated Local SGD Under 2f-Redundancy

Planetary-Scale Byzantine Fault Tolerance

Rational Agreement in the Presence of Crash Faults

Mneme: A Mobile Distributed Ledger

Never Say Never Probabilistic & Temporal Failure Detectors (Extended)

Fixed-wing drones for communication networks

The Impossibility of Fast Transactions