K
Kartik Nayak
Researcher at Duke University
Publications - 67
Citations - 2864
Kartik Nayak is an academic researcher from Duke University. The author has contributed to research in topics: Byzantine fault tolerance & State machine replication. The author has an hindex of 22, co-authored 67 publications receiving 2107 citations. Previous affiliations of Kartik Nayak include VMware & University of Maryland, College Park.
Papers
More filters
Proceedings ArticleDOI
Stubborn Mining: Generalizing Selfish Mining and Combining with an Eclipse Attack
TL;DR: This paper expands the mining strategy space to include novel "stubborn" strategies that, for a large range of parameters, earn the miner more revenue, and shows how a miner can further amplify its gain by non-trivially composing mining attacks with network-level eclipse attacks.
Proceedings ArticleDOI
ObliVM: A Programming Framework for Secure Computation
TL;DR: This work develops various showcase applications such as data mining, streaming algorithms, graph algorithms, genomic data analysis, and data structures, and demonstrates the scalability of ObliVM to bigger data sizes.
Posted Content
Stubborn Mining: Generalizing Selfish Mining and Combining with an Eclipse Attack.
TL;DR: In this paper, the authors show that the selfish mining attack is not (in general) optimal and show how a miner can further amplify its gain by non-trivially composing mining attacks with network-level eclipse attacks.
Proceedings ArticleDOI
GraphSC: Parallel Secure Computation Made Easy
TL;DR: This work builds Graph SC, a framework that provides a programming paradigm that allows non-cryptography experts to write secure code, brings parallelism to such secure implementations, and meets the need for obliviousness, thereby not leaking any private information.
Posted Content
Oblivious Data Structures.
TL;DR: This work designs novel, asymptotically more efficient data structures and algorithms for programs whose data access patterns exhibit some degree of predictability and applies these techniques to a broad range of commonly used data structures, including maps, sets, priority-queues, stacks, deques; and algorithms.