License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.TQC.2023.2
URN: urn:nbn:de:0030-drops-183127
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/18312/
Dall'Agnol, Marcel ;
Spooner, Nicholas
On the Necessity of Collapsing for Post-Quantum and Quantum Commitments
Abstract
Collapse binding and collapsing were proposed by Unruh (Eurocrypt '16) as post-quantum strengthenings of computational binding and collision resistance, respectively. These notions have been very successful in facilitating the "lifting" of classical security proofs to the quantum setting. A basic and natural question remains unanswered, however: are they the weakest notions that suffice for such lifting?
In this work we answer this question in the affirmative by giving a classical commit-and-open protocol which is post-quantum secure if and only if the commitment scheme (resp. hash function) used is collapse binding (resp. collapsing). We also generalise the definition of collapse binding to quantum commitment schemes, and prove that the equivalence carries over when the sender in this commit-and-open protocol communicates quantum information.
As a consequence, we establish that a variety of "weak" binding notions (sum binding, CDMS binding and unequivocality) are in fact equivalent to collapse binding, both for post-quantum and quantum commitments.
Finally, we prove a "win-win" result, showing that a post-quantum computationally binding commitment scheme that is not collapse binding can be used to build an equivocal commitment scheme (which can, in turn, be used to build one-shot signatures and other useful quantum primitives). This strengthens a result due to Zhandry (Eurocrypt '19) showing that the same object yields quantum lightning.
BibTeX - Entry
@InProceedings{dallagnol_et_al:LIPIcs.TQC.2023.2,
author = {Dall'Agnol, Marcel and Spooner, Nicholas},
title = {{On the Necessity of Collapsing for Post-Quantum and Quantum Commitments}},
booktitle = {18th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2023)},
pages = {2:1--2:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-283-9},
ISSN = {1868-8969},
year = {2023},
volume = {266},
editor = {Fawzi, Omar and Walter, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18312},
URN = {urn:nbn:de:0030-drops-183127},
doi = {10.4230/LIPIcs.TQC.2023.2},
annote = {Keywords: Quantum cryptography, Commitment schemes, Hash functions, Quantum rewinding}
}
|
Keywords: |
|
Quantum cryptography, Commitment schemes, Hash functions, Quantum rewinding |
|
Collection: |
|
18th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2023) |
|
Issue Date: |
|
2023 |
|
Date of publication: |
|
18.07.2023 |
