activity
20162024
most citedEmpirical Analysis of EIP-1559: Transaction Fees, Waiting Time, and Consensus Security

88 citations · 209 across the 15 of their papers we have counts for

collaborators
Showing cs.CRShow all

8 papers · 1 filter

cs.CR2022★ 1 cited

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.,…

cs.CR2021★ 8 cited

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…

cs.CR2020★ 59 cited

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…

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.CR2019★ 2 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…

cs.CR2018★ 1 cited

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…

cs.CR2016

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…