2 citations · 3 across the 3 of their papers we have counts for
7 papers
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…
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…
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…