Cloning Games: A General Framework for Unclonable Primitives
- URL: http://arxiv.org/abs/2302.01874v1
- Date: Fri, 3 Feb 2023 17:24:38 GMT
- Title: Cloning Games: A General Framework for Unclonable Primitives
- Authors: Prabhanjan Ananth, Fatih Kaleoglu and Qipeng Liu
- Abstract summary: cloning games captures fundamental unclonable primitives such as quantum money, copy-protection, unclonable encryption, single-decryptor encryption, and many more.
We construct unclonable encryption in the quantum random oracle model based on BB84 states, improving upon the previous work, which used coset states.
We establish a relationship between different challenge distributions of copy-protection schemes and single-decryptor encryption schemes.
- Score: 8.140799273465545
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The powerful no-cloning principle of quantum mechanics can be leveraged to
achieve interesting primitives, referred to as unclonable primitives, that are
impossible to achieve classically. In the past few years, we have witnessed a
surge of new unclonable primitives. While prior works have mainly focused on
establishing feasibility results, another equally important direction, that of
understanding the relationship between different unclonable primitives is still
in its nascent stages. Moving forward, we need a more systematic study of
unclonable primitives. To this end, we introduce a new framework called cloning
games. This framework captures many fundamental unclonable primitives such as
quantum money, copy-protection, unclonable encryption, single-decryptor
encryption, and many more. By reasoning about different types of cloning games,
we obtain many interesting implications to unclonable cryptography, including
the following:
1. We obtain the first construction of information-theoretically secure
single-decryptor encryption in the one-time setting.
2. We construct unclonable encryption in the quantum random oracle model
based on BB84 states, improving upon the previous work, which used coset
states. Our work also provides a simpler security proof for the previous work.
3. We construct copy-protection for single-bit point functions in the quantum
random oracle model based on BB84 states, improving upon the previous work,
which used coset states, and additionally, providing a simpler proof.
4. We establish a relationship between different challenge distributions of
copy-protection schemes and single-decryptor encryption schemes.
5. Finally, we present a new construction of one-time encryption with
certified deletion.
Related papers
- Cloning Games, Black Holes and Cryptography [53.93687166730726]
This paper is the new, natural, notion of Haar cloning games together with two applications.
In the area of black-hole physics, our game reveals that, in an idealized model of a black hole, the information from infalling entangled qubits can only be recovered from either the interior or the exterior.
In the area of quantum cryptography, our game helps us construct succinct unclonable encryption schemes from the existence of pseudorandom unitaries.
arXiv Detail & Related papers (2024-11-07T14:09:32Z) - 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) - Simultaneous Haar Indistinguishability with Applications to Unclonable Cryptography [5.360892674012226]
We present a new approach to unclonable encryption via a reduction to a novel question about nonlocal quantum state discrimination.
Our main technical result is showing that the players cannot distinguish between each player receiving independently-chosen Haar random states versus all players receiving the same Haar random state.
We also show other implications to single-decryptor encryption and leakage-resilient secret sharing.
arXiv Detail & Related papers (2024-05-16T17:30:55Z) - A Modular Approach to Unclonable Cryptography [4.336971448707467]
We propose unclonable puncturable obfuscation (UPO) and study its implications for unclonable cryptography.
We present modular (and arguably, simple) constructions of many primitives in unclonable cryptography.
We show that any cryptographic functionality can be copy-protected as long as this functionality satisfies a notion of security.
arXiv Detail & Related papers (2023-11-20T16:22:52Z) - Publicly-Verifiable Deletion via Target-Collapsing Functions [81.13800728941818]
We show that targetcollapsing enables publiclyverifiable deletion (PVD)
We build on this framework to obtain a variety of primitives supporting publiclyverifiable deletion from weak cryptographic assumptions.
arXiv Detail & Related papers (2023-03-15T15:00:20Z) - 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 Feasibility of Unclonable Encryption, and More [16.64327673223307]
We show that encryption schemes satisfying unclonable indistinguishability exist unconditionally in the quantum random oracle model.
We also establish the feasibility of copy-protection for single-bit output point functions.
arXiv Detail & Related papers (2022-07-14T01:03:56Z) - 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 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)
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.