Baiyu Li

baiyu at

Welcome to my personal website! I just graduated with a Ph.D. in CS from UC San Diego, studying cryptography. I am very fortunate to be advised by Daniele Micciancio.

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 Baiyu Li, Daniele MicciancioEUROCRYPT 2021
  • Gadget-Based iNTRU Lattice Trapdoors. ePrint Code Nicholas Genise, Baiyu LiINDOCRYPT 2020
  • Homomorphic Encryption for Finite Automata. ePrint Nicholas Genise, Craig Gentry, Shai Halevi, Baiyu Li, Daniele MicciancioASIACRYPT 2019
  • Semi-parallel Logistic Regression for GWAS on Encrypted Data. ePrint Miran Kim, Yongsoo Song, Baiyu Li, Daniele MicciancioBMC Med Genomics 13, 99 (2020)
  • Symbolic Security of Garbled Circuits. ePrint Haskell code Baiyu Li, Daniele MicciancioCSF 2018
  • Equational Security Proofs of Oblivious Transfer Protocols. ePrint Baiyu Li, Daniele MicciancioPKC 2018
  • Compactness vs Collusion Resistance in Functional Encryption. ePrint Baiyu Li, Daniele MicciancioTCC 2016-B
  • Syntactic Complexity of R- and J-Trivial Regular Languages. arXiv Janusz A. Brzozowski, Baiyu LiDCFS 2013, extended version in Int. J. Found. Comput. Sci. 25(7)
  • SkypeMorph: protocol obfuscation for Tor bridges. doi Hooman Mohajeri Moghaddam, Baiyu Li, Mohammad Derakhshani, Ian GoldbergCCS 2012
  • Syntactic Complexities of Six Classes of Star-Free Languages. doi Janusz A. Brzozowski, Baiyu Li, David LiuJ. Autom. Lang. Comb. 17(2-4): 83-105 (2012)
  • Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages. arXiv Janusz A. Brzozowski, Baiyu Li, Yuli YeDCFS 2011, extended version in Theor. Comput. Sci. 449: 37-53 (2012)
  • Quotient Complexity of Ideal Languages. arXiv Janusz A. Brzozowski, Galina Jirásková, Baiyu LiLATIN 2010, extended version in Theor. Comput. Sci. 470: 36-52 (2013)