1 citations · 1 across the 7 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
cs.DC2026
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…
cs.DS2026
Maintaining Random Assignments under Adversarial Dynamics
Bernhard Haeupler, Anton Paramonov
We study and further develop powerful general-purpose schemes to maintain random assignments under adversarial dynamic changes. The goal is to maintain assignments that are (approx…
cs.DC2026
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…