7 papers
Optimal Adaptive Multi-Valued Byzantine Agreement
Marc Dufay, Anton Paramonov, Roger Wattenhofer
In Byzantine Agreement (BA), parties, out of which can be Byzantine, run a distributed protocol to agree on a common valid input. Traditionally, these protocols have a line…
From Few to Many Faults: Optimal Adaptive Byzantine Agreement
Andrei Constantinescu, Marc Dufay, Anton Paramonov +1
Achieving agreement among distributed parties is a fundamental task in modern systems, underpinning applications such as consensus in blockchains, coordination in cloud infrastruct…
General Convex Agreement with Near-Optimal Communication
Marc Dufay, Diana Ghinea, Anton Paramonov
Byzantine Agreement (BA) considers a setting of parties out of which up to can be byzantine (malicious), and requires the honest parties to agree on an input subject to a c…
Predictions Can Only Help! Communication Efficient Byzantine Agreement with Predictions
Muhammad Ayaz Dzulfikar, Marc Dufay, Seth Gilbert
In Byzantine agreement with predictions each process begins with an input value and some (unreliable) prediction bits. Recently, it has been shown that with \emph{classification pr…
A Deterministic Polylogarithmic Competitive Algorithm for Matching with Delays
Marc Dufay, Roger Wattenhofer
In the online Min-cost Perfect Matching with Delays (MPMD) problem, requests in a metric space are submitted at different times by an adversary. The goal is to match all reques…
Validity in Network-Agnostic Byzantine Agreement
Andrei Constantinescu, Marc Dufay, Diana Ghinea +1
Byzantine Agreement (BA) considers a setting of parties, out of which up to can exhibit byzantine (malicious) behavior. Honest parties must decide on a common value (agreem…