Next Article in Journal / Special Issue
Certified Randomness From Steering Using Sequential Measurements
Previous Article in Journal / Special Issue
Intercept-Resend Emulation Attacks against a Continuous-Variable Quantum Authentication Protocol with Physical Unclonable Keys
Article

Practically Feasible Robust Quantum Money with Classical Verification

School of Informatics, University of Edinburgh, Edinburgh EH8 9AB, UK
Cryptography 2019, 3(4), 26; https://doi.org/10.3390/cryptography3040026
Received: 15 August 2019 / Revised: 30 October 2019 / Accepted: 12 November 2019 / Published: 20 November 2019
(This article belongs to the Special Issue Quantum Cryptography and Cyber Security)
We introduce a private quantum money scheme with the note verification procedure based on sampling matching, a problem in a one-way communication complexity model. Our scheme involves a bank who produces and distributes quantum notes, noteholders who are untrusted, and trusted local verifiers of the bank to whom the holders send their notes in order to carry out transactions. The key aspects of our money scheme include: note verification procedure requiring a single round classical interaction between the local verifier and bank; fixed verification circuit that uses only passive linear optical components; re-usability of each note in our scheme which grows linearly with the size of note; and an unconditional security against any adversary trying to forge the banknote while tolerating the noise of up to 21.4%. We further describe a practical implementation technique of our money scheme using weak coherent states of light and the verification circuit involving a single 50/50 beam splitter and two single-photon threshold detectors. Previous best-known matching based money scheme proposal involves a verification circuit where the number of optical components increase proportional to the increase in desired noise tolerance (robustness). In contrast, we achieve any desired noise tolerance (up to a maximal threshold value) with only a fixed number of optical components. This considerable reduction of components in our scheme enables us to reach the robustness values that is not feasible for any existing money scheme with the current technology. View Full-Text
Keywords: quantum money; private cryptography; sampling matching; unconditional security quantum money; private cryptography; sampling matching; unconditional security
Show Figures

Figure 1

MDPI and ACS Style

Kumar, N. Practically Feasible Robust Quantum Money with Classical Verification. Cryptography 2019, 3, 26. https://doi.org/10.3390/cryptography3040026

AMA Style

Kumar N. Practically Feasible Robust Quantum Money with Classical Verification. Cryptography. 2019; 3(4):26. https://doi.org/10.3390/cryptography3040026

Chicago/Turabian Style

Kumar, Niraj. 2019. "Practically Feasible Robust Quantum Money with Classical Verification" Cryptography 3, no. 4: 26. https://doi.org/10.3390/cryptography3040026

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop