متابعة
Kartik Nayak
Kartik Nayak
Duke University
بريد إلكتروني تم التحقق منه على cs.duke.edu - الصفحة الرئيسية
عنوان
عدد مرات الاقتباسات
عدد مرات الاقتباسات
السنة
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‏
6622016
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‏
4772015
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‏
309*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‏
2822014
Sync HotStuff: Simple and Practical State Machine Replication‏
I Abraham, D Malkhi, K Nayak, L Ren, M Yin‏
IACR Cryptology ePrint Archive, 2019‏
256*2019
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‏
233*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‏
2042015
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‏
1592019
Flexible Byzantine Fault Tolerance‏
D Malkhi, K Nayak, L Ren‏
arXiv preprint arXiv:1904.10067, 2019‏
1412019
OptORAMa: optimal oblivious RAM‏
G Asharov, I Komargodski, WK Lin, K Nayak, E Peserico, E Shi‏
Advances in Cryptology–EUROCRYPT 2020: 39th Annual International Conference …, 2020‏
1382020
Some vulnerabilities are different than others: Studying vulnerabilities and attack surfaces in the wild‏
K Nayak, D Marino, P Efstathopoulos, T Dumitraş‏
International Workshop on Recent Advances in Intrusion Detection, 426-446, 2014‏
1182014
Empirical analysis of eip-1559: Transaction fees, waiting times, and consensus security‏
Y Liu, Y Lu, K Nayak, F Zhang, L Zhang, Y Zhao‏
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications …, 2022‏
1142022
Improved Extension Protocols for Byzantine Broadcast and Agreement‏
K Nayak, L Ren, E Shi, NH Vaidya, Z Xiang‏
arXiv preprint arXiv:2002.11321, 2020‏
1142020
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‏
952021
CCF: A framework for building confidential verifiable replicated services‏
M Russinovich, E Ashton, C Avanessians, M Castro, A Chamayou, ...‏
Microsoft, Redmond, WA, USA, Tech. Rep. MSR-TR-2019-16, 2019‏
892019
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‏
872021
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‏
762021
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‏
672017
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‏
562020
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‏
462017
يتعذر على النظام إجراء العملية في الوقت الحالي. عاود المحاولة لاحقًا.
مقالات 1–20