I am a PhD student in Computer Science at Cornell Tech. I am very fortunate to be advised by Prof. Rafael Pass and Prof. Elaine Shi. My work won the Best Paper Award at CRYPTO'21 and the NSA's Best Cybersecurity Research Paper in 2022. I am a recipient of the 2022 JP Morgan PhD Fellowship.
I am interested in Cryptography and the field of Meta-Complexity. My research has focused on:- OWFs from Kolmogorov Complexity: I demonstrate the existence of the first natural problem whose average-case hardness characterizes the existence of the most basic cryptographic primitive: one-way functions (OWFs) [LP20].
- Towards OWFs from NP ≠ P: I work on developing a principled approach towards this. I connect OWFs with (1) EXP-completeness [LP21a]; (2) NP-completeness [LP22]; (3) sublinear-hardness [LP21b]; and (4) worst-case hardness [LP24].
- Characterizing Key Exchange and Beyond: I introduce the first (seemingly) unstructured problem whose hardness characterizes the existence of Key Exchange (KE) [BLMP23]. More recently, I have worked on characterizing public-key encryption (PKE) [LMP25], and witness encryption (WE) [LMP24].