Unconditionally secure quantum commitments with preprocessing
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866910568475000832 |
|---|---|
| author | Qian, Luowen |
| author_facet | Qian, Luowen |
| contents | 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}$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2311_18171 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Unconditionally secure quantum commitments with preprocessing Qian, Luowen Quantum Physics Cryptography and Security 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}$. |
| title | Unconditionally secure quantum commitments with preprocessing |
| topic | Quantum Physics Cryptography and Security |
| url | https://arxiv.org/abs/2311.18171 |