Publication

Scaling Byzantine Fault Tolerance

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

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

Scaling Byzantine Fault Tolerance

Graph Chatbot

Chattez avec Graph Search

Planetary-Scale Byzantine Fault Tolerance

Towards General-Purpose Decentralized Computing with Permissionless Extensibility

Mean value theorems for collections of lattices with a prescribed group of symmetries

Disagreement and fragmentation in growing groups

Building Strongly-Consistent Systems Resilient to Failures, Partitions, and Slowdowns

Reliable Microsecond-Scale Distributed Computing

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

Byzantine consensus is Θ(n^2): the Dolev-Reischuk bound is tight even in partial synchrony!

A review of the security vulnerabilities and countermeasures in the Internet of Things solutions: A bright future for the Blockchain

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

Towards General-Purpose Decentralized Computing with Permissionless Extensibility

Mean value theorems for collections of lattices with a prescribed group of symmetries

Planetary-Scale Byzantine Fault Tolerance

Reliable Microsecond-Scale Distributed Computing

Building Strongly-Consistent Systems Resilient to Failures, Partitions, and Slowdowns

Disagreement and fragmentation in growing groups

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

Byzantine consensus is Θ(n^2): the Dolev-Reischuk bound is tight even in partial synchrony!

A review of the security vulnerabilities and countermeasures in the Internet of Things solutions: A bright future for the Blockchain

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