Related papers: A Note on Boosting Uncloneable Encryption in Microcrypt

A Note on Boosting Uncloneable Encryption in Microcrypt

URL: http://arxiv.org/abs/2605.27647v1
Date: Tue, 26 May 2026 20:09:21 GMT
Title: A Note on Boosting Uncloneable Encryption in Microcrypt
Abstract summary: 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"
Score: 6.5415730240023136
License: http://creativecommons.org/licenses/by/4.0/
Abstract: In this note, we consider the setting of uncloneable encryption satisfying uncloneable indistinguishability, a form of symmetric key encryption that prevents the cloning of ciphertexts in a very strong sense. Our goal is to minimize the assumptions under which (many-time secure) uncloneable encryption is known to exist, assuming the existence of an information-theoretic "uncloneable bit", i.e. a one-time secure uncloneable encryption scheme for one-bit messages. We observe that if a t -> t' uncloneable bit exists, then the following implications hold. 1. If many-time secure symmetric key encryption exists, then many-time secure t -> t' uncloneable encryption for arbitrary-length messages exists. Since many-time secure uncloneable encryption implies many-time secure symmetric key encryption, this result is tight. 2. If pseudorandom unitaries exist, then many-time secure t -> t' uncloneable encryption for arbitrary-length messages with identical copy security exists. These results together show that many-time secure uncloneable encryption may follow from concrete assumptions in "microcrypt", the world of unstructured quantum cryptography that plausibly exists even if P = NP.

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)
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)
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)
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)
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)
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)
Entropically secure encryption with faster key expansion [2.355458445741348]
We introduce a new key expansion method that is faster than existing ones. Speed gain is most notable when the key length is a sizeable fraction of the message length.
arXiv Detail & Related papers (2022-01-01T13:29:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.