Qipeng Liu

Orcid: 0000-0002-3994-7061

Affiliations:
  • University of California San Diego, CA, USA
  • Simons Institute for the Theory of Computing, Berkeley, CA, USA (former)
  • Princeton University, NJ, USA (former, PhD 2021)
  • Massachusetts Institute of Technology, Cambridge, MA, USA (former)


According to our database1, Qipeng Liu authored at least 42 papers between 2014 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Cryptomania v.s. Minicrypt in a Quantum World.
IACR Cryptol. ePrint Arch., 2025

NISQ Security and Complexity via Simple Classical Reasoning.
IACR Cryptol. ePrint Arch., 2025

Toward the Impossibility of Perfect Complete Quantum PKE from OWFs.
Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

Quantum Lifting for Invertible Permutations and Ideal Ciphers.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

LWE with Quantum Amplitudes: Algorithm, Hardness, and Oblivious Sampling.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024
Classical vs Quantum Advice and Proofs Under Classically-Accessible Oracle.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

The NISQ Complexity of Collision Finding.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

How (not) to Build Quantum PKE in Minicrypt.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

Tight Characterizations for Preprocessing Against Cryptographic Salting.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

Improved Quantum Lifting by Coherent Measure-and-Reprogram.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

Unclonable Secret Sharing.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

2023
On the Hardness of $\sf{S|LWE\rangle}$ with Gaussian and Other Amplitudes.
IACR Cryptol. ePrint Arch., 2023

On the Hardness of S|LWE〉 with Gaussian and Other Amplitudes.
CoRR, 2023

Classical vs Quantum Advice under Classically-Accessible Oracle.
CoRR, 2023

On Time-Space Lower Bounds for Finding Short Collisions in Sponge Hash Functions.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Memory-Sample Lower Bounds for Learning with Classical-Quantum Hybrid Memory.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Depth-Bounded Quantum Cryptography with Applications to One-Time Memory and More.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Non-uniformity and Quantum Advice in the Quantum Random Oracle Model.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

Cloning Games: A General Framework for Unclonable Primitives.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022
Non-uniformity and Quantum Advice in the Random Oracle Model.
IACR Cryptol. ePrint Arch., 2022

Quantum-Classical Tradeoffs in the Random Oracle Model.
CoRR, 2022

Collusion Resistant Copy-Protection for Watermarkable Functionalities.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

Beating Classical Impossibility of Position Verification.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Quantum Algorithms for Variants of Average-Case Lattice Problems via Filtering.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

On the Feasibility of Unclonable Encryption, and More.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

Time-Space Lower Bounds for Finding Collisions in Merkle-Damgård Hash Functions.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021
Cryptography in the age of quantum computers 2.0
PhD thesis, 2021

On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Rounds.
IACR Cryptol. ePrint Arch., 2021

Unifying Presampling via Concentration Bounds.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Round.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Hidden Cosets and Applications to Unclonable Cryptography.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

New Approaches for Quantum Copy-Protection.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020
Quantum Immune One-Time Memories.
IACR Cryptol. ePrint Arch., 2020

Tight Quantum Time-Space Tradeoffs for Function Inversion.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019
On Finding Quantum Multi-collisions.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Revisiting Post-quantum Fiat-Shamir.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2017
Arboral satisfaction: Recognition and LP approximation.
Inf. Process. Lett., 2017

Exploding Obfuscation: A Framework for Building Applications of Obfuscation From Polynomial Hardness.
IACR Cryptol. ePrint Arch., 2017

Decomposable Obfuscation: A Framework for Building Applications of Obfuscation from Polynomial Hardness.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

2016
Inductive coloring: Implementing basic communication primitives with Rayleigh-fading interference.
Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016

2015
Mechanism design for resource allocation: with applications to centralized multi-commodity routing.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014
Mechanism design for route allocation in multiple-commodity network.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014


  Loading...