Almost Public Quantum Coins
- URL: http://arxiv.org/abs/2002.12438v4
- Date: Thu, 29 Feb 2024 14:46:45 GMT
- Title: Almost Public Quantum Coins
- Authors: Amit Behera, Or Sattath
- Abstract summary: A quantum coins scheme, just like the traditional currency coin scheme, all the money states are exact copies of each other.
A quantum money scheme can be private, i.e., only the bank can verify the money states, or public.
We propose a way to lift any private quantum coin scheme to a scheme that closely resembles a public quantum coin scheme.
- Score: 0.1813006808606333
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In a quantum money scheme, a bank can issue money that users cannot
counterfeit. Similar to bills of paper money, most quantum money schemes assign
a unique serial number to each money state, thus potentially compromising the
privacy of the users of quantum money. However in a quantum coins scheme, just
like the traditional currency coin scheme, all the money states are exact
copies of each other, providing a better level of privacy for the users. A
quantum money scheme can be private, i.e., only the bank can verify the money
states, or public, meaning anyone can verify. In this work, we propose a way to
lift any private quantum coin scheme -- which is known to exist based on the
existence of one-way functions, due to Ji, Liu, and Song (CRYPTO'18) -- to a
scheme that closely resembles a public quantum coin scheme. Verification of a
new coin is done by comparing it to the coins the user already possesses, by
using a projector on to the symmetric subspace. No public coin scheme was known
prior to this work. It is also the first construction that is very close to a
public quantum money scheme and is provably secure based on standard
assumptions. Finally, the lifting technique, when instantiated with the private
quantum coins scheme~\cite{MS10}, gives rise to the first construction that is
close to an inefficient unconditionally secure public quantum money scheme.
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) - Cloud-based Semi-Quantum Money [8.252999068253603]
In the 1970s, Wiesner introduced the concept of quantum money, where quantum states generated according to specific rules function as currency.
Quantum computers capable of minting and preserving quantum money have not yet emerged.
Existing quantum channels are not stable enough to support the efficient transmission of quantum states for quantum money.
arXiv Detail & Related papers (2024-07-16T07:40:17Z) - 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) - Another Round of Breaking and Making Quantum Money: How to Not Build It
from Lattices, and More [13.02553999059921]
We provide both negative and positive results for publicly verifiable quantum money.
We propose a framework for building quantum money and quantum lightning.
We discuss potential instantiations of our framework.
arXiv Detail & Related papers (2022-11-22T04:17:32Z) - Quantum Money Generated by Multiple Untrustworthy Banks [0.0]
We propose a quantum patchwork money scheme in which banks cannot distribute exact copies to users.
The banks can use the quantum patchwork money without completely trusting the other banks.
Nonbank users can use safely the quantum patchwork money without trusting any banks potentially focused on self-interest.
arXiv Detail & Related papers (2022-05-19T03:21:06Z) - Franchised Quantum Money [13.772109618082382]
We introduce franchised quantum money, an alternative form of quantum money that is easier to construct.
Franchised quantum money retains the features of a useful quantum money scheme, namely unforgeability and local verification.
In franchised quantum money, every user gets a unique secret verification key, and the scheme is secure against counterfeiting and sabotage.
arXiv Detail & Related papers (2021-10-19T05:00:28Z) - 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) - 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) - Quantum Gram-Schmidt Processes and Their Application to Efficient State
Read-out for Quantum Algorithms [87.04438831673063]
We present an efficient read-out protocol that yields the classical vector form of the generated state.
Our protocol suits the case that the output state lies in the row space of the input matrix.
One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
arXiv Detail & Related papers (2020-04-14T11:05:26Z)
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.