I'm interested in using formal methods to improve cryptographic constructions and security proofs, including using symbolic techniques and computer-aided tools, and designing more concise and abstract formal models for secure computation protocols. I'm also interested in lattice-based cryptography, especially its use in homomorphic encryption and digital signature schemes. Besides, I'm boardly interested in many cryptographic constructions.
Prior to UCSD, I graduated with a Bachelor degree in CS/Pure Math and a Master's degree in CS from the University of Waterloo, advised by Janusz Brzozowski. In Waterloo, I studied descriptional complexity problems on finite automata and regular languages.
- On the Security of Homomorphic Encryption on Approximate Numbers. ePrint Code EUROCRYPT 2021
- Gadget-Based iNTRU Lattice Trapdoors. ePrint Code INDOCRYPT 2020
- Homomorphic Encryption for Finite Automata. ePrint ASIACRYPT 2019
- Semi-parallel Logistic Regression for GWAS on Encrypted Data. ePrint BMC Med Genomics 13, 99 (2020)
- Symbolic Security of Garbled Circuits. ePrint Haskell code CSF 2018
- Equational Security Proofs of Oblivious Transfer Protocols. ePrint PKC 2018
- Compactness vs Collusion Resistance in Functional Encryption. ePrint TCC 2016-B
- Syntactic Complexity of R- and J-Trivial Regular Languages. arXiv DCFS 2013, extended version in Int. J. Found. Comput. Sci. 25(7)
- SkypeMorph: protocol obfuscation for Tor bridges. doi CCS 2012
- Syntactic Complexities of Six Classes of Star-Free Languages. doi J. Autom. Lang. Comb. 17(2-4): 83-105 (2012)
- Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages. arXiv DCFS 2011, extended version in Theor. Comput. Sci. 449: 37-53 (2012)
- Quotient Complexity of Ideal Languages. arXiv LATIN 2010, extended version in Theor. Comput. Sci. 470: 36-52 (2013)