Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing 2012
DOI: 10.1145/2213977.2213983
|View full text |Cite
|
Sign up to set email alerts
|

Quantum money from hidden subspaces

Abstract: Forty years ago, Wiesner pointed out that quantum mechanics raises the striking possibility of money that cannot be counterfeited according to the laws of physics. We propose the first quantum money scheme that is(1) public-key-meaning that anyone can verify a banknote as genuine, not only the bank that printed it, and (2) cryptographically secure, under a "classical" hardness assumption that has nothing to do with quantum money.Our scheme is based on hidden subspaces, encoded as the zero-sets of random multiv… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
252
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 125 publications
(252 citation statements)
references
References 59 publications
0
252
0
Order By: Relevance
“…Further work on publicly-verifiable (also called public-key quantum money) includes schemes based on the computational difficulty of some knot-theory related problems [107] (see also [3]), verification "oracles" [1] and hidden subspaces [2].…”
Section: Conjugate Codingmentioning
confidence: 99%
“…Further work on publicly-verifiable (also called public-key quantum money) includes schemes based on the computational difficulty of some knot-theory related problems [107] (see also [3]), verification "oracles" [1] and hidden subspaces [2].…”
Section: Conjugate Codingmentioning
confidence: 99%
“…Instead, the qubits can be prepared randomly, and the success probability will be (3/4) . According to Aaronson and Christiano [188], Wiesner's scheme suffers from three distinct drawbacks:…”
Section: Quantum Moneymentioning
confidence: 99%
“…The "Online Attack Problem": A bank that returns invalid banknotes to the sender allows a counterfeiter to break the system [188][189][190].…”
Section: Quantum Moneymentioning
confidence: 99%
See 1 more Smart Citation
“…The reason for a two-step construction is a security reduction: If the mini-scheme can be proven secure, then the full quantum money system is secure given a secure digital signature scheme [188]. Aaronson and Christiano [188] introduced three proposals for public-key quantum money. The first is an abstract scheme, which uses a random oracle and is proven secure.…”
Section: ]mentioning
confidence: 99%