Skip to main content

Quantum Lightning Never Strikes the Same State Twice

Author(s): Zhandry, Mark

Download
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1pg35
Full metadata record
DC FieldValueLanguage
dc.contributor.authorZhandry, Mark-
dc.date.accessioned2021-10-08T19:48:18Z-
dc.date.available2021-10-08T19:48:18Z-
dc.date.issued2019en_US
dc.identifier.citationZhandry, Mark. "Quantum Lightning Never Strikes the Same State Twice." In Annual International Conference on the Theory and Applications of Cryptographic Techniques (2019): pp. 408-438. doi:10.1007/978-3-030-17659-4_14en_US
dc.identifier.issn0302-9743-
dc.identifier.urihttps://www.cs.princeton.edu/~mzhandry/docs/papers/QLightning.pdf-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/pr1pg35-
dc.description.abstractPublic key quantum money can be seen as a version of the quantum no-cloning theorem that holds even when the quantum states can be verified by the adversary. In this work, we investigate quantum lightning where no-cloning holds even when the adversary herself generates the quantum state to be cloned. We then study quantum money and quantum lightning, showing the following results: We demonstrate the usefulness of quantum lightning beyond quantum money by showing several potential applications, such as generating random strings with a proof of entropy, to completely decentralized cryptocurrency without a block-chain, where transactions is instant and local. We give Either/Or results for quantum money/lightning, showing that either signatures/hash functions/commitment schemes meet very strong recently proposed notions of security, or they yield quantum money or lightning. Given the difficulty in constructing public key quantum money, this suggests that natural schemes do attain strong security guarantees. We show that instantiating the quantum money scheme of Aaronson and Christiano [STOC’12] with indistinguishability obfuscation that is secure against quantum computers yields a secure quantum money scheme. This construction can be seen as an instance of our Either/Or result for signatures, giving the first separation between two security notions for signatures from the literature. Finally, we give a plausible construction for quantum lightning, which we prove secure under an assumption related to the multi-collision resistance of degree-2 hash functions. Our construction is inspired by our Either/Or result for hash functions, and yields the first plausible standard model instantiation of a non-collapsing collision resistant hash function. This improves on a result of Unruh [Eurocrypt’16] which is relative to a quantum oracle.en_US
dc.format.extent408 - 438en_US
dc.language.isoen_USen_US
dc.relation.ispartofAnnual International Conference on the Theory and Applications of Cryptographic Techniquesen_US
dc.rightsAuthor's manuscripten_US
dc.titleQuantum Lightning Never Strikes the Same State Twiceen_US
dc.typeJournal Articleen_US
dc.identifier.doi10.1007/978-3-030-17659-4_14-
dc.identifier.eissn1611-3349-
pu.type.symplectichttp://www.symplectic.co.uk/publications/atom-terms/1.0/conference-proceedingen_US

Files in This Item:
File Description SizeFormat 
QuantumLightningNeverStrikeSameStateTwice.pdf673.77 kBAdobe PDFView/Download


Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.