1 citations · 4 across the 8 of their papers we have counts for
9 papers
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…
Chop Chop: Byzantine Atomic Broadcast to the Network Limit
Martina Camaioni, Rachid Guerraoui, Matteo Monti +3
At the heart of state machine replication, the celebrated technique enabling decentralized and secure universal computation, lies Atomic Broadcast, a fundamental communication prim…
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…
Oracular Byzantine Reliable Broadcast [Extended Version]
Martina Camaioni, Rachid Guerraoui, Matteo Monti +1
Byzantine Reliable Broadcast (BRB) is a fundamental distributed computing primitive, with applications ranging from notifications to asynchronous payment systems. Motivated by prac…
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…