activity
20182021
most citedFlexible Byzantine Fault Tolerance

2 citations · 3 across the 2 of their papers we have counts for

collaborators

7 papers

cs.DC20211 cited

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…

cs.CR2020

Efficient Cross-Shard Transaction Execution in Sharded Blockchains

Sourav Das, Vinith Krishnan, Ling Ren

Sharding is a promising blockchain scaling solution. But it currently suffers from high latency and low throughput when it comes to cross-shard transactions, i.e., transactions tha…

cs.DC2020

Optimal Communication Complexity of Authenticated Byzantine Agreement

Atsuki Momose, Ling Ren

Byzantine Agreement (BA) is one of the most fundamental problems in distributed computing, and its communication complexity is an important efficiency metric. It is well known that…

cs.CR2020

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…

cs.CR2020

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…

cs.CR20192 cited

Flexible Byzantine Fault Tolerance

Dahlia Malkhi, Kartik Nayak, Ling Ren

This paper introduces Flexible BFT, a new approach for BFT consensus solution design revolving around two pillars, stronger resilience and diversity. The first pillar, stronger res…