1 citations · 1 across the 2 of their papers we have counts for
Showing cs.DCShow all
3 papers · 1 filter
cs.DC2026
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…
cs.DC2026
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…
cs.DC2025
Self-Stabilizing Replicated State Machine Coping with Byzantine and Recurring Transient Faults
Shlomi Dolev, Amit Hendin, Maurice Herlihy +2
The ability to perform repeated Byzantine agreement lies at the heart of important applications such as blockchain price oracles or replicated state machines. Any such protocol req…