1 citations · 1 across the 3 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.DC2024
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…
cs.DC2024
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…