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
4272016
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
3022015
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
161*2014
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
154*2017
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
1252015
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
91*2019
Some vulnerabilities are different than others
K Nayak, D Marino, P Efstathopoulos, T Dumitraş
International Workshop on Recent Advances in Intrusion Detection, 426-446, 2014
832014
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
532017
Optorama: Optimal oblivious ram
G Asharov, I Komargodski, WK Lin, K Nayak, E Peserico, E Shi
Annual International Conference on the Theory and Applications of …, 2020
512020
Sync HotStuff: Simple and Practical State Machine Replication
I Abraham, D Malkhi, K Nayak, L Ren, M Yin
IACR Cryptology ePrint Archive, 2019
46*2019
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
38*2019
Flexible Byzantine Fault Tolerance
D Malkhi, K Nayak, L Ren
arXiv preprint arXiv:1904.10067, 2019
302019
Asymptotically Tight Bounds for Composing ORAM with PIR
I Abraham, CW Fletcher, K Nayak, B Pinkas, L Ren
IACR International Workshop on Public Key Cryptography, 91-120, 2017
302017
CCF: A framework for building confidential verifiable replicated services
M Russinovich, E Ashton, C Avanessians, M Castro, A Chamayou, ...
Technical Report MSR-TR-201916, 2019
21*2019
Locality-preserving oblivious ram
G Asharov, THH Chan, K Nayak, R Pass, L Ren, E Shi
Annual International Conference on the Theory and Applications of …, 2019
20*2019
Dfinity Consensus, Explored
I Abraham, D Malkhi, K Nayak, L Ren
IACR Cryptology ePrint Archive, 2018
15*2018
Perfectly secure oblivious parallel RAM
THH Chan, K Nayak, E Shi
Theory of Cryptography Conference, 636-668, 2018
142018
An Oblivious Parallel RAM with O (log2 N) Parallel Runtime Blowup.
K Nayak, J Katz
IACR Cryptology ePrint Archive 2016, 1141, 2016
142016
More is less: Perfectly secure oblivious algorithms in the multi-server setting
THH Chan, J Katz, K Nayak, A Polychroniadou, E Shi
International Conference on the Theory and Application of Cryptology and …, 2018
132018
Brief announcement: Practical synchronous byzantine consensus
I Abraham, S Devadas, K Nayak, L Ren
LIPIcs-Leibniz International Proceedings in Informatics 91, 2017
132017
The system can't perform the operation now. Try again later.
Articles 1–20