2 citations · 7 across the 11 of their papers we have counts for
14 papers
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…
From Permissioned to Proof-of-Stake Consensus
Jovan Komatovic, Andrew Lewis-Pye, Joachim Neu +2
This paper presents the first generic compiler that transforms any permissioned consensus protocol into a proof-of-stake permissionless consensus protocol. For each of the followin…
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…
All Byzantine Agreement Problems are Expensive
Pierre Civit, Seth Gilbert, Rachid Guerraoui +3
Byzantine agreement, arguably the most fundamental problem in distributed computing, operates among n processes, out of which t < n can exhibit arbitrary failures. The problem stat…
Strong Byzantine Agreement with Adaptive Word Complexity
Pierre Civit, Seth Gilbert, Rachid Guerraoui +2
The strong Byzantine agreement (SBA) problem is defined among n processes, out of which t < n can be faulty and behave arbitrarily. SBA allows correct (non-faulty) processes to agr…
Every Bit Counts in Consensus
Pierre Civit, Seth Gilbert, Rachid Guerraoui +3
Consensus enables n processes to agree on a common valid L-bit value, despite t < n/3 processes being faulty and acting arbitrarily. A long line of work has been dedicated to impro…
On the Validity of Consensus
Pierre Civit, Seth Gilbert, Rachid Guerraoui +2
The Byzantine consensus problem involves processes, out of which t < n could be faulty and behave arbitrarily. Three properties characterize consensus: (1) termination, requiri…
Carbon: Scaling Trusted Payments with Untrusted Machines
Martina Camaioni, Rachid Guerraoui, Jovan Komatovic +4
This paper introduces Carbon, a high-throughput system enabling asynchronous (safe) and consensus-free (efficient) payments and votes within a dynamic set of clients. Carbon is ope…
Online Payments by Merely Broadcasting Messages (Extended Version)
Daniel Collins, Rachid Guerraoui, Jovan Komatovic +7
We address the problem of online payments, where users can transfer funds among themselves. We introduce Astro, a system solving this problem efficiently in a decentralized, determ…
Dynamic Byzantine Reliable Broadcast [Technical Report]
Rachid Guerraoui, Jovan Komatovic, Petr Kuznetsov +3
Reliable broadcast is a communication primitive guaranteeing, intuitively, that all processes in a distributed system deliver the same set of messages. The reason why this primitiv…