Lisa Yang



I am a fourth year graduate student in the computer science department at MIT. I am fortunate to be advised by Yael Tauman Kalai and Vinod Vaikuntanathan and grateful to be supported by a NSF fellowship and Siebel scholarship. Previously I completed my B.S. in Mathematics at MIT.

My current research interests are in the intersection between mathematics / theoretical computer science, and the physical world.
My research within theoretical computer science focuses on cryptography, complexity theory, and quantum computation.

Email: lisayang at mit dot edu

Office: 32 Vassar St G636, Cambridge MA 02139



For an up to date list, see my dblp page.

1. “Delegation with Updatable Unambiguous Proofs and PPAD-Hardness”

    Yael Tauman Kalai, Omer Paneth, Lisa Yang. International Cryptology Conference CRYPTO 2020.

  • Talk given at CRYPTO 2020.

  • Invited talk at the Charles River Crypto Day and Cornell Crypto Seminar.

2. “How to Delegate Computations Publicly”

    Yael Tauman Kalai, Omer Paneth, Lisa Yang. Symposium on Theory of Computing STOC 2019.

3. “On Publicly Verifiable Delegation From Standard Assumptions”

    Yael Tauman Kalai, Omer Paneth, Lisa Yang. ePrint 2018.

4. “The Parallel Repetition of Non-Signaling Games: Counterexamples and Dichotomy“

    Justin Holmgren, Lisa Yang. Symposium on Theory of Computing STOC 2019. Quantum Information Processing QIP 2019.

  • Talk given at STOC 2019, QIP 2019, and MIT Algorithms and Complexity Seminar.

5. “(A Counterexample to) Parallel Repetition for Non-Signaling Multi-Player Games”

    Justin Holmgren, Lisa Yang. ECCC/ePrint 2017.

6. “The Diameter and Automorphism Group of Gelfand-Tsetlin Polytopes”

    Yibo Gao, Ben Krakoff, Lisa Yang. Discrete and Computational Geometry 62(1) 2019.

  • Talk given at UMN REU 2016.

  • Poster presented at JMM 2017.

7. “Toric Mutations in the dP2 Quiver and Subgraphs of the dP2 Brane Tiling”
    Yibo Gao, Zhaoqi Li, Thuy-Duong Vong, Lisa Yang. Electronic Journal of Combinatorics 26(2) 2019.

  • Talk given at UMN REU 2016.

  • Poster presented at JMM 2017.


1. “Random oracles, the Polynomial-Time Hierarchy, and Constant-depth Circuits: A survey”

    Andrew He, Lisa Yang. Manuscript 2016.



I was a teaching assistant (TA) for 6.875 Graduate Cryptography (Fall 2020), taught jointly between MIT and Berkeley.