Related papers: Less is More: On Copy Complexity in Quantum Cryptography

Less is More: On Copy Complexity in Quantum Cryptography

URL: http://arxiv.org/abs/2510.04992v2
Date: Tue, 07 Oct 2025 03:36:32 GMT
Title: Less is More: On Copy Complexity in Quantum Cryptography
Authors: Prabhanjan Ananth, Eli Goldin,
Abstract summary: Making definitional changes to the number of copies accessible to an adversary can drastically affect various aspects.<n>We present a generic approach to boost single-copy security to multi-copy security and apply this approach to many settings.
Score: 6.034518754132198
License: http://creativecommons.org/licenses/by-sa/4.0/
Abstract: Quantum cryptographic definitions are often sensitive to the number of copies of the cryptographic states revealed to an adversary. Making definitional changes to the number of copies accessible to an adversary can drastically affect various aspects including the computational hardness, feasibility, and applicability of the resulting cryptographic scheme. This phenomenon appears in many places in quantum cryptography, including quantum pseudorandomness and unclonable cryptography. To address this, we present a generic approach to boost single-copy security to multi-copy security and apply this approach to many settings. As a consequence, we obtain the following new results: -One-copy stretch pseudorandom state generators (under mild assumptions) imply the existence of t-copy stretch pseudorandom state generators, for any fixed polynomial t. -One-query pseudorandom unitaries with short keys (under mild assumptions) imply the existence of t-query pseudorandom unitaries with short keys, for any fixed polynomial t. -Assuming indistinguishability obfuscation and other standard cryptographic assumptions, there exist identical-copy secure unclonable primitives such as public-key quantum money and quantum copy-protection.

Related papers

Multi-Copy Security in Unclonable Cryptography [15.236789514498575]
Unclonable cryptography leverages the quantum no-cloning principle to copy-protect cryptographic functionalities.<n>We introduce a generic compiler that upgrades collusion-resistant unclonable primitives to achieve multi-copy security.<n>We construct the first multi-challenge secure unclonable encryption scheme, which we believe are of independent interest.
arXiv Detail & Related papers (2025-10-14T15:23:42Z)
Pseudorandom quantum authentication [0.8204952610951527]
We introduce the pseudorandom quantum authentication scheme (PQAS)<n>It is an efficient method for quantum states that relies solely on the existence of pseudorandom unitaries (PRUs)
arXiv Detail & Related papers (2025-01-01T20:46:37Z)
Cloning Games, Black Holes and Cryptography [50.022147589030304]
We introduce a new toolkit for analyzing cloning games.<n>This framework allows us to analyze a new cloning game based on binary phase states.<n>We show that the binary phase variantally optimal bound offers quantitative insights into information scrambling in idealized models of black holes.
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.<n>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 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)
Public-Key Encryption with Quantum Keys [11.069434965621683]
We study the notion of quantum public-key encryption (qPKE) where keys are allowed to be quantum states. We show that computational assumptions are necessary to build quantum public-key encryption.
arXiv Detail & Related papers (2023-06-13T11:32:28Z)
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)
A Variational Quantum Attack for AES-like Symmetric Cryptography [69.80357450216633]
We propose a variational quantum attack algorithm (VQAA) for classical AES-like symmetric cryptography. In the VQAA, the known ciphertext is encoded as the ground state of a Hamiltonian that is constructed through a regular graph.
arXiv Detail & Related papers (2022-05-07T03:15:15Z)
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.