Quantum money

Authors:
Scott Aaronson;Edward Farhi;David Gosset;Avinatan Hassidim;Jonathan Kelner;Andrew Lutomirski
Affiliations:
CSAIL, MIT, Cambridge, MA;Theoretical Physics, MIT, Cambridge, MA;University of Waterloo, Canada;Bar Ilan University, and works at Google Israel;CSAIL, MIT, Cambridge, MA;AMA Capital Management LLC, Palo Alto, CA
Venue:
Communications of the ACM
Year:
2012

An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement

SIAM Journal on Computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Review
Conjugate coding

ACM SIGACT News - A special issue on cryptography
On lattices, learning with errors, random linear codes, and cryptography

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Fast quantum byzantine agreement

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Algorithms for quantum computation: discrete logarithms and factoring

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Quantum Copy-Protection and Quantum Money

CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
Recent progress in quantum algorithms

Communications of the ACM
Optimal Quantum Strong Coin Flipping

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Universal Blind Quantum Computation

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Secure assisted quantum computation

Quantum Information & Computation
Quantum money from knots

Proceedings of the 3rd Innovations in Theoretical Computer Science Conference

Hi-index	48.22

Imagine money you can carry and spend without a trace.