2026-07-23T21:52:42Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:5551 2024-03-06T10:36:39Z ddc:004 open_access

New Constructions for Quantum Money Georgiou, Marios Kerenidis, Iordanis Quantum Money Quantum Cryptography Quantum Retrieval Games 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Marios Georgiou and Iordanis Kerenidis 2015 Is Part Of LIPIcs, Volume 44, 10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.TQC.2015.92 urn:nbn:de:0030-drops-55510 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2015.92 eng https://creativecommons.org/licenses/by/3.0/legalcode