Mechanism design for route allocation in multiple-commodity network. - Qipeng Liu 001; Yicheng Liu; Pingzhong Tang (AAMAS, 2014)

Mechanism design for resource allocation: with applications to centralized multi-commodity routing. - Qipeng Liu 001; Yicheng Liu; Pingzhong Tang (AAMAS, 2015)

Inductive coloring: Implementing basic communication primitives with Rayleigh-fading interference. - Yuexuan Wang; Dongxiao Yu; Qipeng Liu 001; Francis C. M. Lau 001 (INFOCOM, 2016)

Exploding Obfuscation: A Framework for Building Applications of Obfuscation From Polynomial Hardness. - Qipeng Liu 001; Mark Zhandry (IACR Cryptol. ePrint Arch., 2017)

Arboral satisfaction: Recognition and LP approximation. - Erik D. Demaine; Varun Ganesan; Vladislav Kontsevoi; Qipeng Liu 001; Quanquan C. Liu; Fermi Ma; Ofir Nachum; Aaron Sidford; Erik Waingarten; Daniel Ziegler 002 (Inf. Process. Lett., 2017)

On Finding Quantum Multi-collisions. - Qipeng Liu 001; Mark Zhandry (IACR Cryptol. ePrint Arch., 2018)

Revisiting Post-Quantum Fiat-Shamir. - Qipeng Liu 001; Mark Zhandry (IACR Cryptol. ePrint Arch., 2019)

Tight Quantum Time-Space Tradeoffs for Function Inversion. - Kai-Min Chung; Siyao Guo; Qipeng Liu 001; Luowen Qian (Electron. Colloquium Comput. Complex., 2020)

New Approaches for Quantum Copy-Protection. - Scott Aaronson; Jiahui Liu 003; Qipeng Liu 001; Mark Zhandry; Ruizhe Zhang 001 (IACR Cryptol. ePrint Arch., 2020)

Unifying Presampling via Concentration Bounds. - Siyao Guo; Qian Li 012; Qipeng Liu 001; Jiapeng Zhang (IACR Cryptol. ePrint Arch., 2020)

Quantum Immune One-Time Memories. - Qipeng Liu 001; Amit Sahai; Mark Zhandry (IACR Cryptol. ePrint Arch., 2020)

On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Round. - Nai-Hui Chia; Kai-Min Chung; Qipeng Liu 001; Takashi Yamakawa (FOCS, 2021)

Quantum Algorithms for Variants of Average-Case Lattice Problems via Filtering. - Yilei Chen 001; Qipeng Liu 001; Mark Zhandry (Electron. Colloquium Comput. Complex., 2021)

On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Rounds. - Nai-Hui Chia; Kai-Min Chung; Qipeng Liu 001; Takashi Yamakawa (IACR Cryptol. ePrint Arch., 2021)

Hidden Cosets and Applications to Unclonable Cryptography. - Andrea Coladangelo; Jiahui Liu 003; Qipeng Liu 001; Mark Zhandry (IACR Cryptol. ePrint Arch., 2021)

Decomposable Obfuscation: A Framework for Building Applications of Obfuscation from Polynomial Hardness. - Qipeng Liu 001; Mark Zhandry (J. Cryptol., 2021)

Cryptography in the age of quantum computers 2.0 - Qipeng Liu 001 (2021)

Quantum-Classical Tradeoffs in the Random Oracle Model. - Yassine Hamoudi; Qipeng Liu 001; Makrand Sinha (CoRR, 2022)

On the Feasibility of Unclonable Encryption, and More. - Prabhanjan Ananth; Fatih Kaleoglu; Xingjian Li 006; Qipeng Liu 001; Mark Zhandry (IACR Cryptol. ePrint Arch., 2022)

Non-uniformity and Quantum Advice in the Random Oracle Model. - Qipeng Liu 001 (IACR Cryptol. ePrint Arch., 2022)

Beating Classical Impossibility of Position Verification. - Jiahui Liu 003; Qipeng Liu 001; Luowen Qian (IACR Cryptol. ePrint Arch., 2022)

Collusion Resistant Copy-Protection for Watermarkable Functionalities. - Jiahui Liu 003; Qipeng Liu 001; Luowen Qian; Mark Zhandry (IACR Cryptol. ePrint Arch., 2022)

Non-uniformity and Quantum Advice in the Quantum Random Oracle Model. - Qipeng Liu 001 (EUROCRYPT (1), 2023)

Depth-Bounded Quantum Cryptography with Applications to One-Time Memory and More. - Qipeng Liu 001 (ITCS, 2023)

Classical vs Quantum Advice under Classically-Accessible Oracle. - Xingjian Li 006; Qipeng Liu 001; Angelos Pelecanos; Takashi Yamakawa (CoRR, 2023)

On the Hardness of S|LWE〉 with Gaussian and Other Amplitudes. - Yilei Chen 001; Zihan Hu; Qipeng Liu 001; Han Luo; Yaxin Tu (CoRR, 2023)

Memory-Sample Lower Bounds for Learning with Classical-Quantum Hybrid Memory. - Qipeng Liu 001; Ran Raz; Wei Zhan (Electron. Colloquium Comput. Complex., 2023)

On Time-Space Lower Bounds for Finding Short Collisions in Sponge Hash Functions. - Akshima; Xiaoqi Duan; Siyao Guo; Qipeng Liu 001 (IACR Cryptol. ePrint Arch., 2023)

Cloning Games: A General Framework for Unclonable Primitives. - Prabhanjan Ananth; Fatih Kaleoglu; Qipeng Liu 001 (IACR Cryptol. ePrint Arch., 2023)

On the Hardness of $ sf{S|LWE rangle}$ with Gaussian and Other Amplitudes. - Yilei Chen 001; Zihan Hu; Qipeng Liu 001; Han Luo; Yaxin Tu (IACR Cryptol. ePrint Arch., 2023)

Improved Quantum Lifting by Coherent Measure-and-Reprogram. - Alexandru Cojocaru; Juan A. Garay; Qipeng Liu 001; Fang Song 001 (ASIACRYPT (9), 2024)

Classical vs Quantum Advice and Proofs Under Classically-Accessible Oracle. - Xingjian Li 006; Qipeng Liu 001; Angelos Pelecanos; Takashi Yamakawa (ITCS, 2024)

Unclonable Secret Sharing. - Prabhanjan Ananth; Vipul Goyal; Jiahui Liu 003; Qipeng Liu 001 (IACR Cryptol. ePrint Arch., 2024)

Tight Characterizations for Preprocessing against Cryptographic Salting. - Fangqi Dong; Qipeng Liu 001; Kewen Wu 001 (IACR Cryptol. ePrint Arch., 2024)

The NISQ Complexity of Collision Finding. - Yassine Hamoudi; Qipeng Liu 001; Makrand Sinha (IACR Cryptol. ePrint Arch., 2024)

How (not) to Build Quantum PKE in Minicrypt. - Longcheng Li; Qian Li 012; Xingjian Li 006; Qipeng Liu 001 (IACR Cryptol. ePrint Arch., 2024)

Time-Space Lower Bounds for Finding Collisions in Merkle-Damgård Hash Functions. - Akshima; Siyao Guo; Qipeng Liu 001 (J. Cryptol., 2024)

LWE with Quantum Amplitudes: Algorithm, Hardness, and Oblivious Sampling. - Yilei Chen 001; Zihan Hu; Qipeng Liu 001; Han Luo; Yaxin Tu (CRYPTO (2), 2025)

Toward the Impossibility of Perfect Complete Quantum PKE from OWFs. - Longcheng Li; Qian Li 012; Xingjian Li 006; Qipeng Liu 001 (ITCS, 2025)

Quantum Lifting for Invertible Permutations and Ideal Ciphers. - Alexandru Cojocaru; Minki Hhan; Qipeng Liu 001; Takashi Yamakawa; Aaram Yun (IACR Cryptol. ePrint Arch., 2025)

Cryptomania v.s. Minicrypt in a Quantum World. - Longcheng Li; Qian Li 012; Xingjian Li 006; Qipeng Liu 001 (IACR Cryptol. ePrint Arch., 2025)