3 citations · 4 across the 6 of their papers we have counts for
7 papers
Prefix Consensus For Censorship Resistant BFT
Zhuolun Xiang, Andrei Tonkikh, Alexander Spiegelman
Despite broad adoption of BFT consensus in blockchains, censorship resistance remains weak: existing designs offer limited inclusion guarantees and allow leaders to exclude transac…
Shelby: Decentralized Storage Designed to Serve
Guy Goren, Andrew Hariri, Timothy D. R. Hartley +3
Existing decentralized storage protocols fall short of the service required by real-world applications. Their throughput, latency, cost-effectiveness, and availability are insuffic…
DAGs for the Masses
Michael Anoprenko, Andrei Tonkikh, Alexander Spiegelman +3
A recent approach to building consensus protocols on top of Directed Acyclic Graphs (DAGs) shows much promise due to its simplicity and stable throughput. However, as each node in…
Raptr: Prefix Consensus for Robust High-Performance BFT
Andrei Tonkikh, Balaji Arun, Zhuolun Xiang +2
In this paper, we present Raptr--a Byzantine fault-tolerant state machine replication (BFT SMR) protocol that combines strong robustness with high throughput, while attaining near-…
Zaptos: Towards Optimal Blockchain Latency
Zhuolun Xiang, Zekun Li, Balaji Arun +2
End-to-end blockchain latency has become a critical topic of interest in both academia and industry. However, while modern blockchain systems process transactions through multiple…
The Latency Price of Threshold Cryptosystem in Blockchains
Zhuolun Xiang, Sourav Das, Zekun Li +2
Threshold cryptography is essential for many blockchain protocols. For example, many protocols rely on threshold common coin to implement asynchronous consensus, leader elections,…
Shoal++: High Throughput DAG BFT Can Be Fast!
Balaji Arun, Zekun Li, Florian Suri-Payer +2
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…