I am a second year PhD student working with Professor Yevgeniy Dodis in the Cryptography Lab at NYU. We work on projects that apply rigorous formal analysis to real-world protocols. We have focused on Secure Group Messaging and Video Chat — specifically efficient group key agreement protocols with robust security properties and associated communication complexity lower bounds — and private outsourced storage protocols — specifically a tight computational complexity lower bound for a decades-old forward secret storage primitive and a combination of the primitive with oblivious RAM that adds (almost) no additional overhead.

I previously obtained a BS in Computer Science from Columbia University, where I worked with Professor Allison Bishop. We worked on projects related to Lattice-Based Cryptography and its connections (or lack thereof) with Group-Based Cryptography.


  • Cryptography
  • Algorithms
  • Complexity Theory
  • Theoretical Computer Science


  • PhD in Computer Science, 2019 - present

    New York University

  • BS in Computer Science, 2015 - 2019

    Columbia University


Multicast Key Agreement, Revisited

Secure Group Messaging (SGM) protocols allow groups of users to asynchronously and securely communicate with each other. They have …

Forward Secret Encrypted RAM: Lower Bounds and Applications

In this paper, we study forward secret encrypted RAMs (FS eRAMs) which enable clients to outsource the storage of an n-entry array to a …

On the Price of Concurrency in Group Ratcheting Protocols

Post-Compromise Security, or PCS, refers to the ability of a given protocol to recover—by means of normal protocol operations—from the …

From discrete-log to lattices: maybe the real lessons were our broken schemes along the way?

In the fall of 2018, a professor became obsessed with conspiracy theories of deeper connections between discrete-log based cryptography …


Basic Algorithms
Fundamental Algorithms
Computer Science Theory
Malware Analysis & Reverse Engineering
Computing in Context