Untitled

Aaronson, Scott; Christiano, Paul F.

doi:10.4086/toc.2013.v009a009

Cited by 21 publications

(18 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In both [BS16a] and [AC13], the core idea of the construction is the same, with minor differences: in [BS16a] algorithms are used instead of interactive protocols, and [AC13] is in the public setting, so a digital signature scheme is used instead of MAC, and an encryption scheme is not nescessary.…”

Section: A Mini-scheme Implies a Full Blown Schemementioning

confidence: 99%

“…The security of private quantum money schemes is generally solid, [Wie83, MVW13, PYJ + 12, TOI03, MS10, Gav12, GK15, JLS18], while secure public quantum money is much harder to construct. The constructions of [Aar09] and [AC13] were broken in Refs. [LAF + 10, PDF + 18], respectively.…”

Section: Introductionmentioning

confidence: 99%

“…The construction above is a semi-quantum 2-of-2 mini-scheme (rather than a full blown scheme). There is a slightly stronger notion of security (that is still weaker than a full blown scheme) called a mini-scheme (adapted from Aaronson and Christiano [AC13]). In a mini-scheme, the counterfeiter is given a single quantum money state and can attempt to pass verification polynomially many times.…”

Section: Introductionmentioning

confidence: 99%

“…In a full quantum money scheme, the adversary can ask for t money states and must pass at least t + 1 verifications. Aaronson and Christiano [AC13] defined the notion of a public money mini-scheme and showed how such a mini-scheme can be lifted to a full-blown scheme. Ben-David and Sattath [BS16a] showed a similar result that lifts a private money mini-scheme to a full-blown scheme.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Semi-Quantum Money

Radian

Sattath

2019

Proceedings of the 1st ACM Conference on Advances in Financial Technologies

View full text Add to dashboard Cite

Private quantum money allows a bank to mint quantum money states that it can later verify, but that no one else can forge. In classically verifiable quantum money -introduced by Gavinsky [Gav12]the verification is done via an interactive protocol between the bank and the user, where the communication is classical, and the computational resources required of the bank are classical. In this work, we consider memoryless interactive protocols in which the minting is likewise classical, and construct a private money scheme that achieves these two notions simultaneously (i.e., classical verification and classical minting). We call such a construction a private semi-quantum money scheme, since the bank does not need any quantum resources.In terms of techniques, our main contribution is a strong parallel repetition theorem for Noisy Trapdoor Claw Free Functions (NTCF), a notion introduced by Brakerski et al. [BCM + 18].

show abstract

Section: A Mini-scheme Implies a Full Blown Schemementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Semi-Quantum Money

Radian

Sattath

2019

Proceedings of the 1st ACM Conference on Advances in Financial Technologies

View full text Add to dashboard Cite

show abstract

“…In [BS16], the authors also introduced the public variant of tokenized MAC called Public Tokenized Digital Signatures that allow anyone to verify the validity of a signature using a public key. The authors provide a construction for the private variant and a candidate construction for the public variant, based on hidden subspaces that were originally used by Aaronson and Christiano to construct public quantum money [AC13]. A variant of the construction for public tokenized digital signature construction in [BS16] was proven to be secure based on post-quantum Indistinguishability Obfuscation (IO) in [CLLZ21].…”

Section: Related Workmentioning

confidence: 99%

Noise-Tolerant Quantum Tokens for MAC

Behera¹,

Sattath²,

Shinar³

2021

Preprint

View full text Add to dashboard Cite

Message Authentication Code or MAC, is a well-studied cryptographic primitive that is used in order to authenticate communication between two parties sharing a secret key. A Tokenized MAC or TMAC is a related cryptographic primitive, introduced by Ben-David & Sattath (QCrypt'17) which allows to delegate limited signing authority to third parties via the use of single-use quantum signing tokens. These tokens can be issued using the secret key, such that each token can be used to sign at most one document.We provide an elementary construction for TMAC based on BB84 states. Our construction can tolerate up to 14% noise, making it the first noise-tolerant TMAC construction. The simplicity of the quantum states required for our construction combined with the noise-tolerance, makes it practically more feasible than the previous TMAC construction.The TMAC is existentially unforgeable against adversaries with signing and verification oracles (i.e., analogous to EUF-CMA security for MAC), assuming post-quantum collision-resistant hash functions exist.

show abstract

Security Analysis of Quantum Lightning

Roberts

2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Untitled

Cited by 21 publications

References 29 publications

Semi-Quantum Money

Semi-Quantum Money

Noise-Tolerant Quantum Tokens for MAC

Security Analysis of Quantum Lightning

Contact Info

Product

Resources

About