International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Unconditionally secure quantum commitments with preprocessing

Authors:
Luowen Qian , Boston University & NTT Research
Download:
DOI: 10.1007/978-3-031-68394-7_2 (login may be required)
Search ePrint
Search Google
Presentation: Slides
Conference: CRYPTO 2024
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 P ≠ NP.
BibTeX
@inproceedings{crypto-2024-34178,
  title={Unconditionally secure quantum commitments with preprocessing},
  publisher={Springer-Verlag},
  doi={10.1007/978-3-031-68394-7_2},
  author={Luowen Qian},
  year=2024
}