4 citations · 10 across the 15 of their papers we have counts for
21 papers
More is Less:Optimal Security for Haar Quantum Money and More
Zihan Hao, Xingjian Li, Qipeng Liu +1
Quantum cryptography leverages unclonability to enable a wide range of cryptographic applications that are impossible classically, such as digital currency protected against counte…
Parallel Quantum Advantage with Limited Adaptivity Requires Structure
Qipeng Liu, Saachi Mutreja
Aaronson and Ambainis (Theory of Computing, 2014) conjectured that quantum query algorithms admit efficient almost-everywhere classical simulation: for any -query quantum algori…
Unclonable encryption from BB84 states: a simultaneous Goldreich-Levin reduction
Andrea Coladangelo, Qipeng Liu, Ziyi Xie
Goldreich-Levin reductions are ubiquitous in cryptography: they convert an algorithm capable of guessing (mod ) for a hidden string and a random chall…
Impossibility of Perfectly Complete Many-Round Key Agreement in the QROM
Longcheng Li, Qian Li, Xingjian Li +1
This paper proves that it is impossible to construct perfectly complete quantum key agreement protocols (QKA) from quantumly secure one-way functions (OWFs) in a black-box manner.…
Cryptomania v.s. Minicrypt in a Quantum World
Longcheng Li, Qian Li, Xingjian Li +1
We prove that it is impossible to construct perfect-complete quantum public-key encryption (QPKE) with classical keys from quantumly secure one-way functions (OWFs) in a black-box…
Unclonable Secret Sharing
Prabhanjan Ananth, Vipul Goyal, Jiahui Liu +1
Unclonable cryptography utilizes the principles of quantum mechanics to addresses cryptographic tasks that are impossible classically. We introduce a novel unclonable primitive in…
How (not) to Build Quantum PKE in Minicrypt
Longcheng Li, Qian Li, Xingjian Li +1
The seminal work by Impagliazzo and Rudich (STOC'89) demonstrated the impossibility of constructing classical public key encryption (PKE) from one-way functions (OWF) in a black-bo…
Tight Characterizations for Preprocessing against Cryptographic Salting
Fangqi Dong, Qipeng Liu, Kewen Wu
Cryptography often considers the strongest yet plausible attacks in the real world. Preprocessing (a.k.a. non-uniform attack) plays an important role in both theory and practice: a…
LWE with Quantum Amplitudes: Algorithm, Hardness, and Oblivious Sampling
Yilei Chen, Zihan Hu, Qipeng Liu +2
In this paper, we show new algorithms, hardness results and applications for and with real Gaussian, Gaussian with linear or quadratic phase…
Classical vs Quantum Advice and Proofs under Classically-Accessible Oracle
Xingjian Li, Qipeng Liu, Angelos Pelecanos +1
It is a long-standing open question to construct a classical oracle relative to which BQP/qpoly BQP/poly or QMA QCMA. In this paper, we construct classically-accessib…
Memory-Sample Lower Bounds for Learning with Classical-Quantum Hybrid Memory
Qipeng Liu, Ran Raz, Wei Zhan
In a work by Raz (J. ACM and FOCS 16), it was proved that any algorithm for parity learning on bits requires either bits of classical memory or an exponential number (…
Cloning Games: A General Framework for Unclonable Primitives
Prabhanjan Ananth, Fatih Kaleoglu, Qipeng Liu
The powerful no-cloning principle of quantum mechanics can be leveraged to achieve interesting primitives, referred to as unclonable primitives, that are impossible to achieve clas…
The NISQ Complexity of Collision Finding
Yassine Hamoudi, Qipeng Liu, Makrand Sinha
Collision-resistant hashing, a fundamental primitive in modern cryptography, ensures that there is no efficient way to find distinct inputs that produce the same hash value. This p…
Non-uniformity and Quantum Advice in the Quantum Random Oracle Model
Qipeng Liu
QROM (quantum random oracle model), introduced by Boneh et al. (Asiacrypt 2011), captures all generic algorithms. However, it fails to describe non-uniform quantum algorithms with…
On the Feasibility of Unclonable Encryption, and More
Prabhanjan Ananth, Fatih Kaleoglu, Xingjian Li +2
Unclonable encryption, first introduced by Broadbent and Lord (TQC'20), is a one-time encryption scheme with the following security guarantee: any non-local adversary (A, B, C) can…
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.…
Quantum Algorithms for Variants of Average-Case Lattice Problems via Filtering
Yilei Chen, Qipeng Liu, Mark Zhandry
We show polynomial-time quantum algorithms for the following problems: (*) Short integer solution (SIS) problem under the infinity norm, where the public matrix is very wide, the m…
Hidden Cosets and Applications to Unclonable Cryptography
Andrea Coladangelo, Jiahui Liu, Qipeng Liu +1
In this work, we study a generalization of hidden subspace states to hidden coset states (first introduced by Aaronson and Christiano [STOC '12]). This notion was considered indepe…
On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Rounds
Nai-Hui Chia, Kai-Min Chung, Qipeng Liu +1
We investigate the existence of constant-round post-quantum black-box zero-knowledge protocols for . As a main result, we show that there is no constant-round post-qua…
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…
On Finding Quantum Multi-collisions
Qipeng Liu, Mark Zhandry
A -collision for a compressing hash function is a set of distinct inputs that all map to the same output. In this work, we show that for any constant , $Θ\left(N^{\fr…