88 citations · 209 across the 15 of their papers we have counts for
19 papers
Granular Synchrony
Neil Giridharan, Ittai Abraham, Natacha Crooks +2
Today's mainstream network timing models for distributed computing are synchrony, partial synchrony, and asynchrony. These models are coarse-grained and often make either too stron…
Lumiere: Making Optimal BFT for Partial Synchrony Practical
Andrew Lewis-Pye, Dahlia Malkhi, Oded Naor +1
The view synchronization problem lies at the heart of many Byzantine Fault Tolerant (BFT) State Machine Replication (SMR) protocols in the partial synchrony model, since these prot…
TrustBoost: Boosting Trust among Interoperable Blockchains
Peiyao Sheng, Xuechao Wang, Sreeram Kannan +2
Currently there exist many blockchains with weak trust guarantees, limiting applications and participation. Existing solutions to boost the trust using a stronger blockchain, e.g.,…
IncShrink: Architecting Efficient Outsourced Databases using Incremental MPC and Differential Privacy
Chenghong Wang, Johes Bater, Kartik Nayak +1
In this paper, we consider secure outsourced growing databases that support view-based query answering. These databases allow untrusted servers to privately maintain a materialized…
Empirical Analysis of EIP-1559: Transaction Fees, Waiting Time, and Consensus Security
Yulin Liu, Yuxuan Lu, Kartik Nayak +3
A transaction fee mechanism (TFM) is an essential component of a blockchain protocol. However, a systematic evaluation of the real-world impact of TFMs is still absent. Using rich…
Classifying Trusted Hardware via Unidirectional Communication
Naama Ben-David, Kartik Nayak
It is well known that Byzantine fault tolerant (BFT) consensus cannot be solved in the classic asynchronous message passing model when one-third or more of the processes may be fau…
DP-Sync: Hiding Update Patterns in Secure Outsourced Databases with Differential Privacy
Chenghong Wang, Johes Bater, Kartik Nayak +1
In this paper, we have introduced a new type of leakage associated with modern encrypted databases called update pattern leakage. We formalize the definition and security model of…
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…
BFT Protocol Forensics
Peiyao Sheng, Gerui Wang, Kartik Nayak +2
Byzantine fault-tolerant (BFT) protocols allow a group of replicas to come to a consensus even when some of the replicas are Byzantine faulty. There exist multiple BFT protocols to…
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…
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…
More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting
T-H. Hubert Chan, Jonathan Katz, Kartik Nayak +2
The problem of Oblivious RAM (ORAM) has traditionally been studied in a single-server setting, but more recently the multi-server setting has also been considered. Yet it is still…
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…