6 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…
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…
Broadcast in Almost Mixing Time
Anton Paramonov, Roger Wattenhofer
We study the problem of broadcasting multiple messages in the CONGEST model. In this problem, a dedicated source node possesses a set of messages with every message of size…
Mangrove: Fast and Parallelizable State Replication for Blockchains
Anton Paramonov, Yann Vonlanthen, Quentin Kniep +2
Mangrove is a novel scaling approach to building blockchains with parallel smart contract support. Unlike in monolithic blockchains, where a single consensus mechanism determines a…