New Approaches for Quantum Copy-Protection
- URL: http://arxiv.org/abs/2004.09674v7
- Date: Fri, 16 Oct 2020 06:05:36 GMT
- Title: New Approaches for Quantum Copy-Protection
- Authors: Scott Aaronson, Jiahui Liu, Qipeng Liu, Mark Zhandry, Ruizhe Zhang
- Abstract summary: We show how to copy protect any program that cannot be learned from its input/output behavior.
We show roughly, that any program which can be watermarked can be copy detected.
- Score: 15.168166173606792
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum copy protection uses the unclonability of quantum states to construct
quantum software that provably cannot be pirated. Copy protection would be
immensely useful, but unfortunately little is known about how to achieve it in
general. In this work, we make progress on this goal, by giving the following
results:
- We show how to copy protect any program that cannot be learned from its
input/output behavior, relative to a classical oracle. This improves on
Aaronson [CCC'09], which achieves the same relative to a quantum oracle. By
instantiating the oracle with post-quantum candidate obfuscation schemes, we
obtain a heuristic construction of copy protection.
-We show, roughly, that any program which can be watermarked can be copy
detected, a weaker version of copy protection that does not prevent copying,
but guarantees that any copying can be detected. Our scheme relies on the
security of the assumed watermarking, plus the assumed existence of public key
quantum money. Our construction is general, applicable to many recent
watermarking schemes.
Related papers
- 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) - Unclonable Cryptography with Unbounded Collusions and Impossibility of Hyperefficient Shadow Tomography [11.781645368622517]
We give the first unbounded collusion-resistant (i.e. multiple-copy secure) copy-protection schemes.
We construct (i) public-key encryption, (ii) public-key functional encryption, (iii) signature and (iv) pseudorandom function schemes whose keys are copy-protected against unbounded collusions.
arXiv Detail & Related papers (2023-11-30T07:36:42Z) - How to Use Quantum Indistinguishability Obfuscation [1.6298172960110866]
We show how to achieve "best-possible" copy protection for all programs.
We show that applying qsiO to a program immediately achieves best-possible copy protection.
We also show that, assuming injective one-way functions exist, qsiO is concrete copy protection for a large family of puncturable programs.
arXiv Detail & Related papers (2023-11-13T23:07:25Z) - 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) - A Note on Copy-Protection from Random Oracles [7.129830575525267]
Quantum copy-protection uses the no-cloning principle of quantum mechanics to protect software from being illegally distributed.
Since copy-protection is shown to be impossible to achieve in the plain model, we investigate the question of constructing copy-protection for arbitrary classes of unlearnable functions.
arXiv Detail & Related papers (2022-08-26T22:40:07Z) - 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 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) - Secure Software Leasing [7.754062965937491]
We formulate an alternative definition for tackling software piracy, called secure software leasing (SSL)
Our construction is the first provably secure solution, based on concrete cryptographic assumptions, for software anti-piracy.
To complement our positive result, we show, based on cryptographic assumptions, that there is a class of quantum unlearnable functions for which SSL does not exist.
arXiv Detail & Related papers (2020-05-11T17:48:18Z)
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.