Zobrazeno 1 - 10
of 65
pro vyhledávání: '"Spiegelman, Alexander"'
Threshold cryptography is essential for many blockchain protocols. For example, many protocols rely on threshold common coin to implement asynchronous consensus, leader elections, and provide support for randomized applications. Similarly, threshold
Externí odkaz:
http://arxiv.org/abs/2407.12172
Today's practical partially synchronous Byzantine Fault Tolerant (BFT) consensus protocols trade off low latency and high throughput. On the one end, traditional BFT protocols such as PBFT and its derivatives optimize for latency. They require, in fa
Externí odkaz:
http://arxiv.org/abs/2405.20488
Autor:
Mitenkov, George, Kabiljo, Igor, Li, Zekun, Spiegelman, Alexander, Vusirikala, Satyanarayana, Xiang, Zhuolun, Zlateski, Aleksandar, Lopes, Nuno P., Gelashvili, Rati
One of the main bottlenecks of blockchains is smart contract execution. To increase throughput, modern blockchains try to execute transactions in parallel. Unfortunately, however, common blockchain use cases introduce read-write conflicts between tra
Externí odkaz:
http://arxiv.org/abs/2405.06117
The Narwhal system is a state-of-the-art Byzantine fault-tolerant scalable architecture that involves constructing a directed acyclic graph (DAG) of messages among a set of validators in a Blockchain network. Bullshark is a zero-overhead consensus pr
Externí odkaz:
http://arxiv.org/abs/2306.03058
The purpose of this manuscript is to describe the deterministic partially synchronous version of Bullshark in a simple and clean way. This result is published in CCS 2022, however, the description there is less clear because it uses the terminology o
Externí odkaz:
http://arxiv.org/abs/2209.05633
Autor:
Gelashvili, Rati, Spiegelman, Alexander, Xiang, Zhuolun, Danezis, George, Li, Zekun, Malkhi, Dahlia, Xia, Yu, Zhou, Runtian
Block-STM is a parallel execution engine for smart contracts, built around the principles of Software Transactional Memory. Transactions are grouped in blocks, and every execution of the block must yield the same deterministic outcome. Block-STM furt
Externí odkaz:
http://arxiv.org/abs/2203.06871
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
We present Bullshark, the first directed acyclic graph (DAG) based asynchronous Byzantine Atomic Broadcast protocol that is optimized for the common synchronous case. Like previous DAG-based BFT protocols, Bullshark requires no extra communication to
Externí odkaz:
http://arxiv.org/abs/2201.05677
Autor:
Cohen, Shir, Gelashvili, Rati, Kogias, Lefteris Kokoris, Li, Zekun, Malkhi, Dahlia, Sonnino, Alberto, Spiegelman, Alexander
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-rotation. A predetermined round-robin mechanism used for Leader-rotatio
Externí odkaz:
http://arxiv.org/abs/2110.00960
Autor:
Gelashvili, Rati, Kokoris-Kogias, Lefteris, Sonnino, Alberto, Spiegelman, Alexander, Xiang, Zhuolun
Existing committee-based Byzantine state machine replication (SMR) protocols, typically deployed in production blockchains, face a clear trade-off: (1) they either achieve linear communication cost in the happy path, but sacrifice liveness during per
Externí odkaz:
http://arxiv.org/abs/2106.10362