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 database¹, Qipeng Liu authored at least 36 papers between 2014 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

Time-Space Lower Bounds for Finding Collisions in Merkle-Damgård Hash Functions.

[BibT_eX]

[DOI]

Akshima

Siyao Guo

Qipeng Liu

J. Cryptol., June, 2024

How (not) to Build Quantum PKE in Minicrypt.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2024

The NISQ Complexity of Collision Finding.

[BibT_eX]

[DOI]

Yassine Hamoudi

Qipeng Liu

Makrand Sinha

IACR Cryptol. ePrint Arch., 2024

Tight Characterizations for Preprocessing against Cryptographic Salting.

[BibT_eX]

[DOI]

Fangqi Dong

Qipeng Liu

Kewen Wu

IACR Cryptol. ePrint Arch., 2024

Unclonable Secret Sharing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2024

Classical vs Quantum Advice and Proofs Under Classically-Accessible Oracle.

[BibT_eX]

[DOI]

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023

On the Hardness of $\sf{S|LWE\rangle}$ with Gaussian and Other Amplitudes.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Cloning Games: A General Framework for Unclonable Primitives.

[BibT_eX]

[DOI]

Prabhanjan Ananth

Fatih Kaleoglu

Qipeng Liu

IACR Cryptol. ePrint Arch., 2023

On Time-Space Lower Bounds for Finding Short Collisions in Sponge Hash Functions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Memory-Sample Lower Bounds for Learning with Classical-Quantum Hybrid Memory.

[BibT_eX]

[DOI]

Qipeng Liu

Ran Raz

Wei Zhan

Electron. Colloquium Comput. Complex., 2023

On the Hardness of S|LWE〉 with Gaussian and Other Amplitudes.

[BibT_eX]

[DOI]

CoRR, 2023

Classical vs Quantum Advice under Classically-Accessible Oracle.

[BibT_eX]

[DOI]

CoRR, 2023

Depth-Bounded Quantum Cryptography with Applications to One-Time Memory and More.

[BibT_eX]

[DOI]

Qipeng Liu

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Non-uniformity and Quantum Advice in the Quantum Random Oracle Model.

[BibT_eX]

[DOI]

Qipeng Liu

Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

2022

Collusion Resistant Copy-Protection for Watermarkable Functionalities.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Beating Classical Impossibility of Position Verification.

[BibT_eX]

[DOI]

Jiahui Liu

Qipeng Liu

Luowen Qian

IACR Cryptol. ePrint Arch., 2022

Non-uniformity and Quantum Advice in the Random Oracle Model.

[BibT_eX]

[DOI]

Qipeng Liu

IACR Cryptol. ePrint Arch., 2022

On the Feasibility of Unclonable Encryption, and More.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Quantum-Classical Tradeoffs in the Random Oracle Model.

[BibT_eX]

[DOI]

Yassine Hamoudi

Qipeng Liu

Makrand Sinha

CoRR, 2022

2021

Cryptography in the age of quantum computers 2.0

[BibT_eX]

[DOI]

Qipeng Liu

PhD thesis, 2021

Decomposable Obfuscation: A Framework for Building Applications of Obfuscation from Polynomial Hardness.

[BibT_eX]

[DOI]

Qipeng Liu

Mark Zhandry

J. Cryptol., 2021

Hidden Cosets and Applications to Unclonable Cryptography.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Rounds.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Quantum Algorithms for Variants of Average-Case Lattice Problems via Filtering.

[BibT_eX]

[DOI]

Yilei Chen

Qipeng Liu

Mark Zhandry

Electron. Colloquium Comput. Complex., 2021

On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Round.

[BibT_eX]

[DOI]

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

Quantum Immune One-Time Memories.

[BibT_eX]

[DOI]

Qipeng Liu

Amit Sahai

Mark Zhandry

IACR Cryptol. ePrint Arch., 2020

Unifying Presampling via Concentration Bounds.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

New Approaches for Quantum Copy-Protection.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Tight Quantum Time-Space Tradeoffs for Function Inversion.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2020

2019

Revisiting Post-Quantum Fiat-Shamir.

[BibT_eX]

[DOI]

Qipeng Liu

Mark Zhandry

IACR Cryptol. ePrint Arch., 2019

2018

On Finding Quantum Multi-collisions.

[BibT_eX]

[DOI]

Qipeng Liu

Mark Zhandry

IACR Cryptol. ePrint Arch., 2018

2017

Arboral satisfaction: Recognition and LP approximation.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2017

Exploding Obfuscation: A Framework for Building Applications of Obfuscation From Polynomial Hardness.

[BibT_eX]

[DOI]

Qipeng Liu

Mark Zhandry

IACR Cryptol. ePrint Arch., 2017

2016

Inductive coloring: Implementing basic communication primitives with Rayleigh-fading interference.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Qipeng Liu

Yicheng Liu

Pingzhong Tang

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014

Mechanism design for route allocation in multiple-commodity network.

[BibT_eX]

[DOI]

Qipeng Liu

Yicheng Liu

Pingzhong Tang

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

Qipeng Liu

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...