Planetary-Scale Byzantine Fault Tolerance

About
Privacy
Disclaimer

Graph Chatbot

Related publications (32)

Page 2 of 2

Scalable and Privacy-Preserving Federated Principal Component Analysis

Jean-Pierre Hubaux, Juan Ramón Troncoso-Pastoriza, Apostolos Pyrgelis, Joao André Gomes de Sá e Sousa, David Jules Froelicher, Jean-Philippe Léonard Bossuat

Principal component analysis (PCA) is an essential algorithm for dimensionality reduction in many data science domains. We address the problem of performing a federated PCA on private data distributed among multiple data providers while ensuring data confi ...

IEEE COMPUTER SOC2023

Data-driven and Safe Networked Control with Applications to Microgrids

Mustafa Sahin Turan

Today, automatic control is integrated into a wide spectrum of real-world systems such as electrical grids and transportation networks. Many of these systems comprise numerous interconnected agents, perform safety-critical operations, or generate large amo ...

EPFL2022

The Universal Gossip Fighter

Rachid Guerraoui, Anne-Marie Kermarrec, Rafaël Benjamin Pinot, Anastasiia Kucherenko

The notion of adversary is a staple of distributed computing. An adversary typically models “hostile” assumptions about the underlying distributed environment, e.g., a network that can drop messages, an operating system that can delay processes or an attac ...

IEEE2022

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

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

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

Toward Mobile Distributed Ledgers

Boi Faltings, Sujit Prakash Gujar

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). Sophisticated applications, like cryptocurrencies, need distr ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

Oracular Byzantine Reliable Broadcast

Rachid Guerraoui, Manuel José Ribeiro Vidigueira, Matteo Monti, Martina Camaioni

Byzantine Reliable Broadcast (BRB) is a fundamental distributed computing primitive, with applications ranging from notifications to asynchronous payment systems. Motivated by practical consideration, we study Client-Server Byzantine Reliable Broadcast (CS ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2022

Communication Complexity of Collision

Mika Tapani Göös, Siddhartha Jain

The Collision problem is to decide whether a given list of numbers (x_1,…,x_n) ∈ [n]ⁿ is 1-to-1 or 2-to-1 when promised one of them is the case. We show an n^Ω(1) randomised communication lower bound for the natural two-party version of Collision where Ali ...

Leibniz-Zentrum für Informatik2022

Genuinely distributed Byzantine machine learning

Rachid Guerraoui, El Mahdi El Mhamdi, Sébastien Louis Alexandre Rouault, Le Nguyen Hoang, Arsany Hany Abdelmessih Guirguis

Machine learning (ML) solutions are nowadays distributed, according to the so-called server/worker architecture. One server holds the model parameters while several workers train the model. Clearly, such architecture is prone to various types of component ...

2022

Optimal Matching of Random Parts

Thomas Alois Weber

This paper examines the minimization of the cost for an expected random production output, given an assembly of finished goods from two random inputs, matched in two categories. We describe the optimal input portfolio, first using the standard normal appro ...

2022

Byzantine Consensus is Θ(n^2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony!

Rachid Guerraoui, Vincent Gramoli, Seth Gilbert, Jovan Komatovic, Manuel José Ribeiro Vidigueira, Pierre Philippe Civit

The Dolev-Reischuk bound says that any deterministic Byzantine consensus protocol has (at least) quadratic communication complexity in the worst case. While it has been shown that the bound is tight in synchronous environments, it is still unknown whether ...

Dagstuhl Publishing2022

Proofs, Circuits, and Communication

Mika Tapani Göös

We survey lower-bound results in complexity theory that have been obtained via newfound interconnections between propositional proof complexity, boolean circuit complexity, and query/communication complexity. We advocate for the theory of total search prob ...

2022

Quantization for Distributed Processing and Learning of Structured Data

Isabela Cunha Maia Nobre

In the domains of machine learning, data science and signal processing, graph or network data, is becoming increasingly popular. It represents a large portion of the data in computer, transportation systems, energy networks, social, biological, and other s ...

EPFL2022