short-paper

Quantum Money Scheme: Simulation Results

Authors:

Jerry Horgan,

Hazel Murray,

David Malone,

Deirdre KilbaneAuthors Info & Claims

NANOCOM '21: Proceedings of the Eight Annual ACM International Conference on Nanoscale Computing and Communication

Article No.: 34, Pages 1 - 2

https://doi.org/10.1145/3477206.3477475

Published: 17 September 2021 Publication History

Get Access

Abstract

Quantum computing has the power to break current cryptographic systems, disrupting online banking, shopping, data storage and communications. However, quantum mechanics can also be used to make these systems stronger and more resilient. In this paper we describe the transmissibility of a quantum money scheme, which was proposed by Dmitry Gavinsky and implemented by the authors, and discuss some of its benefits and limitations.

References

[1]

Bar-Yossef, Z., Jayram, T. S., and Kerenidis, I. Exponential separation of quantum and classical one-way communication complexity. In Proc. 36th ACM symposium on Theory of computing (2004), pp. 128--137.

Digital Library

Google Scholar

[2]

Dahlberg, A., and Wehner, S. Simulaqron --- a simulator for developing quantum internet software. Quantum Science and Technology 4, 1 (2018), 015001.

Crossref

Google Scholar

[3]

Gavinsky, D. Quantum money with classical verification. In Proc. 27th Conference on Computational Complexity (2012), IEEE, pp. 42--52.

Digital Library

Google Scholar

[4]

Grover, L. K. A fast quantum mechanical algorithm for database search. In Proc. 28th ACM Symposium on Theory of Computing (New York, NY, USA, 1996), STOC '96, Association for Computing Machinery, p. 212--219.

Google Scholar

[5]

HoRgAN, J. Quantum Coin GitHub Repository. https://gitlab-ee.tssg.org/jhorgan/quantum_coin, Nov. 2019.

Google Scholar

[6]

Mavroeidis, V., Vishi, K., Zych, M. D., and Jøsang, A. The impact of quantum computing on present cryptography. arXiv preprint arXiv:1804.00200 (2018).

Google Scholar

[7]

Shor, P. W. Algorithms for quantum computation: discrete logarithms and factoring. In Proc. 35th Symposium on Foundations of Computer Science (1994), IEEE, pp. 124--134.

Digital Library

Google Scholar

[8]

Wiesner, S. Conjugate coding. ACM Sigact News 15, 1 (1983), 78--88.

Digital Library

Google Scholar

Recommendations

Semi-Quantum Money
AFT '19: Proceedings of the 1st ACM Conference on Advances in Financial Technologies

Private quantum money allows a bank to mint quantum money states that it can later verify, but that no one else can forge. In classically verifiable quantum money -- introduced by Gavinsky (CCC 2012) -- the verification is done via an interactive ...
Public-key Quantum money with a classical bank
STOC 2022: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing

Quantum money is a main primitive in quantum cryptography, that enables a bank to distribute to parties in the network, called wallets, unclonable quantum banknotes that serve as a medium of exchange between wallets. While quantum money suggests a ...
Quantum money from hidden subspaces
STOC '12: Proceedings of the forty-fourth annual ACM symposium on Theory of computing

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. We propose the first quantum money scheme that is (1) public-key---meaning that anyone ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

NANOCOM '21: Proceedings of the Eight Annual ACM International Conference on Nanoscale Computing and Communication

September 2021

179 pages

ISBN:9781450387101

DOI:10.1145/3477206

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 September 2021

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Short-paper
Research
Refereed limited

Funding Sources

Science Foundation Ireland

Conference

NANOCOM '21

NANOCOM '21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication

September 7 - 9, 2021

Virtual Event, Italy

Acceptance Rates

NANOCOM '21 Paper Acceptance Rate 13 of 22 submissions, 59%;

Overall Acceptance Rate 97 of 135 submissions, 72%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
45
Total Downloads

Downloads (Last 12 months)11
Downloads (Last 6 weeks)1

Reflects downloads up to 19 Nov 2024

Other Metrics

View Author Metrics

Citations

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Recommendations

Semi-Quantum Money

Public-key Quantum money with a classical bank

Quantum money from hidden subspaces