Unconditionally secure quantum commitments with preprocessing

Luowen Qian

Paper 2023/1840

Unconditionally secure quantum commitments with preprocessing

Luowen Qian

, Boston University, NTT Research, Inc.

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} \neq \mathsf{NP}$.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: A minor revision of an IACR publication in CRYPTO 2024
DOI: 10.1007/978-3-031-68394-7_2
Keywords: advice simulation pseudorandomness
Contact author(s): luowen @ qcry pt
History: 2024-08-17: revised; 2023-11-30: received; See all versions
Short URL: https://ia.cr/2023/1840
License: CC BY

BibTeX

@misc{cryptoeprint:2023/1840,
      author = {Luowen Qian},
      title = {Unconditionally secure quantum commitments with preprocessing},
      howpublished = {Cryptology {ePrint} Archive, Paper 2023/1840},
      year = {2023},
      doi = {10.1007/978-3-031-68394-7_2},
      url = {https://eprint.iacr.org/2023/1840}
}