Scholars@Duke

• Background
• 

  Education, Training, & Certifications

  • Ph.D., University of Maryland, College Park 2018
• Research
• 

  Selected Grants

  • CAREER: Scalable Consensus Protocol Design with Accountability and Privacy under Practical Failure Models awarded by  National Science Foundation 2023 - 2028
  • Collaborative Research: SaTC: CORE: Medium: Quicksilver: a Write-oriented, Private, Outsourced Relational Database Management System awarded by  National Science Foundation 2020 - 2024
  • RAPID: Poirot: From Contact Tracing to Private Exposure Detection awarded by  National Science Foundation 2020 - 2022
• 

  External Relationships

  • Espresso Systems
  • Facebook Corporation (Meta)
• Publications & Artistic Works
• 

  Selected Publications

  • Academic Articles

    • Abraham, I., T. H. H. Chan, D. Dolev, K. Nayak, R. Pass, L. Ren, and E. Shi. “Communication complexity of byzantine agreement, revisited.” Distributed Computing 36, no. 1 (March 1, 2023): 3–28. https://doi.org/10.1007/s00446-022-00428-8.
       Full Text
    • Asharov, G., I. Komargodski, W. K. Lin, K. Nayak, E. Peserico, and E. Shi. “OptORAMa: Optimal Oblivious RAM.” Journal of the Acm 70, no. 1 (December 20, 2022). https://doi.org/10.1145/3566049.
       Full Text
    • Asharov, G., T. H. H. Chan, K. Nayak, R. Pass, L. Ren, and E. Shi. “Locality-Preserving Oblivious RAM.” Journal of Cryptology 35, no. 2 (April 1, 2022). https://doi.org/10.1007/s00145-022-09419-1.
       Full Text

  • Conference Papers

    • Yandamuri, S., I. Abraham, K. Nayak, and M. K. Reiter. “Communication-Efficient BFT Using Small Trusted Hardware to Tolerate Minority Corruption.” In Leibniz International Proceedings in Informatics, Lipics, Vol. 253, 2023. https://doi.org/10.4230/LIPIcs.OPODIS.2022.24.
       Full Text
    • Liu, Y., Y. Lu, K. Nayak, F. Zhang, L. Zhang, and Y. Zhao. “Empirical Analysis of EIP-1559: Transaction Fees, Waiting Times, and Consensus Security.” In Proceedings of the Acm Conference on Computer and Communications Security, 2099–2113, 2022. https://doi.org/10.1145/3548606.3559341.
       Full Text
    • Wang, C., J. Bater, K. Nayak, and A. MacHanavajjhala. “IncShrink: Architecting Efficient Outsourced Databases using Incremental MPC and Differential Privacy.” In Proceedings of the Acm Sigmod International Conference on Management of Data, 818–32, 2022. https://doi.org/10.1145/3514221.3526151.
       Full Text
    • Abraham, I., K. Nayak, and N. Shrestha. “Optimal Good-Case Latency for Rotating Leader Synchronous BFT.” In Leibniz International Proceedings in Informatics, Lipics, Vol. 217, 2022. https://doi.org/10.4230/LIPIcs.OPODIS.2021.27.
       Full Text
    • Bhangale, A., C. D. Liu-Zhang, J. Loss, and K. Nayak. “Efficient Adaptively-Secure Byzantine Agreement for Long Messages.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 13791 LNCS:504–25, 2022. https://doi.org/10.1007/978-3-031-22963-3_17.
       Full Text
    • Bhat, A., N. Shrestha, Z. Luo, A. Kate, and K. Nayak. “RandPiper - Reconfiguration-Friendly Random Beacons with Quadratic Communication.” In Proceedings of the Acm Conference on Computer and Communications Security, 3502–24, 2021. https://doi.org/10.1145/3460120.3484574.
       Full Text
    • Sheng, P., G. Wang, K. Nayak, S. Kannan, and P. Viswanath. “BFT Protocol Forensics.” In Proceedings of the Acm Conference on Computer and Communications Security, 1722–43, 2021. https://doi.org/10.1145/3460120.3484566.
       Full Text
    • Yandamuri, S., I. Abraham, K. Nayak, and M. Reiter. “Brief announcement: Communication-efficient BFT using small trusted hardware to tolerate minority corruption.” In Leibniz International Proceedings in Informatics, Lipics, Vol. 209, 2021. https://doi.org/10.4230/LIPIcs.DISC.2021.62.
       Full Text
    • Abraham, I., K. Nayak, L. Ren, and Z. Xiang. “Good-case Latency of Byzantine Broadcast: A Complete Categorization.” In Proceedings of the Annual Acm Symposium on Principles of Distributed Computing, 331–41, 2021. https://doi.org/10.1145/3465084.3467899.
       Full Text
    • Ben-David, N., and K. Nayak. “Brief Announcement: Classifying Trusted Hardware via Unidirectional Communication.” In Proceedings of the Annual Acm Symposium on Principles of Distributed Computing, 191–94, 2021. https://doi.org/10.1145/3465084.3467948.
       Full Text
    • Kim, J., V. Mehta, K. Nayak, and N. Shrestha. “Brief Announcement: Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish Faults.” In Proceedings of the Annual Acm Symposium on Principles of Distributed Computing, 375–77, 2021. https://doi.org/10.1145/3465084.3467954.
       Full Text
    • Chan, T. H. H., E. Shi, W. K. Lin, and K. Nayak. “Perfectly oblivious (parallel) RAM revisited, and improved constructions.” In Leibniz International Proceedings in Informatics, Lipics, Vol. 199, 2021. https://doi.org/10.4230/LIPIcs.ITC.2021.8.
       Full Text
    • Xiang, Z., D. Malkhi, K. Nayak, and L. Ren. “Strengthened fault tolerance in byzantine fault tolerant replication.” In Proceedings  International Conference on Distributed Computing Systems, 2021-July:205–15, 2021. https://doi.org/10.1109/ICDCS51616.2021.00028.
       Full Text
    • Kohlweiss, M., V. Madathil, K. Nayak, and A. Scafuro. “On the anonymity guarantees of anonymous proof-of-stake protocols.” In Proceedings  Ieee Symposium on Security and Privacy, 2021-May:1818–33, 2021. https://doi.org/10.1109/SP40001.2021.00107.
       Full Text
    • Wang, C., J. Bater, K. Nayak, and A. MacHanavajjhala. “DP-Sync: Hiding Update Patterns in Secure Outsourced Databases with Differential Privacy.” In Proceedings of the Acm Sigmod International Conference on Management of Data, 1892–1905, 2021. https://doi.org/10.1145/3448016.3457306.
       Full Text
    • Zhang, Y., C. Wang, D. Pujol, J. Bater, M. Lentz, A. MacHanavajjhala, K. Nayak, L. Vasudevan, and J. Yang. “Poirot: Private contact summary aggregation: Poster abstract.” In Sensys 2020  Proceedings of the 2020 18th Acm Conference on Embedded Networked Sensor Systems, 774–75, 2020. https://doi.org/10.1145/3384419.3430603.
       Full Text
    • Shrestha, N., I. Abraham, L. Ren, and K. Nayak. “On the Optimality of Optimistic Responsiveness.” In Proceedings of the Acm Conference on Computer and Communications Security, 839–57, 2020. https://doi.org/10.1145/3372297.3417284.
       Full Text
    • Abraham, I., K. Nayak, L. Ren, and Z. Xiang. “Brief announcement: Byzantine agreement, broadcast and state machine replication with optimal good-case latency.” In Leibniz International Proceedings in Informatics, Lipics, Vol. 179, 2020. https://doi.org/10.4230/LIPIcs.DISC.2020.47.
       Full Text
    • Nayak, K., L. Ren, E. Shi, N. H. Vaidya, and Z. Xiang. “Improved extension protocols for byzantine broadcast and agreement.” In Leibniz International Proceedings in Informatics, Lipics, Vol. 179, 2020. https://doi.org/10.4230/LIPIcs.DISC.2020.28.
       Full Text
    • Abraham, I., D. Malkhi, K. Nayak, L. Ren, and M. Yin. “Sync HotStuff: Simple and practical synchronous state machine replication.” In Proceedings  Ieee Symposium on Security and Privacy, 2020-May:106–18, 2020. https://doi.org/10.1109/SP40000.2020.00044.
       Full Text
    • Asharov, G., I. Komargodski, W. K. Lin, K. Nayak, E. Peserico, and E. Shi. “OptORAMa: Optimal Oblivious RAM.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 12106 LNCS:403–32, 2020. https://doi.org/10.1007/978-3-030-45724-2_14.
       Full Text
    • Malkhi, D., K. Nayak, and L. Ren. “Flexible Byzantine fault tolerance.” In Proceedings of the Acm Conference on Computer and Communications Security, 1041–53, 2019. https://doi.org/10.1145/3319535.3354225.
       Full Text
    • Abraham, I., T. H. H. Chan, D. Dolev, K. Nayak, R. Pass, L. Ren, and E. Shi. “Communication complexity of byzantine agreement, revisited.” In Proceedings of the Annual Acm Symposium on Principles of Distributed Computing, 317–26, 2019. https://doi.org/10.1145/3293611.3331629.
       Full Text
    • Abraham, I., S. Devadas, D. Dolev, K. Nayak, and L. Ren. “Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected $$O(n^2)$$ Communication, and Optimal Resilience.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11598 LNCS:320–34, 2019. https://doi.org/10.1007/978-3-030-32101-7_20.
       Full Text
    • Asharov, G., T. H. Hubert Chan, K. Nayak, R. Pass, L. Ren, and E. Shi. “Locality-preserving oblivious RAM.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11477 LNCS:214–43, 2019. https://doi.org/10.1007/978-3-030-17656-3_8.
       Full Text
    • Abraham, I., D. Malkhi, K. Nayak, L. Ren, and A. Spiegelman. “Solida: A blockchain protocol based on reconfigurable Byzantine consensus.” In Leibniz International Proceedings in Informatics, Lipics, Vol. 95, 2018. https://doi.org/10.4230/LIPIcs.OPODIS.2017.25.
       Full Text
    • Chan, T. H. H., J. Katz, K. Nayak, A. Polychroniadou, and E. Shi. “More is less: Perfectly secure oblivious algorithms in the multi-server setting.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11274 LNCS:158–88, 2018. https://doi.org/10.1007/978-3-030-03332-3_7.
       Full Text
    • Chan, T. H. H., K. Nayak, and E. Shi. “Perfectly Secure Oblivious Parallel RAM.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11240 LNCS:636–68, 2018. https://doi.org/10.1007/978-3-030-03810-6_23.
       Full Text
    • Abraham, I., S. Devadas, K. Nayak, and L. Ren. “Brief announcement: Practical synchronous byzantine consensus.” In Leibniz International Proceedings in Informatics, Lipics, Vol. 91, 2017. https://doi.org/10.4230/LIPIcs.DISC.2017.41.
       Full Text
    • Indela, S., M. Kulkarni, K. Nayak, and T. Dumitraş. “Toward Semantic Cryptography APIs.” In Proceedings  2016 Ieee Cybersecurity Development, Secdev 2016, 9–14, 2017. https://doi.org/10.1109/SecDev.2016.014.
       Full Text
    • Abraham, I., C. W. Fletcher, K. Nayak, B. Pinkas, and L. Ren. “Asymptotically tight bounds for composing ORAM with PIR.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 10174 LNCS:91–120, 2017. https://doi.org/10.1007/978-3-662-54365-8_5.
       Full Text
    • Indela, S., M. Kulkarni, K. Nayak, and T. Dumitras. “Helping johnny encrypt: Toward semantic interfaces for cryptographic frameworks.” In Onward! 2016  Proceedings of the 2016 Acm International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software, 180–96, 2016. https://doi.org/10.1145/2986012.2986024.
       Full Text
    • Nayak, K., S. Kumar, A. Miller, and E. Shi. “Stubborn mining: Generalizing selfish mining and combining with an eclipse attack.” In Proceedings  2016 Ieee European Symposium on Security and Privacy, Euro S and P 2016, 305–20, 2016. https://doi.org/10.1109/EuroSP.2016.32.
       Full Text
    • Liu, C., X. S. Wang, K. Nayak, Y. Huang, and E. Shi. “ObliVM: A programming framework for secure computation.” In Proceedings  Ieee Symposium on Security and Privacy, 2015-July:359–76, 2015. https://doi.org/10.1109/SP.2015.29.
       Full Text
    • Nayak, K., X. S. Wang, S. Ioannidis, U. Weinsberg, N. Taft, and E. Shi. “GraphSC: Parallel secure computation made easy.” In Proceedings  Ieee Symposium on Security and Privacy, 2015-July:377–94, 2015. https://doi.org/10.1109/SP.2015.30.
       Full Text
    • Wang, X. S., K. Nayak, C. Liu, T. H. H. Chan, E. Shi, E. Stefanov, and Y. Huang. “Oblivious data structures.” In Proceedings of the Acm Conference on Computer and Communications Security, 215–26, 2014. https://doi.org/10.1145/2660267.2660314.
       Full Text
    • Nayak, K., D. Marino, P. Efstathopoulos, and T. Dumitraş. “Some vulnerabilities are different than others: Studying vulnerabilities and attack surfaces in the wild.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8688 LNCS:426–46, 2014. https://doi.org/10.1007/978-3-319-11379-1_21.
       Full Text
• Teaching & Mentoring
• 

  Recent Courses

  • COMPSCI 394: Research Independent Study 2023
  • COMPSCI 351: Computer Security 2022
  • COMPSCI 590: Advanced Topics in Computer Science 2022
  • HOUSECS 59: House Course 2022
  • COMPSCI 351: Computer Security 2021
  • COMPSCI 391: Independent Study 2021
  • COMPSCI 590: Advanced Topics in Computer Science 2021
  • HOUSECS 59: House Course 2021

Some information on this profile has been compiled automatically from Duke databases and external sources. (Our About page explains how this works.) If you see a problem with the information, please write to Scholars@Duke and let us know. We will reply promptly.