Oblivious Data Structures. - Xiao Shaun Wang; Kartik Nayak; Chang Liu 021; T.-H. Hubert Chan; Elaine Shi; Emil Stefanov; Yan Huang 001 (CCS, 2014)

Some Vulnerabilities Are Different Than Others - Studying Vulnerabilities and Attack Surfaces in the Wild. - Kartik Nayak; Daniel Marino; Petros Efstathopoulos; Tudor Dumitras (RAID, 2014)

Oblivious Data Structures. - Xiao Wang 012; Kartik Nayak; Chang Liu 021; Elaine Shi; Emil Stefanov; Yan Huang 001 (IACR Cryptol. ePrint Arch., 2014)

ObliVM: A Programming Framework for Secure Computation. - Chang Liu 021; Xiao Shaun Wang; Kartik Nayak; Yan Huang 001; Elaine Shi (IEEE Symposium on Security and Privacy, 2015)

GraphSC: Parallel Secure Computation Made Easy. - Kartik Nayak; Xiao Shaun Wang; Stratis Ioannidis; Udi Weinsberg; Nina Taft; Elaine Shi (IEEE Symposium on Security and Privacy, 2015)

Stubborn Mining: Generalizing Selfish Mining and Combining with an Eclipse Attack. - Kartik Nayak; Srijan Kumar; Andrew Miller 001; Elaine Shi (IACR Cryptol. ePrint Arch., 2015)

iDASH Secure Genome Analysis Competition Using ObliVM. - Xiao Shaun Wang; Chang Liu 021; Kartik Nayak; Yan Huang 001; Elaine Shi (IACR Cryptol. ePrint Arch., 2015)

Helping Johnny encrypt: toward semantic interfaces for cryptographic frameworks. - Soumya Indela; Mukul Kulkarni; Kartik Nayak; Tudor Dumitras (Onward!, 2016)

Toward Semantic Cryptography APIs. - Soumya Indela; Mukul Kulkarni; Kartik Nayak; Tudor Dumitras (SecDev, 2016)

Solidus: An Incentive-compatible Cryptocurrency Based on Permissionless Byzantine Consensus. - Ittai Abraham; Dahlia Malkhi; Kartik Nayak; Ling Ren 001; Alexander Spiegelman (CoRR, 2016)

An Oblivious Parallel RAM with O(log2 N) Parallel Runtime Blowup. - Kartik Nayak; Jonathan Katz (IACR Cryptol. ePrint Arch., 2016)

An Oblivious RAM with Sub-logarithmic Bandwidth Blowup. - Kartik Nayak; Ling Ren 001; Ittai Abraham; Benny Pinkas (IACR Cryptol. ePrint Arch., 2016)

HOP: Hardware makes Obfuscation Practical. - Kartik Nayak; Christopher W. Fletcher; Ling Ren 001; Nishanth Chandran; Satya V. Lokam; Elaine Shi; Vipul Goyal (NDSS, 2017)

Asymptotically Tight Bounds for Composing ORAM with PIR. - Ittai Abraham; Christopher W. Fletcher; Kartik Nayak; Benny Pinkas; Ling Ren 001 (Public Key Cryptography (1), 2017)

Brief Announcement: Practical Synchronous Byzantine Consensus. - Ittai Abraham; Srinivas Devadas; Kartik Nayak; Ling Ren 001 (DISC, 2017)

Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus. - Ittai Abraham; Dahlia Malkhi; Kartik Nayak; Ling Ren 001; Alexander Spiegelman (IACR Cryptol. ePrint Arch., 2017)

Oblivious Computation with Data Locality. - Gilad Asharov; T.-H. Hubert Chan; Kartik Nayak; Rafael Pass; Ling Ren 001; Elaine Shi (IACR Cryptol. ePrint Arch., 2017)

Practical Synchronous Byzantine Consensus. - Ling Ren 001; Kartik Nayak; Ittai Abraham; Srinivas Devadas (IACR Cryptol. ePrint Arch., 2017)

Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected O(n2) Communication, and Optimal Resilience. - Ittai Abraham; Srinivas Devadas; Danny Dolev; Kartik Nayak; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2018)

Dfinity Consensus, Explored. - Ittai Abraham; Dahlia Malkhi; Kartik Nayak; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2018)

OptORAMa: Optimal Oblivious RAM. - Gilad Asharov; Ilan Komargodski; Wei-Kai Lin; Kartik Nayak; Elaine Shi (IACR Cryptol. ePrint Arch., 2018)

More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting. - T.-H. Hubert Chan; Jonathan Katz; Kartik Nayak; Antigoni Polychroniadou; Elaine Shi (IACR Cryptol. ePrint Arch., 2018)

Perfectly Secure Oblivious Parallel RAM. - T.-H. Hubert Chan; Kartik Nayak; Elaine Shi (IACR Cryptol. ePrint Arch., 2018)

Efficient Data-Oblivious Computation. - Kartik Nayak (2018)

Flexible Byzantine Fault Tolerance. - Dahlia Malkhi; Kartik Nayak; Ling Ren 001 (CCS, 2019)

Sync HotStuff: Synchronous SMR with 2∆ Latency and Optimistic Responsiveness. - Ittai Abraham; Dahlia Malkhi; Kartik Nayak; Ling Ren 001; Maofan Yin (IACR Cryptol. ePrint Arch., 2019)

Poirot: private contact summary aggregation: poster abstract. - Yanping Zhang; Chenghong Wang; David Pujol; Johes Bater; Matthew Lentz; Ashwin Machanavajjhala; Kartik Nayak; Lavanya Vasudevan; Jun Yang (SenSys, 2020)

Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. - Gilad Asharov; T.-H. Hubert Chan; Kartik Nayak; Rafael Pass; Ling Ren 001; Elaine Shi (SOSA, 2020)

Sync HotStuff: Simple and Practical Synchronous State Machine Replication. - Ittai Abraham; Dahlia Malkhi; Kartik Nayak; Ling Ren 001; Maofan Yin (SP, 2020)

Brief Announcement: Byzantine Agreement, Broadcast and State Machine Replication with Optimal Good-Case Latency. - Ittai Abraham; Kartik Nayak; Ling Ren 001; Zhuolun Xiang (DISC, 2020)

Improved Extension Protocols for Byzantine Broadcast and Agreement. - Kartik Nayak; Ling Ren 001; Elaine Shi; Nitin H. Vaidya; Zhuolun Xiang (DISC, 2020)

Optimal Good-case Latency for Byzantine Broadcast and State Machine Replication. - Ittai Abraham; Kartik Nayak; Ling Ren 001; Zhuolun Xiang (CoRR, 2020)

On the Optimality of Optimistic Responsiveness. - Ittai Abraham; Kartik Nayak; Ling Ren 001; Nibesh Shrestha (IACR Cryptol. ePrint Arch., 2020)

RandPiper - Reconfiguration-Friendly Random Beacons with Quadratic Communication. - Adithya Bhat; Nibesh Shrestha; Aniket Kate; Kartik Nayak (IACR Cryptol. ePrint Arch., 2020)

Perfectly Secure Oblivious Parallel RAM with O(log3 N/ log log N) Overhead. - T.-H. Hubert Chan; Wei-Kai Lin; Kartik Nayak; Elaine Shi (IACR Cryptol. ePrint Arch., 2020)

RandPiper - Reconfiguration-Friendly Random Beacons with Quadratic Communication. - Adithya Bhat; Nibesh Shrestha; Zhongtang Luo; Aniket Kate; Kartik Nayak (CCS, 2021)

BFT Protocol Forensics. - Peiyao Sheng; Gerui Wang; Kartik Nayak; Sreeram Kannan; Pramod Viswanath (CCS, 2021)

Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions. - T.-H. Hubert Chan; Elaine Shi; Wei-Kai Lin; Kartik Nayak (ITC, 2021)

Strengthened Fault Tolerance in Byzantine Fault Tolerant Replication. - Zhuolun Xiang; Dahlia Malkhi; Kartik Nayak; Ling Ren 001 (ICDCS, 2021)

Good-case Latency of Byzantine Broadcast: a Complete Categorization. - Ittai Abraham; Kartik Nayak; Ling Ren 001; Zhuolun Xiang (PODC, 2021)

Brief Announcement: Classifying Trusted Hardware via Unidirectional Communication. - Naama Ben-David; Kartik Nayak (PODC, 2021)

Brief Announcement: Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish Faults. - Justin Kim; Vandan Mehta; Kartik Nayak; Nibesh Shrestha (PODC, 2021)

DP-Sync: Hiding Update Patterns in Secure Outsourced Databases with Differential Privacy. - Chenghong Wang; Johes Bater; Kartik Nayak; Ashwin Machanavajjhala (SIGMOD Conference, 2021)

Brief Announcement: Communication-Efficient BFT Using Small Trusted Hardware to Tolerate Minority Corruption. - Sravya Yandamuri; Ittai Abraham; Kartik Nayak; Michael K. Reiter (DISC, 2021)

Brief Note: Fast Authenticated Byzantine Consensus. - Ittai Abraham; Kartik Nayak; Ling Ren 001; Zhuolun Xiang (CoRR, 2021)

Classifying Trusted Hardware via Unidirectional Communication. - Naama Ben-David; Kartik Nayak (CoRR, 2021)

Optimal Good-case Latency for Rotating Leader Synchronous BFT. - Ittai Abraham; Kartik Nayak; Nibesh Shrestha (IACR Cryptol. ePrint Arch., 2021)

Efficient Adaptively-Secure Byzantine Agreement for Long Messages. - Amey Bhangale; Chen-Da Liu-Zhang; Julian Loss; Kartik Nayak (IACR Cryptol. ePrint Arch., 2021)

Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish Faults. - Justin Kim; Vandan Mehta; Kartik Nayak; Nibesh Shrestha (IACR Cryptol. ePrint Arch., 2021)

On the Anonymity Guarantees of Anonymous Proof-of-Stake Protocols. - Markulf Kohlweiss; Varun Madathil; Kartik Nayak; Alessandra Scafuro (IACR Cryptol. ePrint Arch., 2021)

Communication-Efficient BFT Protocols Using Small Trusted Hardware to Tolerate Minority Corruption. - Sravya Yandamuri; Ittai Abraham; Kartik Nayak; Michael K. Reiter (IACR Cryptol. ePrint Arch., 2021)

On the Limitations of Logic Locking the Approximate Circuits. - Kartik Nayak; Devanshi Upadhyaya; Francesco Regazzoni 001; Ilia Polian (AsianHOST, 2022)

Empirical Analysis of EIP-1559: Transaction Fees, Waiting Times, and Consensus Security. - Yulin Liu 002; Yuxuan Lu 001; Kartik Nayak; Fan Zhang 022; Luyao Zhang 001; Yinhong Zhao (CCS, 2022)

Communication-Efficient BFT Using Small Trusted Hardware to Tolerate Minority Corruption. - Sravya Yandamuri; Ittai Abraham; Kartik Nayak; Michael K. Reiter (OPODIS, 2022)

IncShrink: Architecting Efficient Outsourced Databases using Incremental MPC and Differential Privacy. - Chenghong Wang; Johes Bater; Kartik Nayak; Ashwin Machanavajjhala (SIGMOD Conference, 2022)

Empirical Analysis of EIP-1559: Transaction Fees, Waiting Time, and Consensus Security. - Yulin Liu 002; Yuxuan Lu 001; Kartik Nayak; Fan Zhang 022; Luyao Zhang 001; Yinhong Zhao (CoRR, 2022)

OptRand: Optimistically responsive distributed random beacons. - Adithya Bhat; Aniket Kate; Kartik Nayak; Nibesh Shrestha (IACR Cryptol. ePrint Arch., 2022)

Player-Replaceability and Forensic Support are Two Sides of the Same (Crypto) Coin. - Peiyao Sheng; Gerui Wang; Kartik Nayak; Sreeram Kannan; Pramod Viswanath (IACR Cryptol. ePrint Arch., 2022)

Transparent Batchable Time-lock Puzzles and Applications to Byzantine Consensus. - Shravan Srinivasan; Julian Loss; Giulio Malavolta; Kartik Nayak; Charalampos Papamanthou; Sri Aravinda Krishnan Thyagarajan (IACR Cryptol. ePrint Arch., 2022)

He-HTLC: Revisiting Incentives in HTLC. - Sarisht Wadhwa; Jannis Stoeter; Fan Zhang 022; Kartik Nayak (IACR Cryptol. ePrint Arch., 2022)

TrustBoost: Boosting Trust among Interoperable Blockchains. - Xuechao Wang; Peiyao Sheng; Sreeram Kannan; Kartik Nayak; Pramod Viswanath (IACR Cryptol. ePrint Arch., 2022)

Locality-Preserving Oblivious RAM. - Gilad Asharov; T.-H. Hubert Chan; Kartik Nayak; Rafael Pass; Ling Ren 001; Elaine Shi (J. Cryptol., 2022)

OptRand: Optimistically Responsive Reconfigurable Distributed Randomness. - Adithya Bhat; Nibesh Shrestha; Aniket Kate; Kartik Nayak (NDSS, 2023)

Communication and Round Efficient Parallel Broadcast Protocols. - Ittai Abraham; Kartik Nayak; Nibesh Shrestha (IACR Cryptol. ePrint Arch., 2023)

Abraxas: Throughput-Efficient Hybrid Asynchronous Consensus. - Erica Blum; Jonathan Katz; Julian Loss; Kartik Nayak; Simon Ochsenreither (IACR Cryptol. ePrint Arch., 2023)

Extended Abstract: HotStuff-2: Optimal Two-Phase Responsive BFT. - Dahlia Malkhi; Kartik Nayak (IACR Cryptol. ePrint Arch., 2023)

Breaking the Chains of Rationality: Understanding the Limitations to and Obtaining Order Policy Enforcement. - Sarisht Wadhwa; Luca Zanolini; Francesco D'Amato; Aditya Asgaonkar; Fan Zhang 022; Kartik Nayak (IACR Cryptol. ePrint Arch., 2023)

Private Proof-of-Stake Blockchains using Differentially-private Stake Distortion. - Chenghong Wang; David Pujol; Kartik Nayak; Ashwin Machanavajjhala (IACR Cryptol. ePrint Arch., 2023)

Longshot: Indexing Growing Databases using MPC and Differential Privacy. - Yanping Zhang; Johes Bater; Kartik Nayak; Ashwin Machanavajjhala (Proc. VLDB Endow., 2023)

OptORAMa: Optimal Oblivious RAM. - Gilad Asharov; Ilan Komargodski; Wei-Kai Lin; Kartik Nayak; Enoch Peserico; Elaine Shi (J. ACM, 2023)

Communication complexity of byzantine agreement, revisited. - Ittai Abraham; T.-H. Hubert Chan; Danny Dolev; Kartik Nayak; Rafael Pass; Ling Ren 001; Elaine Shi (Distributed Comput., 2023)

Data Independent Order Policy Enforcement: Limitations and Solutions. - Sarisht Wadhwa; Luca Zanolini; Aditya Asgaonkar; Francesco D'Amato; Chengrui Fang; Fan Zhang 022; Kartik Nayak (CCS, 2024)

Lumiere: Making Optimal BFT for Partial Synchrony Practical. - Andrew Lewis-Pye; Dahlia Malkhi; Oded Naor; Kartik Nayak (PODC, 2024)

Attacking and Improving the Tor Directory Protocol. - Zhongtang Luo; Adithya Bhat; Kartik Nayak; Aniket Kate (SP, 2024)

Granular Synchrony. - Neil Giridharan; Ittai Abraham; Natacha Crooks; Kartik Nayak; Ling Ren 001 (DISC, 2024)

Synchronous Distributed Key Generation without Broadcasts. - Nibesh Shrestha; Adithya Bhat; Aniket Kate; Kartik Nayak (IACR Commun. Cryptol., 2024)

Next-Generation Secure Distributed Computing (Dagstuhl Seminar 24362). - Aniket Kate; Julian Loss; Kartik Nayak (Dagstuhl Reports, 2024)

The Espresso Sequencing Network: HotShot Consensus, Tiramisu Data-Availability, and Builder-Exchange. - Jeb Bearer; Benedikt Bünz; Philippe Camacho; Binyi Chen; Ellie Davidson; Ben Fisch; Brendon Fish; Gus Gutoski; Fernando Krell; Chengyu Lin 006; Dahlia Malkhi; Kartik Nayak; et al. (IACR Cryptol. ePrint Arch., 2024)

Sailfish: Towards Improving Latency of DAG-based BFT. - Nibesh Shrestha; Aniket Kate; Kartik Nayak (IACR Cryptol. ePrint Arch., 2024)

Sailfish: Towards Improving the Latency of DAG-Based BFT. - Nibesh Shrestha; Rohan Shrothrium; Aniket Kate; Kartik Nayak (SP, 2025)

Decentralization of Ethereum's Builder Market. - Sen Yang; Kartik Nayak; Fan Zhang 022 (SP, 2025)

Leader Election with Poly-logarithmic Communication Per Party. - Amey Bhangale; Chen-Da Liu-Zhang; Julian Loss; Kartik Nayak; Sravya Yandamuri (IACR Cryptol. ePrint Arch., 2025)

Context-Dependent Threshold Decryption and its Applications. - Dan Boneh; Benedikt Bünz; Kartik Nayak; Lior Rotem; Victor Shoup (IACR Cryptol. ePrint Arch., 2025)

Recover from Excessive Faults in Partially-Synchronous BFT SMR. - Tiantian Gong; Gustavo Franco Camilo; Kartik Nayak; Andrew Lewis-Pye; Aniket Kate (IACR Cryptol. ePrint Arch., 2025)

The Pipes Model for Latency Analysis. - Andrew Lewis-Pye; Kartik Nayak; Nibesh Shrestha (IACR Cryptol. ePrint Arch., 2025)

Hydrangea: Optimistic Two-Round Partial Synchrony with One-Third Fault Resilience. - Nibesh Shrestha; Aniket Kate; Kartik Nayak (IACR Cryptol. ePrint Arch., 2025)

AUCIL: An Inclusion List Design for Rational Parties. - Sarisht Wadhwa; Julian Ma; Thomas Thiery; Barnabé Monnot; Luca Zanolini; Fan Zhang 022; Kartik Nayak (IACR Cryptol. ePrint Arch., 2025)

Low-Latency Dynamically Available Total Order Broadcast. - Sravya Yandamuri; Nibesh Shrestha; Luca Zanolini; Kartik Nayak (IACR Cryptol. ePrint Arch., 2025)

Optimistic, Signature-Free Reliable Broadcast and Its Applications. - Nibesh Shrestha; Qianyu Yu 001; Aniket Kate; Giuliano Losa; Kartik Nayak; Xuechao Wang (CoRR, 2025)