research
∙
09/11/2023
Practical Homomorphic Aggregation for Byzantine ML
Due to the large-scale availability of data, machine learning (ML) algor...
share
research
∙
08/07/2023
Strong Byzantine Agreement with Adaptive Word Complexity
The strong Byzantine agreement (SBA) problem is defined among n processe...
research
∙
08/04/2023
On the Inherent Anonymity of Gossiping
Detecting the source of a gossip is a critical issue, related to identif...
research
∙
06/01/2023
Every Bit Counts in Consensus
Consensus enables n processes to agree on a common valid L-bit value, de...
research
∙
05/20/2023
Evolutionary Algorithms in the Light of SGD: Limit Equivalence, Minima Flatness, and Transfer Learning
Whenever applicable, the Stochastic Gradient Descent (SGD) has shown its...
research
∙
04/20/2023
Byzantine-Resilient Learning Beyond Gradients: Distributing Evolutionary Search
Modern machine learning (ML) models are capable of impressive performanc...
research
∙
04/18/2023
Stochastic Parrots Looking for Stochastic Parrots: LLMs are Easy to Fine-Tune and Hard to Detect with other LLMs
The self-attention revolution allowed generative language models to scal...
research
∙
04/14/2023
Chop Chop: Byzantine Atomic Broadcast to the Network Limit
At the heart of state machine replication, the celebrated technique enab...
research
∙
02/09/2023
Distributed Learning with Curious and Adversarial Machines
The ubiquity of distributed machine learning (ML) in sensitive public do...
research
∙
01/12/2023
On the Validity of Consensus
The Byzantine consensus problem involves n processes, out of which t < n...
research
∙
10/31/2022
uBFT: Microsecond-scale BFT using Disaggregated Memory [Extended Version]
We propose uBFT, the first State Machine Replication (SMR) system to ach...
research
∙
10/24/2022
SurferMonkey: A Decentralized Anonymous Blockchain Intercommunication System via Zero Knowledge Proofs
Blockchain intercommunication systems enable the exchanges of messages b...
research
∙
10/16/2022
Accelerating Transfer Learning with Near-Data Computation on Cloud Object Stores
Near-data computation techniques have been successfully deployed to miti...
research
∙
09/30/2022
SoK: On the Impossible Security of Very Large Foundation Models
Large machine learning models, or so-called foundation models, aim to se...
research
∙
09/27/2022
Oracular Byzantine Reliable Broadcast [Extended Version]
Byzantine Reliable Broadcast (BRB) is a fundamental distributed computin...
research
∙
09/22/2022
Making Byzantine Decentralized Learning Efficient
Decentralized-SGD (D-SGD) distributes heavy learning tasks across multip...
research
∙
09/20/2022
Carbon: An Asynchronous Voting-Based Payment System for a Client-Server Architecture
We present Carbon, an asynchronous payment system. To the best of our kn...
research
∙
08/19/2022
Byzantine Consensus is Θ(n^2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony! [Extended Version]
The Dolev-Reischuk bound says that any deterministic Byzantine consensus...
research
∙
05/24/2022
Byzantine Machine Learning Made Easy by Resilient Averaging of Momentums
Byzantine resilience emerged as a prominent topic within the distributed...
research
∙
02/17/2022
Robust Sparse Voting
Many modern Internet applications, like content moderation and recommend...
research
∙
02/17/2022
An Equivalence Between Data Poisoning and Byzantine Gradient Attacks
To study the resilience of distributed learning, the "Byzantine" literat...
research
∙
10/08/2021
Combining Differential Privacy and Byzantine Resilience in Distributed SGD
Privacy and Byzantine resilience (BR) are two crucial requirements of mo...
research
∙
06/16/2021
Velos: One-sided Paxos for RDMA applications
Modern data centers are becoming increasingly equipped with RDMA-capable...
research
∙
06/04/2021
Strategyproof Learning: Building Trustworthy User-Generated Datasets
Today's large-scale machine learning algorithms harness massive amounts ...
research
∙
06/04/2021
On the Strategyproofness of the Geometric Median
The geometric median of a tuple of vectors is the vector that minimizes ...
research
∙
02/16/2021
Differential Privacy and Byzantine Resilience in SGD: Do They Add Up?
This paper addresses the problem of combining Byzantine resilience with ...
research
∙
10/13/2020
Microsecond Consensus for Microsecond Applications
We consider the problem of making apps fault-tolerant through replicatio...
research
∙
10/12/2020
Garfield: System Support for Byzantine Machine Learning
Byzantine Machine Learning (ML) systems are nowadays vulnerable for they...
research
∙
08/06/2020
Efficient Multi-word Compare and Swap
Atomic lock-free multi-word compare-and-swap (MCAS) is a powerful tool f...
research
∙
08/03/2020
Collaborative Learning as an Agreement Problem
We address the problem of Byzantine collaborative learning: a set of n n...
research
∙
06/12/2020
FLeet: Online Federated Learning via Staleness Awareness and Performance Prediction
Federated Learning (FL) is very appealing for its privacy benefits: esse...
research
∙
06/12/2020
Differentially Private Stochastic Coordinate Descent
In this paper we tackle the challenge of making the stochastic coordinat...
research
∙
05/22/2020
Host-Pathongen Co-evolution Inspired Algorithm Enables Robust GAN Training
Generative adversarial networks (GANs) are pairs of artificial neural ne...
research
∙
04/27/2020
Online Payments by Merely Broadcasting Messages (Extended Version)
We address the problem of online payments, where users can transfer fund...
research
∙
02/28/2020
Distributed Momentum for Byzantine-resilient Learning
Momentum is a variant of gradient descent that has been proposed for its...
research
∙
01/17/2020
Dynamic Byzantine Reliable Broadcast [Technical Report]
Reliable broadcast is a powerful primitive guaranteeing that, intuitivel...
research
∙
11/18/2019
Can 100 Machines Agree?
Agreement protocols have been typically deployed at small scale, e.g., u...
research
∙
11/18/2019
Fast Machine Learning with Byzantine Workers and Servers
Machine Learning (ML) solutions are nowadays distributed and are prone t...
research
∙
08/05/2019
Scalable Byzantine Reliable Broadcast (Extended Version)
Byzantine reliable broadcast is a powerful primitive that allows a set o...
research
∙
06/14/2019
Gathering with extremely restricted visibility
We consider the classical problem of making mobile processes gather or c...
research
∙
06/13/2019
The Consensus Number of a Cryptocurrency (Extended Version)
Many blockchain-based algorithms, such as Bitcoin, implement a decentral...
research
∙
05/29/2019
The Impact of RDMA on Agreement
Remote Direct Memory Access (RDMA) is becoming widely available in data ...
research
∙
05/05/2019
Fast and Secure Distributed Learning in High Dimension
Modern machine learning is distributed and the work of several machines ...
research
∙
05/05/2019
SGD: Decentralized Byzantine Resilience
The size of the datasets available today leads to distribute Machine Lea...
research
∙
03/21/2019
Distributed Transactional Systems Cannot Be Fast
We prove that no fully transactional system can provide fast read transa...
research
∙
02/19/2019
Who started this rumor? Quantifying the natural differential privacy guarantees of gossip protocols
Gossip protocols, also called rumor spreading or epidemic protocols, are...
research
∙
02/05/2019
Fatal Brain Damage
The loss of a few neurons in a brain often does not result in a visible ...
research
∙
06/07/2018
Removing Algorithmic Discrimination (With Minimal Individual Error)
We address the problem of correcting group discriminations within a scor...
research
∙
05/29/2018
Virtuously Safe Reinforcement Learning
We show that when a third party, the adversary, steps into the two-party...
research
∙
03/16/2018
