Follow
Kartik Nayak
Title
Cited by
Cited by
Year
Stubborn mining: Generalizing selfish mining and combining with an eclipse attack
K Nayak, S Kumar, A Miller, E Shi
2016 IEEE European Symposium on Security and Privacy (EuroS&P), 305-320, 2016
5402016
Oblivm: A programming framework for secure computation
C Liu, XS Wang, K Nayak, Y Huang, E Shi
2015 IEEE Symposium on Security and Privacy, 359-376, 2015
3712015
Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus
I Abraham, D Malkhi, K Nayak, L Ren, A Spiegelman
Conference on Principles of Distributed Systems, 2017
233*2017
Oblivious data structures
XS Wang, K Nayak, C Liu, TH Chan, E Shi, E Stefanov, Y Huang
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications …, 2014
2102014
Synchronous Byzantine Agreement with Expected O (1) Rounds, Expected O (n2) Communication, and Optimal Resilience
I Abraham, S Devadas, D Dolev, K Nayak, L Ren
Financial Cryptography and Data Security, 2019
152*2019
GraphSC: Parallel secure computation made easy
K Nayak, XS Wang, S Ioannidis, U Weinsberg, N Taft, E Shi
2015 IEEE Symposium on Security and Privacy, 377-394, 2015
1472015
Sync HotStuff: Simple and Practical State Machine Replication
I Abraham, D Malkhi, K Nayak, L Ren, M Yin
IACR Cryptology ePrint Archive, 2019
108*2019
Some vulnerabilities are different than others: Studying vulnerabilities and attack surfaces in the wild
K Nayak, D Marino, P Efstathopoulos, T Dumitraş
Research in Attacks, Intrusions and Defenses: 17th International Symposium …, 2014
1002014
Optorama: Optimal oblivious ram
G Asharov, I Komargodski, WK Lin, K Nayak, E Peserico, E Shi
Journal of the ACM 70 (1), 1-70, 2022
932022
Communication complexity of byzantine agreement, revisited
I Abraham, TH Chan, D Dolev, K Nayak, R Pass, L Ren, E Shi
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019
782019
Flexible Byzantine Fault Tolerance
D Malkhi, K Nayak, L Ren
arXiv preprint arXiv:1904.10067, 2019
782019
HOP: hardware makes obfuscation practical
K Nayak, CW Fletcher, L Ren, N Chandran, S Lokam, E Shi, V Goyal
24th Annual Network and Distributed System Security Symposium, NDSS, 2017
582017
Improved Extension Protocols for Byzantine Broadcast and Agreement
K Nayak, L Ren, E Shi, NH Vaidya, Z Xiang
arXiv preprint arXiv:2002.11321, 2020
502020
CCF: A framework for building confidential verifiable replicated services
M Russinovich, E Ashton, C Avanessians, M Castro, A Chamayou, ...
Technical report, Microsoft Research and Microsoft Azure, 2019
472019
Good-case latency of byzantine broadcast: A complete categorization
I Abraham, K Nayak, L Ren, Z Xiang
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing …, 2021
372021
Asymptotically tight bounds for composing ORAM with PIR
I Abraham, CW Fletcher, K Nayak, B Pinkas, L Ren
Public-Key Cryptography–PKC 2017: 20th IACR International Conference on …, 2017
362017
BFT protocol forensics
P Sheng, G Wang, K Nayak, S Kannan, P Viswanath
Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications …, 2021
30*2021
On the Optimality of Optimistic Responsiveness
N Shrestha, I Abraham, L Ren, K Nayak
Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications …, 2020
29*2020
Dfinity Consensus, Explored
I Abraham, D Malkhi, K Nayak, L Ren
IACR Cryptology ePrint Archive, 2018
24*2018
Randpiper–reconfiguration-friendly random beacons with quadratic communication
A Bhat, N Shrestha, Z Luo, A Kate, K Nayak
Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications …, 2021
232021
The system can't perform the operation now. Try again later.
Articles 1–20