A Quantum Money Solution to the Blockchain Scalability Problem
- URL: http://arxiv.org/abs/2002.11998v2
- Date: Fri, 10 Jul 2020 07:40:04 GMT
- Title: A Quantum Money Solution to the Blockchain Scalability Problem
- Authors: Andrea Coladangelo, Or Sattath
- Abstract summary: We give the first example of the use of smart contracts in a quantum setting.
We describe a simple hybrid classical-quantum payment system whose main ingredients are a classical blockchain capable of handling stateful smart contracts.
Our hybrid payment system employs quantum states as banknotes and a classical blockchain to settle disputes and to keep track of the valid serial numbers.
- Score: 3.89615163169501
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We put forward the idea that classical blockchains and smart contracts are
potentially useful primitives not only for classical cryptography, but for
quantum cryptography as well. Abstractly, a smart contract is a functionality
that allows parties to deposit funds, and release them upon fulfillment of
algorithmically checkable conditions, and can thus be employed as a formal tool
to enforce monetary incentives.
In this work, we give the first example of the use of smart contracts in a
quantum setting. We describe a simple hybrid classical-quantum payment system
whose main ingredients are a classical blockchain capable of handling stateful
smart contracts, and quantum lightning, a strengthening of public-key quantum
money introduced by Zhandry (Eurocrypt'19). Our hybrid payment system employs
quantum states as banknotes and a classical blockchain to settle disputes and
to keep track of the valid serial numbers. It has several desirable properties:
it is decentralized, requiring no trust in any single entity; payments are as
quick as quantum communication, regardless of the total number of users; when a
quantum banknote is damaged or lost, the rightful owner can recover the lost
value.
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) - From Portfolio Optimization to Quantum Blockchain and Security: A
Systematic Review of Quantum Computing in Finance [0.0]
We provide an overview of the recent work in the quantum finance realm from various perspectives.
The applications in consideration are Portfolio Optimization, Fraud Detection, and Monte Carlo methods for derivative pricing and risk calculation.
We give a comprehensive overview of the applications of quantum computing in the field of blockchain technology.
arXiv Detail & Related papers (2023-06-12T19:53:23Z) - Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical.
We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more.
Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
arXiv Detail & Related papers (2023-03-02T14:18:17Z) - 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) - On the (Im)plausibility of Public-Key Quantum Money from
Collision-Resistant Hash Functions [6.164147034988822]
We present the first black-box separation of quantum money and cryptographic primitives.
Specifically, we show that collision-resistant hash functions cannot be used as a black-box to construct public-key quantum money schemes.
arXiv Detail & Related papers (2023-01-23T00:44:54Z) - Beating the fault-tolerance bound and security loopholes for Byzantine
agreement with a quantum solution [12.059343107638188]
We propose a Byzantine agreement framework with unconditional security to break the $1/3$ fault-tolerance bound.
Our work strictly obeys two Byzantine conditions and can be extended to any number of players without requirements for multiparticle entanglement.
Our work indicates the quantum advantage in terms of consensus problems and suggests an important avenue for quantum blockchain and quantum consensus networks.
arXiv Detail & Related papers (2022-06-18T09:46:58Z) - Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
We construct the first fully homomorphic encryption scheme with certified deletion.
Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
arXiv Detail & Related papers (2022-03-03T10:07:32Z) - Quantum-resistance in blockchain networks [46.63333997460008]
This paper describes the work carried out by the Inter-American Development Bank, the IDB Lab, LACChain, Quantum Computing (CQC), and Tecnologico de Monterrey to identify and eliminate quantum threats in blockchain networks.
The advent of quantum computing threatens internet protocols and blockchain networks because they utilize non-quantum resistant cryptographic algorithms.
arXiv Detail & Related papers (2021-06-11T23:39:25Z) - 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) - Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel.
We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries.
We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
arXiv Detail & Related papers (2020-10-15T17:55:31Z)
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.