Statistically secure uncloneable encryption of arbitrary messages

• URL: http://arxiv.org/abs/2607.28561v1
• Date: Thu, 30 Jul 2026 17:27:40 GMT
• Title: Statistically secure uncloneable encryption of arbitrary messages
• Abstract summary: 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.
• Score: 0.5352699766206808
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Unconditional uncloneable encryption of a single bit with efficient encryption and decryption is now possible. However, whether the extension to messages of arbitrary length achieves statistical security remains to be known. Using the fact that the encoding bases for the single-bit scheme known to be secure consist of a subset of the Clifford unitaries, we show that this scheme can be upgraded to achieve unconditional uncloneable encryption for messages of arbitrary length, with encoding time polynomial in the message length and security parameter. This establishes that one-time uncloneable encryption of arbitrary messages enjoys statistical security.

Related papers

• Unconditional Unclonable Encryption [9.944034040709449]
  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.
  arXiv  Detail & Related papers  (2026-07-23T17:35: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)
• Secure Text Mail Encryption with Generative Adversarial Networks [0.0]
  We present an encryption model based on Generative Adversarial Networks (GANs)<n>We assert that encrypted texts can be transmitted more efficiently and securely than from RSA encryption.
  arXiv  Detail & Related papers  (2025-04-08T07:27:57Z)
• CipherGuard: Compiler-aided Mitigation against Ciphertext Side-channel Attacks [26.849878609957386]
  CipherGuard is a compiler-based mitigation tool to counteract ciphertext side channels with high efficiency and security guarantees.<n>In its most efficient strategy, CipherGuard incurs an average performance overhead of only 1.41X, with a maximum of 1.95X.
  arXiv  Detail & Related papers  (2025-02-19T03:22:36Z)
• 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)
• GPT-4 Is Too Smart To Be Safe: Stealthy Chat with LLMs via Cipher [85.18213923151717]
  Experimental results show certain ciphers succeed almost 100% of the time to bypass the safety alignment of GPT-4 in several safety domains. We propose a novel SelfCipher that uses only role play and several demonstrations in natural language to evoke this capability.
  arXiv  Detail & Related papers  (2023-08-12T04:05:57Z)
• 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)

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.