Noise-Tolerant Quantum Tokens for MAC

Behera, Amit; Sattath, Or; Shinar, Uriel

doi:10.48550/arxiv.2105.05016

Cited by 2 publications

(4 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Ref. [BSS21] shows a construction for tokenized MAC which is noise-tolerant and uses only BB84 states. Tokenized signatures were also used to construct uncloneable decryptors [CLLZ21].…”

Section: Subsequent Workmentioning

confidence: 99%

“…Ref. [BSS21] shows that, as in the classical setting, one can replace the collision-resistant hash-function with a universal one-way hash functions. The analysis requires only modest modifications.…”

Section: Cryptographymentioning

confidence: 99%

“…Ref. [BSS21] considered stronger definitions for unforgeability, where the adversary has a classical or quantum oracle access to verify k . They show that by using a slightly stronger primitive (namely, they use a strong authenticated encryption scheme), Lemma 37 could be strengthened to handle this stronger security model, though their construction is slightly more complex.…”

Section: D1 Definitionsmentioning

confidence: 99%

See 2 more Smart Citations

Quantum Tokens for Digital Signatures

Ben-David

Sattath

2023

Quantum

Self Cite

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

“…Ref. [BSS21] shows a construction for tokenized MAC which is noise-tolerant and uses only BB84 states. Tokenized signatures were also used to construct uncloneable decryptors [CLLZ21].…”

Section: Subsequent Workmentioning

confidence: 99%

Section: Cryptographymentioning

confidence: 99%

Section: D1 Definitionsmentioning

confidence: 99%

See 1 more Smart Citation

Quantum Tokens for Digital Signatures

Ben-David

Sattath

2023

Quantum

Self Cite

View full text Add to dashboard Cite

show abstract

“…Notably, the scheme in [AA17] is based off hidden matching quantum retrieval games; in this model, the authors prove that, for n = 14, the maximum achievable noise-tolerance is 23.3%, which makes their protocol nearly optimal since it can tolerate up to 23.03% noise. In [BSS21], the authors construct a noise-tolerant private tokenized signature scheme (from which one can obtain private-key quantum money; see section 1.3). To simply describe their approach, a token is a tensor product of conjugate coding states, signing the bit 0 (1) involves measuring all qubits in the computational (Hadamard) basis, and verification amounts to comparing the measured string with a bank's secret string to check for agreement; noise-tolerance comes from allowing inconsistencies in a fraction of the string.…”

Section: Introductionmentioning

confidence: 99%

Quantum Versus Classical Noise Cryptography

Yuen¹

Quantum Communication, Computing, and Measurement 2

View full text Add to dashboard Cite

Quantum money is the task of verifying the validity of banknotes while ensuring that they cannot be counterfeited. Public-key quantum money allows anyone to perform verification, while the private-key setting restricts the ability to verify to banks, as in Wiesner's original scheme. The current state of technological progress means that errors are impossible to entirely suppress, hence the requirement for noise-tolerant schemes. We show for the first time how to achieve noise-tolerance in the public-key setting. Our techniques follow Aaronson and Christiano's oracle model, where we use the ideas of quantum error correction to extend their scheme: a valid banknote is now a subspace state possibly affected by noise, and verification is performed by using classical oracles to check for membership in "larger spaces." Additionally, a banknote in our scheme is minted by preparing conjugate coding states and applying a unitary that permutes the standard basis vectors.

show abstract

Noise-Tolerant Quantum Tokens for MAC

Cited by 2 publications

References 17 publications

Quantum Tokens for Digital Signatures

Quantum Tokens for Digital Signatures

Quantum Versus Classical Noise Cryptography

Contact Info

Product

Resources

About