Encrypted Qubits can be Cloned

• URL: http://arxiv.org/abs/2501.02757v1
• Date: Mon, 06 Jan 2025 04:38:59 GMT
• Title: Encrypted Qubits can be Cloned
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We show that encrypted cloning of unknown quantum states is possible. Any number of encrypted clones of a qubit can be created through a unitary transformation, and each of the encrypted clones can be decrypted through a unitary transformation. The decryption of an encrypted clone consumes the decryption key, i.e., only one decryption is possible, in agreement with the no-cloning theorem. A possible application of encrypted cloning is to enable encrypted quantum multi-cloud storage. Beyond applications in cryptography, encrypted cloning could provide a form of redundancy, parallelism, fault tolerance or scalability where direct duplication is forbidden by the no-cloning theorem.

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)
• A Note on Boosting Uncloneable Encryption in Microcrypt [6.5415730240023136]
  Many-time secure uncloneable encryption may follow from concrete assumptions in "microcrypt"<n>We show that many-time secure uncloneable encryption may follow from concrete assumptions in "microcrypt"
  arXiv  Detail & Related papers  (2026-05-26T20:09:21Z)
• 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)
• 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)
• Anamorphic Cryptography using Baby-Step Giant-Step Recovery [0.46040036610482665]
  This paper outlines the implementation of Anamorphic Cryptography using ECC (Elliptic Curve Cryptography)<n>It outlines how the secret message sent to Alice is hidden within the random nonce value, which is used within the encryption process.<n>It also shows that the BSGS (Baby-step Giant-step) variant significantly outperforms unoptimised elliptic curve methods.
  arXiv  Detail & Related papers  (2025-04-21T12:53:32Z)
• Universal quantum homomorphic encryption based on $(k, n)$-threshold quantum state sharing [0.26217304977339473]
  homomorphic encryption integrates quantum computing with homomorphic encryption. We propose a $(k, n)$-threshold universal quantum homomorphic encryption scheme based on quantum state sharing.
  arXiv  Detail & Related papers  (2025-02-26T06:56:25Z)
• 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)
• Exact Homomorphic Encryption [0.0]
  This article proposes a framework dubbed Exact Homomorphic Encryption, EHE, enabling exact computations on encrypted data without the need for pre-decryption. Two fundamental traits of quantum gates, invertibility and the noncommutativity, establish the success of EHE.
  arXiv  Detail & Related papers  (2024-01-17T07:48: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)
• 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)
• Device-independent uncloneable encryption [0.0]
  We introduce a variant of uncloneable encryption in which several possible decryption keys can decrypt a particular encryption.<n>We show that this variant of uncloneable encryption can be achieved device-independently.<n>We show that a simple modification of our scheme yields a single-decryptor encryption scheme.
  arXiv  Detail & Related papers  (2022-10-03T16:17:01Z)
• Uncloneable Decryptors from Quantum Copy-Protection [0.38073142980733]
  We show that CPA secure uncloneable bit decryptors could be instantiated from a copy protection scheme. We then show how to strengthen the CPA security of uncloneable decryptors to CCA2 security using strong EUF-CMA secure digital signatures.
  arXiv  Detail & Related papers  (2022-03-11T11:47:04Z)
• 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.