5 papers
On Best-Possible One-Time Programs
Aparna Gupte, Jiahui Liu, Luowen Qian +3
One-time programs (OTPs) aim to let a user evaluate a program on a single input while revealing nothing else. Classical OTPs require hardware assumptions, and even with quantum inf…
QMA vs. QCMA and Pseudorandomness
Jiahui Liu, Saachi Mutreja, Henry Yuen
We study a longstanding question of Aaronson and Kuperberg on whether there exists a classical oracle separating from . Settling this question in eith…
Quantum One-Time Programs, Revisited
Aparna Gupte, Jiahui Liu, Justin Raizes +2
One-time programs (Goldwasser, Kalai and Rothblum, CRYPTO 2008) are functions that can be run on any single input of a user's choice, but not on a second input. Classically, they a…
Composability in Watermarking Schemes
Jiahui Liu, Mark Zhandry
Software watermarking allows for embedding a mark into a piece of code, such that any attempt to remove the mark will render the code useless. Provably secure watermarking schemes…
The Black-Box Simulation Barrier Persists in a Fully Quantum World
Nai-Hui Chia, Kai-Min Chung, Xiao Liang +1
Zero-Knowledge (ZK) protocols have been intensely studied due to their fundamental importance and versatility. However, quantum information's inherent differences significantly alt…