Public-key Quantum money with a classical bank

Shmueli, Omri

doi:10.1145/3519935.3519952

Cited by 13 publications

(17 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, Shmueli [Shm22b] proved a variant of tokenized signatures which is called semi-quantum tokenized signatures. Semi-quantum money is a quantum money scheme in which the minting is done in an interactive protocol between the user and a classical bank [RS22,Shm22a]. In semi-quantum tokenized signatures, the generation of the token can be done via an interactive protocol with a classical delegation (in the spirit of the fable of the abstract, the fish does not need to have a quantum computer; only the fisherman needs one).…”

Section: Subsequent Workmentioning

confidence: 99%

Quantum Tokens for Digital Signatures

Ben-David

Sattath

2023

Quantum

View full text Add to dashboard Cite

The fisherman caught a quantum fish. "Fisherman, please let me go", begged the fish, "and I will grant you three wishes". The fisherman agreed. The fish gave the fisherman a quantum computer, three quantum signing tokens and his classical public key. The fish explained: "to sign your three wishes, use the tokenized signature scheme on this quantum computer, then show your valid signature to the king, who owes me a favor". The fisherman used one of the signing tokens to sign the document "give me a castle!" and rushed to the palace. The king executed the classical verification algorithm using the fish's public key, and since it was valid, the king complied. The fisherman's wife wanted to sign ten wishes using their two remaining signing tokens. The fisherman did not want to cheat, and secretly sailed to meet the fish. "Fish, my wife wants to sign ten more wishes". But the fish was not worried: "I have learned quantum cryptography following the previous story (The Fisherman and His Wife by the brothers Grimm). The quantum tokens are consumed during the signing. Your polynomial wife cannot even sign four wishes using the three signing tokens I gave you". "How does it work?" wondered the fisherman. "Have you heard of quantum money? These are quantum states which can be easily verified but are hard to copy. This tokenized quantum signature scheme extends Aaronson and Christiano's quantum money scheme, which is why the signing tokens cannot be copied". "Does your scheme have additional fancy properties?" the fisherman asked. "Yes, the scheme has other security guarantees: revocability, testability and everlasting security. Furthermore, if you're at sea and your quantum phone has only classical reception, you can use this scheme to transfer the value of the quantum money to shore", said the fish, and swam away.

show abstract

Section: Subsequent Workmentioning

confidence: 99%

Quantum Tokens for Digital Signatures

Ben-David

Sattath

2023

Quantum

View full text Add to dashboard Cite

show abstract

“…Zhandry [Zha21] instantiated this oracle and showed how to construct public-key quantum money based on the existence of post-quantum indistinguishability obfuscation (iO) [BGI+01]. Recently, Shmueli [Shm22a] showed how to achieve public-key quantum money with classical bank, assuming post-quantum iO and quantum hardness of learning with errors. Constructions [FGH+12; KSS21; KLS22] of public-key quantum money from newer assumptions have also been explored although they have been susceptible to quantum attacks [Rob21; BDG22].…”

Section: Related Workmentioning

confidence: 99%

“…• In the second category, we have constructions based on well-studied (or perhaps better -studied) cryptographic primitives. In this category, we have constructions [Zha21;Shm22a;Shm22b] based on indistinguishability obfuscation, first initiated by Zhandry [Zha21].…”

Section: Introductionmentioning

confidence: 99%

On the (Im)plausibility of Public-Key Quantum Money from Collision-Resistant Hash Functions

Ananth¹,

Hu²,

Yuen³

2023

Preprint

View full text Add to dashboard Cite

Public-key quantum money is a cryptographic proposal for using highly entangled quantum states as currency that is publicly verifiable yet resistant to counterfeiting due to the laws of physics. Despite significant interest, constructing provably-secure public-key quantum money schemes based on standard cryptographic assumptions has remained an elusive goal. Even proposing plausibly-secure candidate schemes has been a challenge.These difficulties call for a deeper and systematic study of the structure of public-key quantum money schemes and the assumptions they can be based on. Motivated by this, we present the first black-box separation of quantum money and cryptographic primitives. Specifically, we show that collision-resistant hash functions cannot be used as a black-box to construct publickey quantum money schemes where the banknote verification makes classical queries to the hash function. Our result involves a novel combination of state synthesis techniques from quantum complexity theory and simulation techniques, including Zhandry's compressed oracle technique.

show abstract

“…A recent development in quantum money has been quantum money with classical communication [RS19, AGKZ20,Shm22]. This can be seen as a complement to our separation, giving a setting where a quantum state is teleportable, but not clonable.…”

Section: Other Related Workmentioning

confidence: 99%

A Computational Separation Between Quantum No-cloning and No-teleportation

Nehoran¹,

Zhandry²

2023

Preprint

View full text Add to dashboard Cite

Two of the fundamental no-go theorems of quantum information are the no-cloning theorem (that it is impossible to make copies of general quantum states) and the no-teleportation theorem (the prohibition on sending quantum states over classical channels without pre-shared entanglement). They are known to be equivalent, in the sense that a collection of quantum states is clonable if and only if it is teleportable.Our main result suggests that this is not the case when computational efficiency is considered. We give a collection of quantum states and oracles relative to which these states are efficiently clonable but not efficiently teleportable. Given that the opposite scenario is impossible (states that can be teleported can always trivially be cloned), this gives the most complete oracle separation possible between these two important no-go properties.In doing so, we introduce a related quantum no-go property, reconstructibility, which refers to the ability to construct a quantum state from a uniquely identifying classical description. We show the stronger result of a collection of quantum states that are efficiently clonable but not efficiently reconstructible. This novel no-go property only exists in relation to computational efficiency, as it is trivial for unbounded computation. It thus opens up the possibility of further computational no-go properties that have not yet been studied because they do not exist outside the computational context.

show abstract

Public-key Quantum money with a classical bank

Cited by 13 publications

References 28 publications

Quantum Tokens for Digital Signatures

Quantum Tokens for Digital Signatures

On the (Im)plausibility of Public-Key Quantum Money from Collision-Resistant Hash Functions

A Computational Separation Between Quantum No-cloning and No-teleportation

Contact Info

Product

Resources

About