New Constructions for Quantum Money
We propose an information theoretically secure secret-key quantum money scheme in which the verification of a coin is classical and consists of only one round; namely, a classical query from the user to the bank and an accept/reject answer from the bank to the user. A coin can be verified polynomially (on the number of its qubits) many times before it expires. Our scheme is an improvement on Gavinsky's scheme [Gavinsky, Computational Complexity, 2012], where three rounds of interaction are needed and is based on the notion of quantum retrieval games. Moreover, we propose a public-key quantum money scheme which uses one-time memories as a building block and is computationally secure in the random oracle model. This construction is derived naturally from our secret-key scheme using the fact that one-time memories are a special case of quantum retrieval games.
Quantum Money
Quantum Cryptography
Quantum Retrieval Games
92-110
Regular Paper
Marios
Georgiou
Marios Georgiou
Iordanis
Kerenidis
Iordanis Kerenidis
10.4230/LIPIcs.TQC.2015.92
Scott Aaronson and Paul Christiano. Quantum money from hidden subspaces. In Proceedings of the 44th Symposium on Theory of Computing, pages 41-60. ACM, 2012.
Ziv Bar-Yossef, Thathachar S Jayram, and Iordanis Kerenidis. Exponential separation of quantum and classical one-way communication complexity. In Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pages 128-137. ACM, 2004.
Anne Broadbent, Gus Gutoski, and Douglas Stebila. Quantum one-time programs. Advances in Cryptology-CRYPTO 2013, pages 344-360, 2013.
Edward Farhi, David Gosset, Avinatan Hassidim, Andrew Lutomirski, and Peter Shor. Quantum money from knots. In Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pages 276-289. ACM, 2012.
Dmitry Gavinsky. Quantum money with classical verification. In Computational Complexity (CCC), 2012 IEEE 27th Annual Conference on, pages 42-52. IEEE, 2012.
Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, and Ronald de Wolf. Exponential separations for one-way quantum communication complexity, with applications to cryptography. In Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pages 516-525. ACM, 2007.
Shafi Goldwasser, Yael Tauman Kalai, and Guy N Rothblum. One-time programs. Advances in Cryptology-CRYPTO 2008, pages 39-56, 2008.
Yi-Kai Liu. Building one-time memories from isolated qubits. In Proceedings of the 5th conference on Innovations in theoretical computer science, pages 269-286. ACM, 2014.
Yi-Kai Liu. Privacy amplification in the isolated qubits model. arXiv preprint arXiv:1410.3918, 2014.
Yi-Kai Liu. Single-shot security for one-time memories in the isolated qubits model. arXiv preprint arXiv:1402.0049, 2014.
Abel Molina, Thomas Vidick, and John Watrous. Optimal counterfeiting attacks and generalizations for wiesner’s quantum money. In Theory of Quantum Computation, Communication, and Cryptography, pages 45-64. Springer, 2013.
Michele Mosca and Douglas Stebila. Quantum coins. Error-Correcting Codes, Finite Geometries and Cryptography. Contemporary Mathematics, volume 523, pages 35-47. American Mathematical Society, 2010, 2009.
Daniel Nagaj and Or Sattath. An adaptive attack on wiesner’s quantum money based on interaction-free measurement. arXiv preprint arXiv:1404.1507, 2014.
Marta Conde Pena, Jean-Charles Faugère, and Ludovic Perret. Algebraic cryptanalysis of a quantum money scheme the noise-free case. In Public-Key Cryptography-PKC 2015, pages 194-213. Springer, 2015.
Stephen Wiesner. Conjugate coding. ACM Sigact News, 15(1):78-88, 1983.
Norman Yao, Fernando Pastawski, Liang Jiang, Mikhail Lukin, and Ignacio Cirac. Unforgeable noise-tolerant quantum tokens. Bulletin of the American Physical Society, 57, 2012.
Creative Commons Attribution 3.0 Unported license
https://creativecommons.org/licenses/by/3.0/legalcode