I am an assistant professor in the Computer Science department at Yale University. Before Yale, I was a postdoc at UC Berkeley working with Raluca Ada Popa and Alessandro Chiesa. I completed my Ph.D. at MIT, where I was advised by Vinod Vaikuntanathan.

  • Theoretical Cryptography
  • Post-Quantum Cryptography
  • Complexity Theory
  • Secure Computation
  • PhD in Computer Science, 2020

    Massachusetts Institute of Technology

  • MSc in Computer Science, 2016

    Massachusetts Institute of Technology

  • BSc in Applied Mathematics, 2013

    National Technical University of Athens


HOLMES: Efficient Distribution Testing for Secure Collaborative Learning

USENIX Security, 2023
Lattice-Based Succinct Arguments for NP with Polylogarithmic-Time Verification

CRYPTO, 2023
Sumcheck Arguments and Their Applications

CRYPTO, 2021
A Topological Characterization of Modulo-p Arguments and Implications for Necklace Splitting

SODA, 2021
Consensus-Halving: Does It Ever Get Easier?

EC, 2020 (Appeared in SIAM Journal on Computing)
Limits on the Efficiency of (Ring) LWE Based Non-interactive Key Exchange

PKC, 2020 (Appeared in Journal of Cryptology)
On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem

CCC, 2020
Towards Non-Interactive Zero-Knowledge for NP from LWE

PKC, 2019 (Appeared in Journal of Cryptology)
PPP-Completeness with Connections to Cryptography

FOCS, 2018
Agreement in Partitioned Dynamic Networks

DISC, 2014
Occupational Fraud Detection Through Visualization

ISI, 2013