Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Lisa Yang 0001

dblp:211/0503-1 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0003-0193-5652ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3 · 1 since 2021Security and privacy · 2 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
5 papers
Cryptographic protocols and secure computation · 100%
Theoretical computer science
4 papers
Computational complexity · 50% Quantum computing and quantum information · 50%

Topics — the 10 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation
delegation of computation		 0.822020
Delegation with Updatable Unambiguous Proofs and PPAD-Hardness · CRYPTO (3) 2020
How to delegate computations publicly · STOC 2019
Cryptographic protocols and secure computation
interactive proofs		 0.712023
Quantum Advantage from Any Non-local Game · STOC 2023
Quantum computing and quantum information
quantum cryptography		 0.712023
Quantum Advantage from Any Non-local Game · STOC 2023
Quantum computing and quantum information › quantum complexity theory
quantum verification		 0.612022
Succinct Classical Verification of Quantum Computation · CRYPTO (2) 2022
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs
succinct arguments		 0.622022
How to delegate computations publicly · STOC 2019
Succinct Classical Verification of Quantum Computation · CRYPTO (2) 2022
Computational complexity › complexity classes › PPAD
PPAD-hardness		 0.412020
Delegation with Updatable Unambiguous Proofs and PPAD-Hardness · CRYPTO (3) 2020
Computational complexity
proof complexity		 0.412020
Delegation with Updatable Unambiguous Proofs and PPAD-Hardness · CRYPTO (3) 2020
Cryptographic protocols and secure computation
parallel repetition		 0.412019
The parallel repetition of non-signaling games: counterexamples and dichotomy · STOC 2019
Cryptographic protocols and secure computation
verifiable computation		 0.412019
How to delegate computations publicly · STOC 2019
Computational complexity › probabilistically checkable proofs
parallel repetition		 0.412019
The parallel repetition of non-signaling games: counterexamples and dichotomy · STOC 2019

Methods — techniques the papers use, named apart from their topics

quantum homomorphic encryption · 1.3succinct arguments · 1.1dichotomy theorem · 0.8counterexample construction · 0.8interactive games · 0.7interactive game · 0.7public verifiability · 0.4common reference string model · 0.4
YearPublicationVenuePosition
2023 Quantum Advantage from Any Non-local Game
abstract
We show a general method of compiling any k-prover non-local game into a single-prover (computationally sound) interactive game maintaining the same quantum completeness and classical soundness guarantees, up to a negligible additive factor in a security parameter. Our compiler uses any quantum homomorphic encryption scheme (Mahadev, FOCS 2018; Brakerski, CRYPTO 2018) satisfying a natural form of correctness with respect to auxiliary quantum input. The homomorphic encryption scheme is used as a cryptographic mechanism to simulate the effect of spatial separation, and is required to evaluate k−1 prover strategies out of k on encrypted queries.
Yael Tauman Kalai, Alex Lombardi, Vinod Vaikuntanathan, Lisa Yang 0001
 STOC4
2022 Succinct Classical Verification of Quantum Computation
James Bartusek, Yael Tauman Kalai, Alex Lombardi, Fermi Ma, Giulio Malavolta, Vinod Vaikuntanathan, Thomas Vidick, Lisa Yang 0001
 CRYPTO (2)8
2020 Delegation with Updatable Unambiguous Proofs and PPAD-Hardness
Yael Tauman Kalai, Omer Paneth, Lisa Yang 0001
 CRYPTO (3)3
2019 The parallel repetition of non-signaling games: counterexamples and dichotomy
abstract
Non-signaling games are an important object of study in the theory of computation, for their role both in quantum information and in (classical) cryptography. In this work, we study the behavior of these games under parallel repetition.
Justin Holmgren, Lisa Yang 0001
 STOC2
2019 How to delegate computations publicly
abstract
We construct a delegation scheme for all polynomial time computations. Our scheme is publicly verifiable and completely non-interactive in the common reference string (CRS) model.
Yael Tauman Kalai, Omer Paneth, Lisa Yang 0001
 STOC3
2019 The Diameter and Automorphism Group of Gelfand-Tsetlin Polytopes
Yibo Gao, Benjamin Krakoff, Lisa Yang 0001
 Discret. Comput. Geom.3