Fetching the paper…
Reading the bibliography…
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.
Atomic Physics and Human Knowledge
N. Bohr · 1961
Earlier work this paper cites.
Conjugate coding
S. Wiesner · 1970
Earlier work this paper cites.
Quantum cryptography, or unforgeable subway tokens
C. H. Bennett, G. Brassard, S. Breidbart, and S. Wiesner · 1982
Earlier work this paper cites.
Quantum cryptography: public key distribution and coin tossing
C. H. Bennett and G. Brassard · 1984
Earlier work this paper cites.
Universal one-way hash functions and their cryptographic applications
M. Naor and M. Yung · 1989
Earlier work this paper cites.
One-way functions are necessary and sufficient for secure signatures
J. Rompel · 1990
Earlier work this paper cites.
A fast quantum mechanical algorithm for database search
L. K. Grover · 1996
Earlier work this paper cites.
Strengths and weaknesses of quantum computing
C. Bennett, E. Bernstein, G. Brassard, and U. Vazirani · 1997
Earlier work this paper cites.
Finding a large hidden clique in a random graph
N. Alon, M. Krivelevich, and B. Sudakov · 1998
Earlier work this paper cites.
Quantum lower bounds by polynomials
R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf · 1998
Earlier work this paper cites.
Improved algorithms for isomorphisms of polynomials
J. Patarin, L. Goubin, and N. Courtois · 1998
Earlier work this paper cites.
Quantum lower bounds by quantum arguments
A. Ambainis · 2000
Earlier work this paper cites.
Quantum Computation and Quantum Information
M. Nielsen and I. Chuang · 2000
Earlier work this paper cites.
On the (im)possibility of obfuscating programs
B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, and K. Yang · 2001
Earlier work this paper cites.
Quantum lower bound for the collision problem
S. Aaronson · 2002
Cited alongside, same era.
Quantum amplitude amplification and estimation
G. Brassard, P. Høyer, M. Mosca, and A. Tapp · 2002
Cited alongside, same era.
An attack on the isomorphisms of polynomials problem with one secret
W. Geiselmann, W. Meier, and R. Steinwandt · 2003
Cited alongside, same era.
Limitations of quantum advice and one-way communication
S. Aaronson · 2004
Cited alongside, same era.
Bounds for error reduction with few quantum queries
S. Chakraborty, J. Radhakrishnan, and N. Raghunathan · 2005
Cited alongside, same era.
On lattices, learning with errors, random linear codes, and cryptography
O. Regev · 2005
Cited alongside, same era.
Breaking and making quantum money: toward a new quantum cryptographic protocol
A. Lutomirski, S. Aaronson, E. Farhi, D. Gosset, A. Hassidim, J. Kelner, and P. Shor · 2010
Later among the works it cites.
M. Mosca and D. Stebila · 2010
Later among the works it cites.
Cold boot key recovery by solving polynomial systems with noise
M. Albrecht and C. Cid · 2011
Later among the works it cites.
Symmetry-assisted adversaries for quantum state generation
A. Ambainis, L. Magnin, M. Roetteler, and J. Roland · 2011
Later among the works it cites.
Random oracles in a quantum world
D. Boneh, Ö. Dagdelen, M. Fischlin, A. Lehmann, C. Schaffner, and M. Zhandry · 2011
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A new algorithm for fixed point quantum search
T. Tulsi, L. Grover, and A. Patel · 2006
Cited alongside, same era.
Quantum versus classical proofs and advice
S. Aaronson and G. Kuperberg · 2007
Cited alongside, same era.
Quantum copy-protection and quantum money
S. Aaronson · 2009
Cited alongside, same era.
Multivariate public key cryptography
J. Ding and B.-Y. Yang · 2009
Cited alongside, same era.
Most tensor problems are NP hard, 2009
C. Hillar and L.-H. Lim · 2009
Cited alongside, same era.
Bonsai trees, or how to delegate a lattice basis
D. Cash, D. Hofheinz, E. Kiltz, and C. Peikert · 2010
Cited alongside, same era.
Later among the works it cites.
Practical cryptanalysis of the identification scheme based on the isomorphism of polynomial with one secret problem
C. Bouillaguet, J.-C. Faugère, P.-A. Fouque, and L. Perret · 2011
Later among the works it cites.
Quantum money with classical verification
D. Gavinsky · 2011
Later among the works it cites.
Quantum query complexity of state conversion
T. Lee, R. Mittal, B. W. Reichardt, R. Špalek, and M. Szegedy · 2011
Later among the works it cites.
Component mixers and a hardness result for counterfeiting quantum money
A. Lutomirski · 2011
Later among the works it cites.
Unforgeable noise-tolerant quantum tokens
F. Pastawski, N. Y. Yao, L. Jiang, M. D. Lukin, and J. I. Cirac · 2011
Later among the works it cites.
On the security of private-key quantum money, 2012
S. Aaronson · 2012
Closest in time.
E. Farhi, D. Gosset, A. Hassidim, A. Lutomirski, and P. Shor · 2012
Closest in time.
Optimal counterfeiting attacks and generalizations for Wiesner’s quantum money
A. Molina, T. Vidick, and J. Watrous · 2012
Closest in time.