activity
20082026
most citedDistributed Compressed Sensing For Static and Time-Varying Networks

98 citations · 116 across the 20 of their papers we have counts for

collaborators

29 papers

cs.DC2026

Securing People and their Machines Against Major Faults

Ohad Eitan, Idit Keidar, Ehud Shapiro

We consider grassroots platforms -- distributed systems of agents consisting of people identified by self-chosen public keys and their machines (smartphones) -- and wish to make th…

cs.DC2025

Constitutional Consensus for Democratic Governance

Idit Keidar, Andrew Lewis-Pye, Ehud Shapiro +1

Permissionless-consensus-based Decentralised Autonomous Organisations (DAOs) are the prevailing paradigm for participant-governed digital organisations. As participants have verifi…

cs.DB2024

KV-Tandem -- a Modular Approach to Building High-Speed LSM Storage Engines

Edward Bortnikov, Michael Azran, Asa Bornstein +11

We present~\emph{KV-Tandem}, a modular architecture for building LSM-based storage engines on top of simple, non-ordered persistent key-value stores (KVSs). KV-Tandem enables advan…

cs.DC2023

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…

cs.DS2022

Quancurrent: A Concurrent Quantiles Sketch

Shaked Elias-Zada, Arik Rinberg, Idit Keidar

Sketches are a family of streaming algorithms widely used in the world of big data to perform fast, real-time analytics. A popular sketch type is Quantiles, which estimates the dat…

cs.DC2022★ 6 cited

Cordial Miners: Fast and Efficient Consensus for Every Eventuality

Idit Keidar, Oded Naor, Ouri Poupko +1

Cordial Miners are a family of efficient Byzantine Atomic Broadcast protocols, with instances for asynchrony and eventual synchrony. They improve the latency of state-of-the-art DA…