I am a cryptographer and a postdoctoral fellow in the School of Cybersecurity and Privacy at Georgia Tech, working with Vassilis Zikas. I have broad interests across both theoretical and applied cryptography. Currently, I work on the foundations of secure distributed computation: how mutually distrusting parties can compute, agree, and generate shared randomness over real networks. In these networks, messages may be delayed, communication links may be missing, a majority of participants may be corrupted, and many protocols run side by side.
My research spans secure multiparty computation (MPC), fault-tolerant distributed protocols (Byzantine agreement, broadcast, and distributed randomness), composable security, and black-box compilers. Across these topics, I combine lower bounds with new round-efficient constructions, and I aim for security guarantees that survive composition and real-world deployment. More broadly, I develop theory that is both motivated by and relevant to more realistic practical settings. My results appear in venues such as TCC and the Journal of Cryptology. I have also brought this work to industry, through a research internship at Input Output Global on composable security for smart contracts and decentralized applications, and through industry-sponsored research on round-efficient Byzantine agreement.
I received my PhD in Computer Science from Texas A&M University in 2025, advised by Juan Garay. My dissertation was on the secure composition of asynchronous cryptographic protocols. Before that, I earned an MS in Electrical Engineering (Secure Communication and Cryptography) from Sharif University of Technology.
Also, my ErdΕs number is 3. π
