Unconditional Unclonable Encryption

• URL: http://arxiv.org/abs/2607.21551v1
• Date: Thu, 23 Jul 2026 17:35:44 GMT
• Title: Unconditional Unclonable Encryption
• Abstract summary: We give an unconditional construction of information-theoretically secure one-time private-key unclonable encryption scheme for one-bit messages.<n>With efficient encryption and decryption and exponentially small unclonable-indistinguishability advantage.
• Score: 9.944034040709449
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We give an unconditional construction of information-theoretically secure one-time private-key unclonable encryption scheme for one-bit messages, with efficient encryption and decryption and exponentially small unclonable-indistinguishability advantage.

Related papers

• Statistically secure uncloneable encryption of arbitrary messages [0.5352699766206808]
  We show that a single bit encryption scheme can be upgraded to achieve unconditional uncloneable encryption for messages of arbitrary length.<n>This establishes that one-time uncloneable encryption of arbitrary messages enjoys statistical security.
  arXiv  Detail & Related papers  (2026-07-30T17:27:40Z)
• 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)
• The uncloneable bit exists [0.5352699766206808]
  We establish quantum uncloneable encryption with unconditional security.<n>We prevent two non-communicating adversaries from simultaneously decrypting a single ciphertext $-$ even when both are given the key.
  arXiv  Detail & Related papers  (2026-03-09T20:33:33Z)
• 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.<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)
• CodeChameleon: Personalized Encryption Framework for Jailbreaking Large Language Models [49.60006012946767]
  We propose CodeChameleon, a novel jailbreak framework based on personalized encryption tactics. We conduct extensive experiments on 7 Large Language Models, achieving state-of-the-art average Attack Success Rate (ASR) Remarkably, our method achieves an 86.6% ASR on GPT-4-1106.
  arXiv  Detail & Related papers  (2024-02-26T16:35:59Z)
• 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)
• 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)
• On the Feasibility of Unclonable Encryption, and More [16.64327673223307]
  We show that encryption schemes satisfying unclonable indistinguishability exist unconditionally in the quantum random oracle model. We also establish the feasibility of copy-protection for single-bit output point functions.
  arXiv  Detail & Related papers  (2022-07-14T01:03:56Z)

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.