Unconditionally secure quantum commitments with preprocessing

Abstract

We demonstrate how to build computationally secure commitment schemes with the aid of quantum auxiliary inputs without unproven complexity assumptions. Furthermore, the quantum auxiliary input can be either sampled in uniform exponential time or prepared in at most doubly exponential time, without relying on an external trusted third party. Classically, this remains impossible without first proving $\mathsf{P}\ne \mathsf{NP}$.

18 pages

References in corpus (4)

• Quantum commitments and signatures without one-way functions
• Quantum Cryptography in Algorithmica
• Quantum Pseudorandomness and Classical Complexity
• A Computational Separation Between Quantum No-cloning and No-telegraphing

Cited by in corpus (5)

• Unconditionally Secure Commitments with Quantum Auxiliary Inputs
• Time-Efficient Quantum Entropy Estimator via Samplizer
• Gluing Random Unitaries with Inverses and Applications to Strong Pseudorandom Unitaries
• Pseudorandom Unitaries in the Haar Random Oracle Model
• Fiat-Shamir for Proofs Lacks a Proof Even in the Presence of Shared Entanglement