Quantum Money from Hidden Subspaces
Scott Aaronson, Paul Christiano

TL;DR
This paper introduces a novel public-key quantum money scheme based on hidden subspaces, offering unconditional security and practical verification methods, advancing the feasibility and security of quantum currency.
Contribution
It presents the first public-key quantum money scheme with unconditional security based on classical hardness assumptions, and improves security analysis of Wiesner's original scheme.
Findings
Scheme is unconditionally secure in the black-box model
Verifier performs only two simple basis tests
Scheme is simpler and more practical than previous quantum money schemes
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 multivariate polynomials. A main technical advance is to show that the "black-box" version of our scheme, where the polynomials are replaced by classical oracles, is unconditionally secure. Previously, such a result had only been known relative to a quantum oracle (and even there, the proof was never published). Even in Wiesner's original setting -- quantum money that can only be…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Cryptography and Data Security · Chaos-based Image/Signal Encryption
