3 citations · 12 across the 10 of their papers we have counts for
14 papers
Block-STM: Scaling Blockchain Execution by Turning Ordering Curse to a Performance Blessing
Rati Gelashvili, Alexander Spiegelman, Zhuolun Xiang +5
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…
Good-case and Bad-case Latency of Unauthenticated Byzantine Broadcast: A Complete Categorization
Ittai Abraham, Ling Ren, Zhuolun Xiang
This paper studies the {\em good-case latency} of {\em unauthenticated} Byzantine fault-tolerant broadcast, which measures the time it takes for all non-faulty parties to commit gi…
Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback
Rati Gelashvili, Lefteris Kokoris-Kogias, Alberto Sonnino +2
Existing committee-based Byzantine state machine replication (SMR) protocols, typically deployed in production blockchains, face a clear trade-off: (1) they either achieve linear c…
Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol
Rati Gelashvili, Lefteris Kokoris-Kogias, Alexander Spiegelman +1
The popularity of permissioned blockchain systems demands BFT SMR protocols that are efficient under good network conditions (synchrony) and robust under bad network conditions (as…
Brief Note: Fast Authenticated Byzantine Consensus
Ittai Abraham, Kartik Nayak, Ling Ren +1
Byzantine fault-tolerant (BFT) state machine replication (SMR) has been studied for over 30 years. Recently it has received more attention due to its application in permissioned bl…
Good-case Latency of Byzantine Broadcast: A Complete Categorization
Ittai Abraham, Kartik Nayak, Ling Ren +1
This paper explores the problem good-case latency of Byzantine fault-tolerant broadcast, motivated by the real-world latency and performance of practical state machine replication…
Strengthened Fault Tolerance in Byzantine Fault Tolerant Replication
Zhuolun Xiang, Dahlia Malkhi, Kartik Nayak +1
Byzantine fault tolerant (BFT) state machine replication (SMR) is an important building block for constructing permissioned blockchain systems. In contrast to Nakamoto Consensus wh…
Byzantine Agreement, Broadcast and State Machine Replication with Near-optimal Good-case Latency
Ittai Abraham, Kartik Nayak, Ling Ren +1
This paper investigates the problem \textit{good-case latency} of Byzantine agreement, broadcast and state machine replication in the synchronous authenticated setting. The good-ca…
Improved Extension Protocols for Byzantine Broadcast and Agreement
Kartik Nayak, Ling Ren, Elaine Shi +2
Byzantine broadcast (BB) and Byzantine agreement (BA) are two most fundamental problems and essential building blocks in distributed computing, and improving their efficiency is of…
Linear and Range Counting under Metric-based Local Differential Privacy
Zhuolun Xiang, Bolin Ding, Xi He +1
Local differential privacy (LDP) enables private data sharing and analytics without the need for a trusted data collector. Error-optimal primitives (for, e.g., estimating means and…
Global Stabilization for Causally Consistent Partial Replication
Zhuolun Xiang, Nitin H. Vaidya
Causally consistent distributed storage systems have received significant attention recently due to the potential for providing high throughput and causality guarantees. {\em Globa…
Partially Replicated Causally Consistent Shared Memory: Lower Bounds and An Algorithm
Zhuolun Xiang, Nitin H. Vaidya
The focus of this paper is on causal consistency in a {\em partially replicated} distributed shared memory (DSM) system that provides the abstraction of shared read/write registers…
Timestamps for Partial Replication
Zhuolun Xiang, Nitin H. Vaidya
Maintaining causal consistency in distributed shared memory systems using vector timestamps has received a lot of attention from both theoretical and practical prospective. However…
Relaxed Byzantine Vector Consensus
Zhuolun Xiang, Nitin H. Vaidya
Exact Byzantine consensus problem requires that non-faulty processes reach agreement on a decision (or output) that is in the convex hull of the inputs at the non-faulty processes.…