Baiyu Li at

Welcome to my personal website! I am a Research Scientist at Google. I work on lattice-based cryptography, especially its use in homomorphic encryption and other advanced cryptographic primitives, and secure computation in general. I'm also interested in using formal methods in cryptography, including symbolic techniques and formal models for secure computation protocols.

I graduated with a Ph.D. in CS from UC San Diego in 2021, studying cryptography. I was very fortunate to be advised by Daniele Micciancio.

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.


  • Hintless Single-Server Private Information Retrieval. ePrint Code Baiyu Li, Daniele Micciancio, Mariana Raykova, Mark Schultz-WuCRYPTO 2024
  • Computationally Secure Aggregation and Private Information Retrieval in the Shuffle Model. ePrint Adrià Gascón, Yuval Ishai, Mahimna Kelkar, Baiyu Li, Yiping Ma, Mariana RaykovaCCS 2024
  • ACORN: Input Validation for Secure Aggregation. ePrint James Bell, Adrià Gascón, Tancrède Lepoint, Baiyu Li, Sarah Meiklejohn, Mariana Raykova, Cathie YunUSENIX Security 2023
  • Securing Approximate Homomorphic Encryption Using Differential Privacy. ePrint Baiyu Li, Daniele Micciancio, Mark Schultz, Jessica SorrellCRYPTO 2022
  • 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)