Unclonable Encryption with Continuous Variables

• URL: http://arxiv.org/abs/2503.02648v1
• Date: Tue, 04 Mar 2025 14:10:15 GMT
• Title: Unclonable Encryption with Continuous Variables
• Authors: Arpan Akash Ray, Boris Škorić,
• Abstract summary: We propose the first continuous-variable (CV) unclonable encryption scheme.<n>In our construction, a classical message is first classically encoded and then encoded using an error-correcting code.<n>We prove unclonability in the framework introduced by Broadbent and Lord, via a reduction of the cloning game to a CV monogamy-of-entanglement game.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose the first continuous-variable (CV) unclonable encryption scheme, extending the paradigm of quantum encryption of classical messages (QECM) to CV systems. In our construction, a classical message is first encrypted classically and then encoded using an error-correcting code. Each bit of the codeword is mapped to a CV mode by creating a coherent state which is squeezed in the $q$ or $p$ quadrature direction, with a small displacement that encodes the bit. The squeezing directions are part of the encryption key. We prove unclonability in the framework introduced by Broadbent and Lord, via a reduction of the cloning game to a CV monogamy-of-entanglement game.

Related papers

• Post-Quantum Homomorphic Encryption: A Case for Code-Based Alternatives [0.6749750044497732]
  Homomorphic Encryption (HE) allows secure and privacy-protected computation on encrypted data without the need to decrypt it. Most of the current PQHE algorithms are secured by lattice-based problems. Code-based encryption is a novel way to diversify post-quantum algorithms.
  arXiv  Detail & Related papers  (2025-03-28T06:49:22Z)
• Secure Semantic Communication With Homomorphic Encryption [52.5344514499035]
  This paper explores the feasibility of applying homomorphic encryption to SemCom.<n>We propose a task-oriented SemCom scheme secured through homomorphic encryption.
  arXiv  Detail & Related papers  (2025-01-17T13:26:14Z)
• 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)
• 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)
• Towards Unclonable Cryptography in the Plain Model [0.6827423171182154]
  Two most notable examples of unclonable cryptography are copy-protection (CP) and unclonable encryption (UE) A core ingredient of these protocols is the so-called monogamy-of-entanglement (MoE) property. We present two conjectures that would allow first to show that CP of point functions exists in the plain model, with different challenge distributions, and then that UE with unclonable indistinguishability security exists in the plain model.
  arXiv  Detail & Related papers  (2023-11-28T10:25:22Z)
• 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)
• Cloning Games: A General Framework for Unclonable Primitives [8.140799273465545]
  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.
  arXiv  Detail & Related papers  (2023-02-03T17:24:38Z)
• 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)
• Qubit-based Unclonable Encryption with Key Recycling [2.355458445741348]
  We re-visit Gottesman's Unclonable Encryption as introduced by Gottesman in 2003. We introduce a qubit-based prepare-and-measure Unclonable Encryption scheme with re-usable keys. We provide a security proof based on the diamond norm distance, taking noise into account.
  arXiv  Detail & Related papers  (2020-04-08T16:08:14Z)
• Classical Homomorphic Encryption for Quantum Circuits [2.1756081703276]
  We present the first leveled fully homomorphic encryption scheme for quantum circuits with classical keys. We show that it is possible to construct such a scheme directly from a quantum secure classical homomorphic encryption scheme with certain properties.
  arXiv  Detail & Related papers  (2017-08-07T14:27:06Z)

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.