Bump:
I read an article (also by Aaronson et. al) about quantum money in this month's issue of Communications of the ACM (it was on the cover see: http://portalparts.acm.org/2250000/2240236/fm/frontmatter.pdf?ip=87.211.128.161&CFID=105779894&CFTOKEN=12974476 ). I read the article and Googled around a bit (finding this post) but unfortunately they failed to compare this to (or even mention) Bitcoin.
Does anyone here have some thoughts on this and its relation to Bitcoin?
Topic: Paper: Quantum Money from Hidden Subspaces (Read 1267 times)
Will watch later, but got to leave this hotel room in La Porte, IN, to get back loading the rest of that barn wood. Thanks for the thread, elux.
~Bruno~
~Bruno~
Quote
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 verified by the bank -- we are able to use our techniques to patch a major security hole in Wiesner's scheme. We give the first private-key quantum money scheme that allows unlimited verifications and that remains unconditionally secure, even if the counterfeiter can interact adaptively with the bank. Our money scheme is simpler than previous public-key quantum money schemes, including a knot-based scheme of Farhi et al. The verifier needs to perform only two tests, one in the standard basis and one in the Hadamard basis -- matching the original intuition for quantum money, based on the existence of complementary observables.
Our security proofs use a new variant of Ambainis's quantum adversary method, and several other tools that might be of independent interest.
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 verified by the bank -- we are able to use our techniques to patch a major security hole in Wiesner's scheme. We give the first private-key quantum money scheme that allows unlimited verifications and that remains unconditionally secure, even if the counterfeiter can interact adaptively with the bank. Our money scheme is simpler than previous public-key quantum money schemes, including a knot-based scheme of Farhi et al. The verifier needs to perform only two tests, one in the standard basis and one in the Hadamard basis -- matching the original intuition for quantum money, based on the existence of complementary observables.
Our security proofs use a new variant of Ambainis's quantum adversary method, and several other tools that might be of independent interest.
Arxiv quant-ph: Quantum Money from Hidden Subspaces
Author bio:
Quote
Scott Aaronson is an Associate Professor of Electrical Engineering and Computer Science at MIT, CSAIL.
His work concerns the limitations of quantum computers, and computational complexity theory more generally.
His work concerns the limitations of quantum computers, and computational complexity theory more generally.
A video talk-through was published today. First mention of Bitcoin at around 5.40.
Jump to: