4 papers
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.…
Multi-Pass Streaming Lower Bounds for Uniformity Testing
Qian Li, Xin Lyu
We prove multi-pass streaming lower bounds for uniformity testing over a domain of size . The tester receives a stream of i.i.d. samples and must distinguish (i) the unifor…
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…
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…