2 citations · 6 across the 10 of their papers we have counts for
12 papers · 1 filter
Cadence: Extreme Pipelining with Multiple Concurrent Proposers
Kushal Babel, Fatima Elsheimy, Lioba Heimbach +6
We present Cadence, a Byzantine fault-tolerant multi-proposer consensus protocol with arbitrarily low block intervals, optimal resilience, and optimal fast-path latency. Cadence di…
Byzantine Consensus in the Random Asynchronous Model
George Danezis, Jovan Komatovic, Lefteris Kokoris-Kogias +2
We propose a novel relaxation of the classic asynchronous network model, called the random asynchronous model, which removes adversarial message scheduling while preserving unbound…
Juggernaut: Efficient Crypto-Agnostic Byzantine Agreement
Daniel Collins, Yuval Efron, Jovan Komatovic
It is well known that a trusted setup allows one to solve the Byzantine agreement problem in the presence of corruptions, bypassing the setup-free barrier. Alas, th…
Toward Optimal-Complexity Hash-Based Asynchronous MVBA with Optimal Resilience
Jovan Komatovic, Joachim Neu, Tim Roughgarden
Multi-valued validated Byzantine agreement (MVBA), a fundamental primitive of distributed computing, allows processes to agree on a valid -bit value, despite faulty p…
Efficient Signature-Free Validated Agreement
Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert +4
Byzantine agreement enables n processes to agree on a common L-bit value, despite up to t > 0 arbitrary failures. A long line of work has been dedicated to improving the bit comple…
Partial Synchrony for Free? New Upper Bounds for Byzantine Agreement
Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert +4
Byzantine agreement allows n processes to decide on a common value, in spite of arbitrary failures. The seminal Dolev-Reischuk bound states that any deterministic solution to Byzan…