47 citations · 62 across the 13 of their papers we have counts for
17 papers
Bitcoin's Latency--Security Analysis Made Simple
Dongning Guo, Ling Ren
Simple closed-form upper and lower bounds are developed for the security of the Nakamoto consensus as a function of the confirmation depth, the honest and adversarial block mining…
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…
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…
Close Latency--Security Trade-off for the Nakamoto Consensus
Jing Li, Ling Ren, Dongning Guo
Bitcoin is a peer-to-peer electronic cash system invented by Nakamoto in 2008. While it has attracted much research interest, its exact latency and security properties remain open.…
Limit theorems for excursion sets of subordinated Gaussian random fields with long-range dependence
Vitalii Makogin, Evgeny Spodarev
This paper considers the asymptotic behaviour of volumes of excursion sets of subordinated Gaussian random fields with (possibly) infinite variance. Actually, we consider integral…
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…
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…
Better Late than Never; Scaling Computation in Blockchains by Delaying Execution
Sourav Das, Nitin Awathare, Ling Ren +2
Proof-of-Work~(PoW) based blockchains typically allocate only a tiny fraction (e.g., less than 1% for Ethereum) of the average interarrival time~() between blocks for v…
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…
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…
Communication Complexity of Byzantine Agreement, Revisited
Ittai Abraham, T-H. Hubert Chan, Danny Dolev +4
As Byzantine Agreement (BA) protocols find application in large-scale decentralized cryptocurrencies, an increasingly important problem is to design BA protocols with improved comm…
Efficient Synchronous Byzantine Consensus
Ittai Abraham, Srinivas Devadas, Danny Dolev +2
We present new protocols for Byzantine state machine replication and Byzantine agreement in the synchronous and authenticated setting. The celebrated PBFT state machine replication…
Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus
Ittai Abraham, Dahlia Malkhi, Kartik Nayak +2
The decentralized cryptocurrency Bitcoin has experienced great success but also encountered many challenges. One of the challenges has been the long confirmation time. Another chal…
Optimizing Path ORAM for Cloud Storage Applications
Nathan Wolfe, Ethan Zou, Ling Ren +1
We live in a world where our personal data are both valuable and vulnerable to misappropriation through exploitation of security vulnerabilities in online services. For instance, D…