Welcome to the resource topic for 2023/1840
Title:
Unconditionally secure quantum commitments with preprocessing
Authors: Luowen Qian
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 prepared either (1) efficiently through a trusted setup similar to the classical common random string model, or (2) strictly between the two involved parties in uniform exponential time. Classically this remains impossible without first proving \mathsf{P} \neq \mathsf{NP}.
ePrint: https://eprint.iacr.org/2023/1840
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .