News
- Presented On the Round Complexity of Dishonest-Majority MPC at TCC 2026 in New York.
- Our preprint The Price of Agreement in Secure Multiparty Computation is available on the Cryptology ePrint Archive.
- Presented Is It Even Possible? On the Parallel Composition of Asynchronous MPC Protocols at the Georgia Tech Cryptography Seminar.
- Our preprint Randomized Early-Stopping Byzantine Agreement with Applications to Round-Efficient MPC is available on the Cryptology ePrint Archive.
- Our paper On the Round Complexity of Dishonest-Majority MPC was accepted to TCC 2026.
- Joined the School of Cybersecurity and Privacy at Georgia Tech as a postdoctoral fellow with Vassilis Zikas.
- Our paper Universally Composable Almost-Everywhere Secure Computation appeared in the Journal of Cryptology.
- Our paper Is It Even Possible? On the Parallel Composition of Asynchronous MPC Protocols appeared at TCC 2025 in Aarhus.
- Completed my PhD in Computer Science at Texas A&M University. Dissertation: Secure Parallel Composition of Asynchronous Cryptographic Protocols.
- Started a summer research internship at Input Output Global, working on composable security for smart contracts and decentralized applications.
- Spoke at Texas Crypto Day on the parallel composition of asynchronous protocols.
