Demonstration of quantum-digital payments
- URL: http://arxiv.org/abs/2305.14504v2
- Date: Mon, 8 Jan 2024 14:55:32 GMT
- Title: Demonstration of quantum-digital payments
- Authors: Peter Schiansky, Julia Kalb, Esther Sztatecsny, Marie-Christine
Roehsner, Tobias Guggemos, Alessandro Trenti, Mathieu Bozzio, Philip Walther
- Abstract summary: We show how quantum light can secure daily digital payments by generating inherently unforgeable quantum cryptograms.
Unlike previously proposed protocols, our solution does not depend on long-term quantum storage or trusted agents and authenticated channels.
It is practical with near-term technology and may herald an era of quantum-enabled security.
- Score: 36.136619420474766
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Digital payments have replaced physical banknotes in many aspects of our
daily lives. Similarly to banknotes, they should be easy to use, unique,
tamper-resistant and untraceable, but additionally withstand digital attackers
and data breaches. Current technology substitutes customers' sensitive data by
randomized tokens, and secures the payment's uniqueness with a cryptographic
function, called a cryptogram. However, computationally powerful attacks
violate the security of these functions. Quantum technology comes with the
potential to protect even against infinite computational power. Here, we show
how quantum light can secure daily digital payments by generating inherently
unforgeable quantum cryptograms. We implement the scheme over an urban optical
fiber link, and show its robustness to noise and loss-dependent attacks. Unlike
previously proposed protocols, our solution does not depend on long-term
quantum storage or trusted agents and authenticated channels. It is practical
with near-term technology and may herald an era of quantum-enabled security.
Related papers
- Designing Hash and Encryption Engines using Quantum Computing [2.348041867134616]
We explore quantum-based hash functions and encryption to fortify data security.
The integration of quantum and classical methods demonstrates potential in securing data in the era of quantum computing.
arXiv Detail & Related papers (2023-10-26T14:49:51Z) - Revocable Cryptography from Learning with Errors [61.470151825577034]
We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities.
We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
arXiv Detail & Related papers (2023-02-28T18:58:11Z) - When Quantum Information Technologies Meet Blockchain in Web 3.0 [86.91054991998273]
We introduce a quantum blockchain-driven Web 3.0 framework that provides information-theoretic security for decentralized data transferring and payment transactions.
We discuss the potential applications and challenges of implementing quantum blockchain in Web 3.0.
arXiv Detail & Related papers (2022-11-29T05:38:42Z) - Quantum Cryptography: Quantum Key Distribution, a Non-technical Approach [0.0]
Quantum mechanics provides means to create an inherently secure communication channel that is protected by the laws of physics.
This paper is a non-technical overview of quantum key distribution, a type of cryptography poised to exploit the laws of quantum mechanics directly.
arXiv Detail & Related papers (2022-11-09T15:30:23Z) - Practical quantum tokens without quantum memories and experimental tests [0.15749416770494706]
'S-money' tokens do not require quantum memories or long distance quantum communication.
We describe implementations of S-money schemes with off-the-shelf quantum key distribution technology.
We show that, given standard assumptions in mistrustful quantum cryptographic implementations, unforgeability and user privacy could be guaranteed.
arXiv Detail & Related papers (2021-04-23T17:03:33Z) - Security in Quantum Cryptography [5.914028209673859]
Quantum cryptography exploits principles of quantum physics for the secure processing of information.
We review this physical notion of security, focusing on quantum key distribution and secure communication.
arXiv Detail & Related papers (2021-01-29T19:00:54Z) - Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's
Post-Quantum Security [67.06003361150228]
A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task.
In this work, we examine the hardness of finding such chain of PoWs against quantum strategies.
We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
arXiv Detail & Related papers (2020-12-30T18:03:56Z) - Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [48.94443749859216]
We introduce a quantum copy-protection scheme for a class of evasive functions known as " compute-and-compare programs"
We prove that our scheme achieves non-trivial security against fully malicious adversaries in the quantum random oracle model (QROM)
As a complementary result, we show that the same scheme fulfils a weaker notion of software protection, called "secure software leasing"
arXiv Detail & Related papers (2020-09-29T08:41:53Z) - Implementing a Quantum Coin Scheme [0.20999222360659603]
We describe a digital cash scheme created by Dmitry Gavinsky, which utilise the capability of quantum computing.
For both the creation and verification of quantum coins we convert the algebraic steps into computing steps.
As part of this, we describe the methods used to convert information stored on classical bits to information stored on quantum bits.
arXiv Detail & Related papers (2020-06-03T10:40:12Z) - Quantum noise protects quantum classifiers against adversaries [120.08771960032033]
Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies.
We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived.
This is the first quantum protocol that can be used against the most general adversaries.
arXiv Detail & Related papers (2020-03-20T17:56:14Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.