Co-authors
9
list available
Resume (English only)
Academic Achievements
- Published several preprint papers, including but not limited to 'New Upper and Lower Bounds for Perfectly Secure MPC', 'Trapdoor Hash Functions and PIR from Low-Noise LPN', etc.; Participated in peer-reviewed research works such as 'Shorter, Tighter, FAESTer: Optimizations and Improved (QROM) Analysis for VOLE-in-the-Head Signatures'.
Research Experience
- Gained experience in systems security during an internship at IBM in 2018, then fully switched to cryptography in 2019 while maintaining a side interest in systems security.
Education
- Sep. 2017 – Oct. 2022: Ph.D. in Computer Science – Cryptography from Oregon State University, Advisor: Mike Rosulek, Thesis: 'Communication-Efficient Secure Two-Party Computation From Minicrypt and OT'; Sep. 2017 – Mar. 2020: M.S. in Computer Science – Cryptography from Oregon State University, Project: 'A Complete Characterization of Security for Linicrypt Block Cipher Modes'.
Background
- Research interests include secure multi-party computation, oblivious transfer (OT), OT extension, garbled circuits, homomorphic secret sharing, and advanced lattice primitives. Also interested in formal verification and proofs for cryptography and cybersecurity more generally.
Miscellany
- Personal interests not detailed.