48 citations · 65 across the 8 of their papers we have counts for
4 papers · 1 filter
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…
In Search for an Optimal Authenticated Byzantine Agreement
Alexander Spiegelman
In this paper, we challenge the conventional approach of state machine replication systems to design deterministic agreement protocols in the eventually synchronous communication m…
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…
Using Nesting to Push the Limits of Transactional Data Structure Libraries
Gal Assa, Hagar Meir, Guy Golan-Gueta +2
Transactional data structure libraries (TDSL) combine the ease-of-programming of transactions with the high performance and scalability of custom-tailored concurrent data structure…