After Theft: From Revocation to Neutralization in the Custody of Quantum Clones

• URL: http://arxiv.org/abs/2609.06415v1
• Date: Sun, 06 Sep 2026 06:28:44 GMT
• Title: After Theft: From Revocation to Neutralization in the Custody of Quantum Clones
• Abstract summary: Encrypted quantum cloning enables the creation of multiple encrypted clones of an unknown quantum state.<n>We argue that this property supports a distinctive custodial security primitive for post-compromise response.
• Score: 2.0071079975427284
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Encrypted quantum cloning enables the creation of multiple encrypted clones of an unknown quantum state while allowing only one effective decryption, with the decryption resource being intrinsically consumed in the process. In this paper, we argue that this property supports a distinctive custodial security primitive for post-compromise response. We consider a threat model in which an adversary steals an encrypted quantum clone but does not yet possess the corresponding decryption key. In such a scenario, a legitimate custodian may unseal a different trusted clone, thereby exhausting the sole available unsealing opportunity and rendering the stolen clone permanently useless. We argue that this mechanism is not adequately described as mere revocation. Rather, it realizes a stronger form of post-theft response, which we call neutralization. We formalize this distinction, locate it within a broader post-theft response space, and introduce a temporal threat model. We compare the mechanism with its closest classical analogue, showing that the classical case can reproduce the policy outcome only through external procedural composition. We finally interpret encrypted quantum cloning as a primitive for post-compromise quantum custody in distributed preservation settings, with prospective relevance for Cyber-Humanities-oriented preservation architectures.

Related papers

• Beyond the Canonical Protocol: Quantum Encrypted Cloning from Secret-Sharing Access Structures [1.8941846253692634]
  Quantum encrypted cloning shows that an unknown quantum state can be distributed into multiple encrypted copies.<n>Recent work has related canonical encrypted-cloning protocols to particular forms of quantum secret sharing.<n>We use QSS access structures as a design library from which encrypted-cloning schemes can be extracted.
  arXiv  Detail & Related papers  (2026-06-04T09:23:16Z)
• Encrypted Cloning, Absolute Maximal Entanglement and Quantum Secret Sharing [0.0]
  We develop a framework for arbitrary dimensions based on Weyl-Heisenberg displacement operators.<n>We prove that an encrypted qudit system comprising two signal-noise qudit pairs is equivalent to a five-party AME state in any dimension.
  arXiv  Detail & Related papers  (2026-05-26T11:24:54Z)
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning [1.9201151941485035]
  We classify subsets of the encrypted-clone storage register into authorized, completely non-informative, and partially informative sets.<n>We show that intermediate non-authorized subsets may retain only a restricted residual dependence on the input state.
  arXiv  Detail & Related papers  (2026-04-11T11:02:06Z)
• Experimental demonstration that qubits can be cloned at will, if encrypted with a single-use decryption key [0.07037008937757393]
  We find that encrypted cloning is stable under hardware noise, even when used as a module.<n>This establishes it as a versatile quantum primitive for practical use.<n>The actual constraint is that the decryption mechanism must be single-use.
  arXiv  Detail & Related papers  (2026-02-11T09:51:32Z)
• Adapter Shield: A Unified Framework with Built-in Authentication for Preventing Unauthorized Zero-Shot Image-to-Image Generation [74.5813283875938]
  Zero-shot image-to-image generation poses substantial risks related to intellectual property violations.<n>This work presents Adapter Shield, the first universal and authentication-integrated solution aimed at defending personal images from misuse.<n>Our method surpasses existing state-of-the-art defenses in blocking unauthorized zero-shot image synthesis.
  arXiv  Detail & Related papers  (2025-11-25T04:49:16Z)
• 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)
• 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)
• 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.