5 citations · 5 across the 4 of their papers we have counts for
8 papers
GridSMR: Causal Compression for Sharded Blockchains
Shir Cohen, Adam Alon, Raz Omessi +3
We present GridSMR, a sharded blockchain that scales execution horizontally while allowing dependent cross-shard operations to progress within a single block. Existing sharded syst…
Subquadratic Multivalued Asynchronous Byzantine Agreement WHP
Shir Cohen, Idit Keidar
There have been several reductions from multivalued consensus to binary consensus over the past 20 years. To the best of our knowledge, none of them solved it for Byzantine asynchr…
Distributed Computations in Fully-Defective Networks
Keren Censor-Hillel, Shir Cohen, Ran Gelles +1
We address fully-defective asynchronous networks, in which all links are subject to an unlimited number of alteration errors, implying that all messages in the network may be compl…
Make Every Word Count: Adaptive BA with Fewer Words
Shir Cohen, Idit Keidar, Alexander Spiegelman
Byzantine Agreement is a key component in many distributed systems. While Dolev and Reischuk have proven a long time ago that quadratic communication complexity is necessary for wo…
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…
Tame the Wild with Byzantine Linearizability: Reliable Broadcast, Snapshots, and Asset Transfer
Shir Cohen, Idit Keidar
We formalize Byzantine linearizability, a correctness condition that specifies whether a concurrent object with a sequential specification is resilient against Byzantine failures.…
Non-Bayesian Parametric Missing-Mass Estimation
Shir Cohen, Tirza Routtenberg, Lang Tong
We consider the classical problem of missing-mass estimation, which deals with estimating the total probability of unseen elements in a sample. The missing-mass estimation problem…
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…