Paper 2023/1840 Original: eprint.iacr.org/2023/1840 ↗
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} \neq \mathsf{NP}$.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2024-08-17: last updated
- 2023-11-30: published
- Short URL
- https://ia.cr/2023/1840
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2023/1840,
author = {Luowen Qian},
title = {Unconditionally secure quantum commitments with preprocessing},
howpublished = {Cryptology {ePrint} Archive, Paper 2023/1840},
year = {2023},
url = {https://eprint.iacr.org/2023/1840}
}