9 papers
Obfuscated Consensus
James Aspnes, Shlomi Dolev, Amit Hendin
The classic Fischer, Lynch, and Paterson impossibility proof demonstrates that any deterministic protocol for consensus in either a message-passing or shared-memory system must vio…
Bloom Filter Look-Up Tables for Private and Secure Distributed Databases in Web3 (Revised Version)
Shlomi Dolev, Ehud Gudes, Daniel Shlomo
The rapid growth of decentralized systems in theWeb3 ecosystem has introduced numerous challenges, particularly in ensuring data security, privacy, and scalability [3, 8]. These sy…
Quantum Key Distribution by Quantum Energy Teleportation
Shlomi Dolev, Kazuki Ikeda, Yaron Oz
Quantum energy teleportation (QET) is a process that leverages quantum entanglement and local operations to transfer energy between two spatially separated locations without physic…
DynamicAdaptiveClimb: Adaptive Cache Replacement with Dynamic Resizing
Daniel Berend, Shlomi Dolev, Sweta Kumari +3
Efficient cache management is critical for optimizing the system performance, and numerous caching mechanisms have been proposed, each exploring various insertion and eviction stra…
Linear time small coresets for k-mean clustering of segments with applications
David Denisov, Shlomi Dolev, Dan Felmdan +1
We study the -means problem for a set of segments, aiming to find centers that minimize $D(\mathcal{S},X)…
The Steiner Shortest Path Tree Problem
Omer Asher, Yefim Dinitz, Shlomi Dolev +2
We introduce and study a novel problem of computing a shortest path tree with a minimum number of non-terminals. It can be viewed as an (unweighted) Steiner Shortest Path Tree (SSP…