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
- Anonymous Public-Key Quantum Money and Quantum Voting [15.80411915665245]
We develop the formal definitions of privacy for quantum money schemes.
We then construct the first public-key quantum money schemes that satisfy these security notions.
We show that the no-cloning principle, a result of quantum mechanics, allows us to construct schemes, with security guarantees that are classically impossible.
arXiv Detail & Related papers (2024-11-07T07:21:28Z) - Quantum Token Obfuscation via Superposition [0.0]
As quantum computing advances, traditional cryptographic security measures, including token obfuscation, are increasingly vulnerable to quantum attacks.
This paper introduces a quantum-enhanced approach to token obfuscation leveraging quantum superposition and multi-basis verification.
Our experimental results demonstrate significant improvements in token security and robustness, validating this approach as a promising solution for quantum-secure cryptographic applications.
arXiv Detail & Related papers (2024-11-02T14:05:20Z) - Revocable Encryption, Programs, and More: The Case of Multi-Copy Security [48.53070281993869]
We show the feasibility of revocable primitives, such as revocable encryption and revocable programs.
This suggests that the stronger notion of multi-copy security is within reach in unclonable cryptography.
arXiv Detail & Related papers (2024-10-17T02:37:40Z) - A Quantum Vault Scheme for Digital Currency [1.0650780147044159]
Quantum money exploits the quantum mechanical principle of no-cloning to enable a currency that is immune to double spending.
Here, we propose a model for quantum currency, which alleviates the need for quantum wallets by delegating quantum storage and processing to an intermediary that we call a "quantum vault"
arXiv Detail & Related papers (2024-08-08T16:22:45Z) - 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) - 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) - 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 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.