Skip to main content

Siyao Guo

Postdoctoral Research Fellow

Guo, Siyao


Office Location

805 Columbus Avenue
606 Interdisciplinary Science & Engineering Complex (ISEC)
Boston, MA 02120

Mailing Address

Northeastern University
ATTN: Siyao Guo, 635 ISEC
805 Columbus Ave
Boston, MA 02120


  • PhD in Computer Science and Engineering, The Chinese University of Hong Kong
  • BS in Computer Science, Beijing Normal University


Siyao Guo is a postdoctoral fellow at Northeastern University working with Professor Daniel Wichs. Her research interests include pseudorandomness, complexity and cryptography.  She obtained her PhD from the Chinese University of Hong Kong. She was very fortunate to have Professor Andrej Bogdanov as her PhD advisor and have Professor Alon Rosen as her advisor during her internship at FACT center, IDC Herzliya.  Before coming to Northeastern University,  she spent a year at the Courant Institute of Mathematical Sciences, NYU, working with Professor Yevgeniy Dodis, and a semester at the Simons Institute for the Theory of Computing, Berkeley as a research fellow.

About Me

  • Hometown: Hunan, China

What are your research interests?

One specific type of question I have been working on is: can cryptography be implemented in very restricted/simple computational models? This line of research inherently lies in the intersection of computational complexity and cryptography. It is quite appealing for several reasons: (a) possibility results give fast and sound cryptography (b) impossibility results show limitation of those models, which may further help us to get better lower bounds in complexity theory. (c) the simplicity of those restricted models is fun for me to study.

Since last year, I have been playing with a model called auxiliary-input random oracle model (AI-ROM). The tranditional random oracle model (ROM) provides a simple and elegant way of analyzing the concrete security of cryptographic schemes based on hash functions, however traditional random oracle proofs are not useful: (a) security against non-uniform attackers; (b) security against preprocessing. AI-ROM is a simple extension of ROM which yields a clean and elegant way towards obtaining meaningful security bounds against non-uniform attackers and preprocessing. Quoting from my coauthor’s abstract: ROM-AI is the “new cool kid in town”: it nicely connects theory and practice, has a lot of exciting open questions, leads to beautiful math, short definitions, elegant proofs, surprising algorithms, and is still in its infancy. In short, you should work on it!