3499_0918248.jpg

Kartik Nayak

Privacy-Preserving Systems Consensus Protocols Applied Cryptography Blockchain Protocols

About

Kartik Nayak is an Associate Professor of Computer Science at Duke University, where he conducts research in security, applied cryptography, distributed computing, and blockchain protocols. His work focuses on designing robust and efficient privacy‑preserving systems and consensus protocols, and he teaches courses such as computer security and blockchain foundations. He earned his Ph.D. in Computer Science from the University of Maryland.

Research Performance Summary

104
Total Papers
5475
Total Citations
33
H-Index
2014-2026
Active Research Span

First Recorded Paper

Oblivious data structures

Year: 2014

Citations: 297

Venue: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications

Latest Recorded Paper

Boost+: Equitable, Incentive-Compatible Block Building

Year: 2026

Citations: 0

Venue: arXiv preprint arXiv:2602.04007

Last 10 Years Publication Activity

This timeline shows the professor's yearly publication activity.

2026
2
2025
14
2024
6
2023
13
2022
12
2021
17
2020
10
2019
7
2018
7
2017
4
2016
6

Publication Venues and Collaboration

Journal, Conference, and Book Publication Breakdown

Conference 49
Journal 3
Book 0

Top Coauthors

Nayak Ren Abraham

Research Impact by Period

2025-2026

Period Stats
Papers 16
Citations 133
Avg. Citations / Paper 8.3
H-Index 5

2020-2024

Period Stats
Papers 58
Citations 1672
Avg. Citations / Paper 28.8
H-Index 22

2015-2019

Period Stats
Papers 28
Citations 3247
Avg. Citations / Paper 116
H-Index 18

2010-2014

Period Stats
Papers 2
Citations 423
Avg. Citations / Paper 211.5
H-Index 2

Contact and Professional Links

Contact Information

kartik@cs.duke.edu

Detected Research Keywords

Flexible Byzantine Fault Byzantine Fault Tolerance State Machine Replication Good Case Latency Synchronous Byzantine Agreement Optimal Good Case Byzantine Agreement Expected Byzantine Fault Tolerant Oblivious Parallel Ram Communication Efficient Bft