Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning

• URL: http://arxiv.org/abs/2604.10155v1
• Date: Sat, 11 Apr 2026 11:02:06 GMT
• Title: Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Abstract summary: 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.
• Score: 1.9201151941485035
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Encrypted cloning enables the redundant storage of an unknown qubit while remaining compatible with the no-cloning theorem, since only one clone can later be recovered through key-consuming decryption. Because encryption in this protocol is introduced to enable cloning-compatible redundancy rather than to guarantee confidentiality by design, its secrecy properties must be assessed explicitly. Here we classify the subsets of the encrypted-clone storage register into authorized, completely non-informative, and partially informative sets. We show that intermediate non-authorized subsets may retain only a restricted residual dependence on the input state, and we characterize exactly when this dependence occurs. The resulting leakage pattern is parity-dependent, revealing a structural confidentiality limitation of encrypted cloning.

Related papers

• After Theft: From Revocation to Neutralization in the Custody of Quantum Clones [2.0071079975427284]
  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.
  arXiv  Detail & Related papers  (2026-09-06T06:28:44Z)
• 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)
• Classification of informative subsets in quantum encrypted cloning on qudits [6.632912569027217]
  We systematically classify the informative subsets of the storage register in the qudit encrypted-cloning protocol.<n>We show that the presence or absence of information leakage is determined by the solution set of a system of congruences.<n>Our results extend the parity-based classification known for qubits to arbitrary finite dimensions.
  arXiv  Detail & Related papers  (2026-05-12T07:04:10Z)
• 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)
• Encrypted Qubits can be Cloned [0.0]
  We show that encrypted cloning of unknown quantum states is possible.<n>A possible application of encrypted cloning is to enable encrypted quantum multi-cloud storage.
  arXiv  Detail & Related papers  (2025-01-06T04:38:59Z)
• 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)
• Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
  We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC) We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
  arXiv  Detail & Related papers  (2024-02-13T12:12:39Z)
• 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)
• RiDDLE: Reversible and Diversified De-identification with Latent Encryptor [57.66174700276893]
  This work presents RiDDLE, short for Reversible and Diversified De-identification with Latent Encryptor. Built upon a pre-learned StyleGAN2 generator, RiDDLE manages to encrypt and decrypt the facial identity within the latent space.
  arXiv  Detail & Related papers  (2023-03-09T11:03:52Z)
• 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)

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.