2 citations · 3 across the 4 of their papers we have counts for
17 papers
Bullshark: The Partially Synchronous Version
Alexander Spiegelman, Neil Giridharan, Alberto Sonnino +1
The purpose of this manuscript is to describe the deterministic partially synchronous version of Bullshark in a simple and clean way. This result is published in CCS 2022, however,…
Be Aware of Your Leaders
Shir Cohen, Rati Gelashvili, Lefteris Kokoris Kogias +4
Advances in blockchains have influenced the State-Machine-Replication (SMR) world and many state-of-the-art blockchain-SMR solutions are based on two pillars: Chaining and Leader-r…
Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol
Rati Gelashvili, Lefteris Kokoris-Kogias, Alexander Spiegelman +1
The popularity of permissioned blockchain systems demands BFT SMR protocols that are efficient under good network conditions (synchrony) and robust under bad network conditions (as…
All You Need is DAG
Idit Keidar, Eleftherios Kokoris-Kogias, Oded Naor +1
We present DAG-Rider, the first asynchronous Byzantine Atomic Broadcast protocol that achieves optimal resilience, optimal amortized communication complexity, and optimal time comp…
Probabilistic Indistinguishability and the Quality of Validity in Byzantine Agreement
Guy Goren, Yoram Moses, Alexander Spiegelman
Lower bounds and impossibility results in distributed computing are both intellectually challenging and practically important. Hundreds if not thousands of proofs appear in the lit…
Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP
Shir Cohen, Idit Keidar, Alexander Spiegelman
King and Saia were the first to break the quadratic word complexity bound for Byzantine Agreement in synchronous systems against an adaptive adversary, and Algorand broke this boun…