default search action
Qipeng Liu 0001
Person information
- unicode name: 刘启鹏
- affiliation: University of California San Diego, CA, USA
- affiliation (former): Simons Institute for the Theory of Computing, Berkeley, CA, USA
- affiliation (former, PhD 2021): Princeton University, NJ, USA
- affiliation (former): Massachusetts Institute of Technology, Cambridge, MA, USA
Other persons with the same name
- Qipeng Liu 0002 — Qingdao University, School of Automation, China (and 2 more)
- Qipeng Liu 0003 — Xi'an Jiaotong University, School of Energy and Power Engineering, China
- Qipeng Liu 0004
— Fuzhou University, College of Computer and Data Science, China
- Qipeng Liu 0005 — Chongqing University, College of Optoelectronic Engineering, China
- Qipeng Liu 0006 — University of Florida, School of Construction Management, Gainesville, FL, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j3]Akshima, Siyao Guo, Qipeng Liu:
Time-Space Lower Bounds for Finding Collisions in Merkle-Damgård Hash Functions. J. Cryptol. 37(2): 10 (2024) - [c25]Longcheng Li, Qian Li, Xingjian Li, Qipeng Liu:
How (not) to Build Quantum PKE in Minicrypt. CRYPTO (7) 2024: 152-183 - [c24]Fangqi Dong, Qipeng Liu
Tight Characterizations for Preprocessing Against Cryptographic Salting. CRYPTO (4) 2024: 377-411 - [c23]Yassine Hamoudi
The NISQ Complexity of Collision Finding. EUROCRYPT (4) 2024: 3-32 - [c22]Xingjian Li
Classical vs Quantum Advice and Proofs Under Classically-Accessible Oracle. ITCS 2024: 72:1-72:19 - [i42]Fangqi Dong, Qipeng Liu, Kewen Wu:
Tight Characterizations for Preprocessing against Cryptographic Salting. CoRR abs/2405.20281 (2024) - [i41]Longcheng Li, Qian Li, Xingjian Li
How (not) to Build Quantum PKE in Minicrypt. CoRR abs/2405.20295 (2024) - [i40]Prabhanjan Ananth, Vipul Goyal, Jiahui Liu, Qipeng Liu:
Unclonable Secret Sharing. CoRR abs/2406.11008 (2024) - [i39]Yassine Hamoudi, Qipeng Liu, Makrand Sinha:
The NISQ Complexity of Collision Finding. IACR Cryptol. ePrint Arch. 2024: 360 (2024) - [i38]Prabhanjan Ananth, Vipul Goyal, Jiahui Liu, Qipeng Liu:
Unclonable Secret Sharing. IACR Cryptol. ePrint Arch. 2024: 716 (2024) - [i37]Longcheng Li, Qian Li, Xingjian Li, Qipeng Liu:
How (not) to Build Quantum PKE in Minicrypt. IACR Cryptol. ePrint Arch. 2024: 830 (2024) - [i36]Fangqi Dong, Qipeng Liu, Kewen Wu:
Tight Characterizations for Preprocessing against Cryptographic Salting. IACR Cryptol. ePrint Arch. 2024: 831 (2024) - 2023
- [c21]Prabhanjan Ananth, Fatih Kaleoglu, Qipeng Liu:
Cloning Games: A General Framework for Unclonable Primitives. CRYPTO (5) 2023: 66-98 - [c20]Qipeng Liu
Non-uniformity and Quantum Advice in the Quantum Random Oracle Model. EUROCRYPT (1) 2023: 117-143 - [c19]Qipeng Liu:
Depth-Bounded Quantum Cryptography with Applications to One-Time Memory and More. ITCS 2023: 82:1-82:18 - [c18]Qipeng Liu, Ran Raz
Memory-Sample Lower Bounds for Learning with Classical-Quantum Hybrid Memory. STOC 2023: 1097-1110 - [c17]Akshima, Xiaoqi Duan, Siyao Guo, Qipeng Liu:
On Time-Space Lower Bounds for Finding Short Collisions in Sponge Hash Functions. TCC (3) 2023: 237-270 - [i35]Prabhanjan Ananth, Fatih Kaleoglu, Qipeng Liu:
Cloning Games: A General Framework for Unclonable Primitives. CoRR abs/2302.01874 (2023) - [i34]Qipeng Liu, Ran Raz, Wei Zhan:
Memory-Sample Lower Bounds for Learning with Classical-Quantum Hybrid Memory. CoRR abs/2303.00209 (2023) - [i33]Xingjian Li
Classical vs Quantum Advice under Classically-Accessible Oracle. CoRR abs/2303.04298 (2023) - [i32]Yilei Chen, Zihan Hu, Qipeng Liu, Han Luo, Yaxin Tu:
On the Hardness of S|LWE〉 with Gaussian and Other Amplitudes. CoRR abs/2310.00644 (2023) - [i31]Qipeng Liu, Ran Raz, Wei Zhan:
Memory-Sample Lower Bounds for Learning with Classical-Quantum Hybrid Memory. Electron. Colloquium Comput. Complex. TR23 (2023) - [i30]Prabhanjan Ananth, Fatih Kaleoglu, Qipeng Liu:
Cloning Games: A General Framework for Unclonable Primitives. IACR Cryptol. ePrint Arch. 2023: 128 (2023) - [i29]Akshima, Xiaoqi Duan, Siyao Guo, Qipeng Liu:
On Time-Space Lower Bounds for Finding Short Collisions in Sponge Hash Functions. IACR Cryptol. ePrint Arch. 2023: 1444 (2023) - [i28]Yilei Chen, Zihan Hu, Qipeng Liu, Han Luo, Yaxin Tu
On the Hardness of $\sf{S|LWE\rangle}$ with Gaussian and Other Amplitudes. IACR Cryptol. ePrint Arch. 2023: 1498 (2023) - 2022
- [c16]Akshima, Siyao Guo, Qipeng Liu:
Time-Space Lower Bounds for Finding Collisions in Merkle-Damgård Hash Functions. CRYPTO (3) 2022: 192-221 - [c15]Prabhanjan Ananth, Fatih Kaleoglu, Xingjian Li
On the Feasibility of Unclonable Encryption, and More. CRYPTO (2) 2022: 212-241 - [c14]Yilei Chen, Qipeng Liu, Mark Zhandry:
Quantum Algorithms for Variants of Average-Case Lattice Problems via Filtering. EUROCRYPT (3) 2022: 372-401 - [c13]Jiahui Liu, Qipeng Liu, Luowen Qian
Beating Classical Impossibility of Position Verification. ITCS 2022: 100:1-100:11 - [c12]Jiahui Liu
Collusion Resistant Copy-Protection for Watermarkable Functionalities. TCC (1) 2022: 294-323 - [i27]Prabhanjan Ananth, Fatih Kaleoglu, Xingjian Li
On the Feasibility of Unclonable Encryption, and More. CoRR abs/2207.06589 (2022) - [i26]Qipeng Liu:
Non-uniformity and Quantum Advice in the Quantum Random Oracle Model. CoRR abs/2210.06693 (2022) - [i25]Yassine Hamoudi, Qipeng Liu, Makrand Sinha:
Quantum-Classical Tradeoffs in the Random Oracle Model. CoRR abs/2211.12954 (2022) - [i24]Jiahui Liu, Qipeng Liu, Luowen Qian:
Beating Classical Impossibility of Position Verification. IACR Cryptol. ePrint Arch. 2022: 8 (2022) - [i23]Prabhanjan Ananth, Fatih Kaleoglu, Xingjian Li, Qipeng Liu, Mark Zhandry:
On the Feasibility of Unclonable Encryption, and More. IACR Cryptol. ePrint Arch. 2022: 884 (2022) - [i22]Akshima, Siyao Guo, Qipeng Liu:
Time-Space Lower Bounds for Finding Collisions in Merkle-Damgård Hash Functions. IACR Cryptol. ePrint Arch. 2022: 885 (2022) - [i21]Qipeng Liu:
Non-uniformity and Quantum Advice in the Random Oracle Model. IACR Cryptol. ePrint Arch. 2022: 1384 (2022) - [i20]Jiahui Liu, Qipeng Liu, Luowen Qian, Mark Zhandry:
Collusion Resistant Copy-Protection for Watermarkable Functionalities. IACR Cryptol. ePrint Arch. 2022: 1429 (2022) - 2021
- [b1]Qipeng Liu:
Cryptography in the age of quantum computers 2.0. Princeton University, USA, 2021 - [j2]Qipeng Liu, Mark Zhandry:
Decomposable Obfuscation: A Framework for Building Applications of Obfuscation from Polynomial Hardness. J. Cryptol. 34(3): 35 (2021) - [c11]Scott Aaronson, Jiahui Liu, Qipeng Liu, Mark Zhandry, Ruizhe Zhang:
New Approaches for Quantum Copy-Protection. CRYPTO (1) 2021: 526-555 - [c10]Andrea Coladangelo
Hidden Cosets and Applications to Unclonable Cryptography. CRYPTO (1) 2021: 556-584 - [c9]Nai-Hui Chia, Kai-Min Chung, Qipeng Liu, Takashi Yamakawa:
On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Round. FOCS 2021: 59-67 - [c8]Siyao Guo, Qian Li, Qipeng Liu, Jiapeng Zhang:
Unifying Presampling via Concentration Bounds. TCC (1) 2021: 177-208 - [i19]Nai-Hui Chia, Kai-Min Chung, Qipeng Liu, Takashi Yamakawa:
On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Rounds. CoRR abs/2103.11244 (2021) - [i18]Andrea Coladangelo, Jiahui Liu, Qipeng Liu, Mark Zhandry:
Hidden Cosets and Applications to Unclonable Cryptography. CoRR abs/2107.05692 (2021) - [i17]Yilei Chen, Qipeng Liu, Mark Zhandry:
Quantum Algorithms for Variants of Average-Case Lattice Problems via Filtering. CoRR abs/2108.11015 (2021) - [i16]Jiahui Liu, Qipeng Liu, Luowen Qian:
Beating Classical Impossibility of Position Verification. CoRR abs/2109.07517 (2021) - [i15]Yilei Chen, Qipeng Liu, Mark Zhandry:
Quantum Algorithms for Variants of Average-Case Lattice Problems via Filtering. Electron. Colloquium Comput. Complex. TR21 (2021) - [i14]Nai-Hui Chia, Kai-Min Chung, Qipeng Liu, Takashi Yamakawa:
On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Rounds. IACR Cryptol. ePrint Arch. 2021: 376 (2021) - [i13]Andrea Coladangelo, Jiahui Liu, Qipeng Liu, Mark Zhandry:
Hidden Cosets and Applications to Unclonable Cryptography. IACR Cryptol. ePrint Arch. 2021: 946 (2021) - [i12]Yilei Chen, Qipeng Liu, Mark Zhandry:
Quantum Algorithms for Variants of Average-Case Lattice Problems via Filtering. IACR Cryptol. ePrint Arch. 2021: 1093 (2021) - 2020
- [c7]Kai-Min Chung, Siyao Guo, Qipeng Liu, Luowen Qian
Tight Quantum Time-Space Tradeoffs for Function Inversion. FOCS 2020: 673-684 - [i11]Kai-Min Chung, Siyao Guo, Qipeng Liu, Luowen Qian:
Tight Quantum Time-Space Tradeoffs for Function Inversion. CoRR abs/2006.05650 (2020) - [i10]Kai-Min Chung, Siyao Guo, Qipeng Liu, Luowen Qian:
Tight Quantum Time-Space Tradeoffs for Function Inversion. Electron. Colloquium Comput. Complex. TR20 (2020) - [i9]Kai-Min Chung, Siyao Guo, Qipeng Liu, Luowen Qian:
Tight Quantum Time-Space Tradeoffs for Function Inversion. IACR Cryptol. ePrint Arch. 2020: 693 (2020) - [i8]Qipeng Liu, Amit Sahai, Mark Zhandry:
Quantum Immune One-Time Memories. IACR Cryptol. ePrint Arch. 2020: 871 (2020) - [i7]Scott Aaronson, Jiahui Liu, Qipeng Liu, Mark Zhandry, Ruizhe Zhang:
New Approaches for Quantum Copy-Protection. IACR Cryptol. ePrint Arch. 2020: 1339 (2020) - [i6]Siyao Guo, Qian Li, Qipeng Liu, Jiapeng Zhang:
Unifying Presampling via Concentration Bounds. IACR Cryptol. ePrint Arch. 2020: 1589 (2020)
2010 – 2019
- 2019
- [c6]Qipeng Liu, Mark Zhandry:
Revisiting Post-quantum Fiat-Shamir. CRYPTO (2) 2019: 326-355 - [c5]Qipeng Liu, Mark Zhandry:
On Finding Quantum Multi-collisions. EUROCRYPT (3) 2019: 189-218 - [i5]Qipeng Liu, Mark Zhandry:
Revisiting Post-Quantum Fiat-Shamir. IACR Cryptol. ePrint Arch. 2019: 262 (2019) - 2018
- [i4]Qipeng Liu, Mark Zhandry:
On Finding Quantum Multi-collisions. CoRR abs/1811.05385 (2018) - [i3]Qipeng Liu, Mark Zhandry:
On Finding Quantum Multi-collisions. IACR Cryptol. ePrint Arch. 2018: 1096 (2018) - 2017
- [j1]Erik D. Demaine, Varun Ganesan, Vladislav Kontsevoi, Qipeng Liu, Quanquan C. Liu, Fermi Ma, Ofir Nachum, Aaron Sidford, Erik Waingarten, Daniel Ziegler:
Arboral satisfaction: Recognition and LP approximation. Inf. Process. Lett. 127: 1-5 (2017) - [c4]Qipeng Liu, Mark Zhandry:
Decomposable Obfuscation: A Framework for Building Applications of Obfuscation from Polynomial Hardness. TCC (1) 2017: 138-169 - [i2]Qipeng Liu, Mark Zhandry:
Exploding Obfuscation: A Framework for Building Applications of Obfuscation From Polynomial Hardness. IACR Cryptol. ePrint Arch. 2017: 209 (2017) - 2016
- [c3]Yuexuan Wang, Dongxiao Yu, Qipeng Liu, Francis C. M. Lau:
Inductive coloring: Implementing basic communication primitives with Rayleigh-fading interference. INFOCOM 2016: 1-9 - 2015
- [c2]Qipeng Liu, Yicheng Liu, Pingzhong Tang:
Mechanism design for resource allocation: with applications to centralized multi-commodity routing. AAMAS 2015: 1741-1742 - [i1]Qipeng Liu, Yicheng Liu, Pingzhong Tang:
Mechanism design for resource allocation with applications to centralized multi-commodity routing. CoRR abs/1503.06536 (2015) - 2014
- [c1]Qipeng Liu, Yicheng Liu, Pingzhong Tang:
Mechanism design for route allocation in multiple-commodity network. AAMAS 2014: 1607-1608
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-13 18:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: