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 33 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Time-Space Lower Bounds for Finding Collisions in Merkle-Damgård Hash Functions.
J. Cryptol., June, 2024

The NISQ Complexity of Collision Finding.
IACR Cryptol. ePrint Arch., 2024

Unclonable Secret Sharing.
IACR Cryptol. ePrint Arch., 2024

Classical vs Quantum Advice and Proofs Under Classically-Accessible Oracle.
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.
IACR Cryptol. ePrint Arch., 2023

Cloning Games: A General Framework for Unclonable Primitives.
IACR Cryptol. ePrint Arch., 2023

On Time-Space Lower Bounds for Finding Short Collisions in Sponge Hash Functions.
IACR Cryptol. ePrint Arch., 2023

Memory-Sample Lower Bounds for Learning with Classical-Quantum Hybrid Memory.
Electron. Colloquium Comput. Complex., 2023

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

Classical vs Quantum Advice under Classically-Accessible Oracle.
CoRR, 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

2022
Collusion Resistant Copy-Protection for Watermarkable Functionalities.
IACR Cryptol. ePrint Arch., 2022

Beating Classical Impossibility of Position Verification.
IACR Cryptol. ePrint Arch., 2022

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

On the Feasibility of Unclonable Encryption, and More.
IACR Cryptol. ePrint Arch., 2022

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

2021
Decomposable Obfuscation: A Framework for Building Applications of Obfuscation from Polynomial Hardness.
J. Cryptol., 2021

Hidden Cosets and Applications to Unclonable Cryptography.
IACR Cryptol. ePrint Arch., 2021

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

Quantum Algorithms for Variants of Average-Case Lattice Problems via Filtering.
Electron. Colloquium Comput. Complex., 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

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

Unifying Presampling via Concentration Bounds.
IACR Cryptol. ePrint Arch., 2020

New Approaches for Quantum Copy-Protection.
IACR Cryptol. ePrint Arch., 2020

Tight Quantum Time-Space Tradeoffs for Function Inversion.
Electron. Colloquium Comput. Complex., 2020

2019
Revisiting Post-Quantum Fiat-Shamir.
IACR Cryptol. ePrint Arch., 2019

2018
On Finding Quantum Multi-collisions.
IACR Cryptol. ePrint Arch., 2018

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

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...