Zobrazeno 1 - 10
of 261
pro vyhledávání: '"KEIDAR, IDIT"'
Autor:
Bortnikov, Edward, Azran, Michael, Bornstein, Asa, Dashevsky, Shmuel, Huang, Dennis, Kepten, Omer, Pan, Michael, Sheffi, Gali, Twitto, Moshe, Orzech, Tamar Weiss, Keidar, Idit, Gueta, Guy, Maor, Roey, Dayan, Niv
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 advanced functionalities such as range queries and snapshot reads, while ma
Externí odkaz:
http://arxiv.org/abs/2411.11091
Autor:
Cohen, Shir, Keidar, Idit
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 asynchronous settings. In this paper, we close this gap. Moreover, we do so i
Externí odkaz:
http://arxiv.org/abs/2308.02927
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 data distribution of a large input stream. We present Quancurrent, a high
Externí odkaz:
http://arxiv.org/abs/2208.09265
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 DAG-based protocols by almost 2X and achieve optimal good-case complexit
Externí odkaz:
http://arxiv.org/abs/2205.09174
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 worst-case runs, the question of what can be done in practically common
Externí odkaz:
http://arxiv.org/abs/2202.09123
Autor:
Naor, Oded, Keidar, Idit
Money transfer is an abstraction that realizes the core of cryptocurrencies. It has been shown that, contrary to common belief, money transfer in the presence of Byzantine faults can be implemented in asynchronous networks and does not require consen
Externí odkaz:
http://arxiv.org/abs/2202.06693
In recent years, Byzantine Agreement is being considered in increasing scales due to the proliferation of blockchains and other decentralized financial technologies. Consequently, a number of works have improved its communication complexity in variou
Externí odkaz:
http://arxiv.org/abs/2111.02162
Autor:
RINBERG, ARIK ArikRinberg@campus.technion.ac.il, KEIDAR, IDIT Idish@ee.technion.ac.il
Publikováno v:
Journal of the ACM. Apr2023, Vol. 70 Issue 2, p1-21. 21p.
Autor:
Cohen, Shir, Keidar, Idit
We formalize Byzantine linearizability, a correctness condition that specifies whether a concurrent object with a sequential specification is resilient against Byzantine failures. Using this definition, we systematically study Byzantine-tolerant emul
Externí odkaz:
http://arxiv.org/abs/2102.10597
We present DAG-Rider, the first asynchronous Byzantine Atomic Broadcast protocol that achieves optimal resilience, optimal amortized communication complexity, and optimal time complexity. DAG-Rider is post-quantum safe and ensures that all messages p
Externí odkaz:
http://arxiv.org/abs/2102.08325