50 citations · 61 across the 7 of their papers we have counts for
11 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. Quantum measurement suggests a physic…
Quantum-Computable One-Way Functions without One-Way Functions
William Kretschmer, Luowen Qian, Avishay Tal
We construct a classical oracle relative to which but quantum-computable quantum-secure trapdoor one-way functions exist. This is a substantial strengthe…
An efficient quantum parallel repetition theorem and applications
John Bostanci, Luowen Qian, Nicholas Spooner +1
We prove a tight parallel repetition theorem for -message computationally-secure quantum interactive protocols between an efficient challenger and an efficient adversary. We als…
Unitary Complexity and the Uhlmann Transformation Problem
John Bostanci, Yuval Efron, Tony Metger +3
State transformation problems such as compressing quantum information or breaking quantum commitments are fundamental quantum tasks. However, their computational difficulty cannot…
Quantum Cryptography in Algorithmica
William Kretschmer, Luowen Qian, Makrand Sinha +1
We construct a classical oracle relative to which yet single-copy secure pseudorandom quantum states exist. In the language of Impagliazzo's five worlds,…
Pseudorandom (Function-Like) Quantum State Generators: New Definitions and Applications
Prabhanjan Ananth, Aditya Gulati, Luowen Qian +1
Pseudorandom quantum states (PRS) are efficiently constructible states that are computationally indistinguishable from being Haar-random, and have recently found cryptographic appl…
On the computational hardness needed for quantum cryptography
Zvika Brakerski, Ran Canetti, Luowen Qian
In the classical model of computation, it is well established that one-way functions (OWF) are minimal for computational cryptography: They are essential for almost any cryptograph…
Cryptography from Pseudorandom Quantum States
Prabhanjan Ananth, Luowen Qian, Henry Yuen
Pseudorandom states, introduced by Ji, Liu and Song (Crypto'18), are efficiently-computable quantum states that are computationally indistinguishable from Haar-random states. One-w…
Beating Classical Impossibility of Position Verification
Jiahui Liu, Qipeng Liu, Luowen Qian
Chandran et al. (SIAM J. Comput.'14) formally introduced the cryptographic task of position verification, where they also showed that it cannot be achieved by classical protocols.…
Tight Quantum Time-Space Tradeoffs for Function Inversion
Kai-Min Chung, Siyao Guo, Qipeng Liu +1
In function inversion, we are given a function , and want to prepare some advice of size , such that we can efficiently invert any image in time . This is…
Lower Bounds for Function Inversion with Quantum Advice
Kai-Min Chung, Tai-Ning Liao, Luowen Qian
Function inversion is the problem that given a random function , we want to find pre-image of any image in time . In this work, we revisit this probl…