Uncloneable Decryptors from Quantum Copy-Protection
- URL: http://arxiv.org/abs/2203.05866v2
- Date: Tue, 15 Mar 2022 10:27:55 GMT
- Title: Uncloneable Decryptors from Quantum Copy-Protection
- Authors: Or Sattath and Shai Wyborski
- Abstract summary: 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.
- Score: 0.38073142980733
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Uncloneable decryptors are encryption schemes (with classical plaintexts and
ciphertexts) with the added functionality of deriving uncloneable quantum
states, called decryptors, which could be used to decrypt ciphers without
knowledge of the secret key (Georgiou and Zhandry, IACR'20). We study
uncloneable decryptors in the computational setting and provide increasingly
strong security notions which extend the various indistinguishable security
notions of symmetric encryption.
We show that CPA secure uncloneable bit decryptors could be instantiated from
a copy protection scheme (Aaronson, CCC'09) for any balanced binary function.
We introduce a new notion of flip detection security for copy protection
schemes inspired by the notions of left or right security for encryption
schemes, and show that it could be used to instantiate CPA secure uncloneable
decryptors for messages of unrestricted length.
We then show how to strengthen the CPA security of uncloneable decryptors to
CCA2 security using strong EUF-CMA secure digital signatures. We show that our
constructions could be instantiated relative to either the quantum oracle used
in [Aar09] or the classical oracle used in (Aaronson et al., CRYPTO'21) to
instantiate copy protection schemes. Our constructions are the first to achieve
CPA or CCA2 security in the symmetric setting.
Related papers
- CipherGuard: Compiler-aided Mitigation against Ciphertext Side-channel Attacks [30.992038220253797]
CipherGuard is a compiler-aided mitigation methodology to counteract ciphertext side channels with high efficiency and security.
We demonstrate that CipherGuard can strengthen the security of various cryptographic implementations more efficiently than existing state-of-the-art defense mechanism, i.e., CipherFix.
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.
We propose a task-oriented SemCom scheme secured through homomorphic encryption.
arXiv Detail & Related papers (2025-01-17T13:26:14Z) - Secure Composition of Quantum Key Distribution and Symmetric Key Encryption [3.6678562499684517]
Quantum key distribution (QKD) allows Alice and Bob to share a secret key over an insecure channel with proven information-theoretic security against an adversary whose strategy is bounded only by the laws of physics.
We consider the problem of using the QKD established key with a secure symmetric key-based encryption algorithm and use an approach based on hybrid encryption to provide a proof of security for the composition.
arXiv Detail & Related papers (2025-01-14T20:58:02Z) - Privacy-preserving server-supported decryption [2.2530496464901106]
We consider encryption systems with two-out-of-two threshold decryption, where one of the parties initiates the decryption and the other one assists.
Existing threshold decryption schemes disclose to the server the ciphertext that is being decrypted.
We give a construction, where the identity of the ciphertext is not leaked to the server, and the client's privacy is preserved.
arXiv Detail & Related papers (2024-10-25T06:47:53Z) - 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) - 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) - SOCI^+: An Enhanced Toolkit for Secure OutsourcedComputation on Integers [50.608828039206365]
We propose SOCI+ which significantly improves the performance of SOCI.
SOCI+ employs a novel (2, 2)-threshold Paillier cryptosystem with fast encryption and decryption as its cryptographic primitive.
Compared with SOCI, our experimental evaluation shows that SOCI+ is up to 5.4 times more efficient in computation and 40% less in communication overhead.
arXiv Detail & Related papers (2023-09-27T05:19:32Z) - 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.
We show that this variant of uncloneable encryption can be achieved device-independently.
We show that a simple modification of our scheme yields a single-decryptor encryption scheme.
arXiv Detail & Related papers (2022-10-03T16:17:01Z)
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.