Quantum Key Leasing for PKE and FHE with a Classical Lessor

• URL: http://arxiv.org/abs/2310.14328v4
• Date: Wed, 6 Mar 2024 01:57:02 GMT
• Title: Quantum Key Leasing for PKE and FHE with a Classical Lessor
• Authors: Orestis Chardouvelis, Vipul Goyal, Aayush Jain, Jiahui Liu
• Abstract summary: We consider the problem of secure key leasing, also known as revocable cryptography. This problem aims to leverage unclonable nature of quantum information. We construct a secure key leasing scheme to lease a decryption key of a (classical) public-key, homomorphic encryption scheme.
• Score: 19.148581164364387
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this work, we consider the problem of secure key leasing, also known as revocable cryptography (Agarwal et. al. Eurocrypt' 23, Ananth et. al. TCC' 23), as a strengthened security notion of its predecessor put forward in Ananth et. al. Eurocrypt' 21. This problem aims to leverage unclonable nature of quantum information to allow a lessor to lease a quantum key with reusability for evaluating a classical functionality. Later, the lessor can request the lessee to provably delete the key and then the lessee will be completely deprived of the capability to evaluate. In this work, we construct a secure key leasing scheme to lease a decryption key of a (classical) public-key, homomorphic encryption scheme from standard lattice assumptions. We achieve strong form of security where: * The entire protocol uses only classical communication between a classical lessor (client) and a quantum lessee (server). * Assuming standard assumptions, our security definition ensures that every computationally bounded quantum adversary could not simultaneously provide a valid classical deletion certificate and yet distinguish ciphertexts. Our security relies on the hardness of learning with errors assumption. Our scheme is the first scheme to be based on a standard assumption and satisfying the two properties above.

Related papers

• (Quantum) Indifferentiability and Pre-Computation [50.06591179629447]
  Indifferentiability is a cryptographic paradigm for analyzing the security of ideal objects. Despite its strength, indifferentiability is not known to offer security against pre-processing attacks. We propose a strengthening of indifferentiability which is not only composable but also takes arbitrary pre-computation into account.
  arXiv  Detail & Related papers  (2024-10-22T00:41:47Z)
• A Simple Framework for Secure Key Leasing [10.04587045407742]
  Key-revocable cryptography enables us to lease a cryptographic key as a quantum state in such a way that the key can be later revoked in a verifiable manner. We propose a simple framework for constructing cryptographic primitives with secure key leasing via the certified deletion property of BB84 states.
  arXiv  Detail & Related papers  (2024-10-04T13:24:03Z)
• Towards the Impossibility of Quantum Public Key Encryption with Classical Keys from One-Way Functions [0.5999777817331317]
  It has been recently shown that public-key encryption (PKE) from one-way functions (OWF) is possible if we consider quantum public keys. In this paper, we focus on black-box separation for PKE with classical public key and quantum ciphertext from OWF.
  arXiv  Detail & Related papers  (2023-11-06T20:41:25Z)
• Hierarchical certification of nonclassical network correlations [50.32788626697182]
  We derive linear and nonlinear Bell-like inequalities for networks, whose violation certifies the absence of a minimum number of classical sources in them. We insert this assumption, which leads to results more amenable to certification in experiments.
  arXiv  Detail & Related papers  (2023-06-27T18:00:01Z)
• Robust Quantum Public-Key Encryption with Applications to Quantum Key Distribution [16.06159998475861]
  Quantum key distribution (QKD) allows Alice and Bob to agree on a shared secret key, while communicating over a public (untrusted) quantum channel. It has two main advantages: (i) The key is unconditionally hidden to the eyes of any attacker, and (ii) its security assumes only the existence of authenticated classical channels. We propose a two-message QKD protocol that satisfies everlasting security, assuming only the existence of quantum-secure one-way functions.
  arXiv  Detail & Related papers  (2023-04-06T11:14:55Z)
• Quantum Public-Key Encryption with Tamper-Resilient Public Keys from One-Way Functions [12.45203887838637]
  We construct quantum public-key encryption from one-way functions. In our construction, public keys are quantum, but ciphertexts are classical.
  arXiv  Detail & Related papers  (2023-04-04T13:57:17Z)
• 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)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• Commitment capacity of classical-quantum channels [70.51146080031752]
  We define various notions of commitment capacity for classical-quantum channels. We prove matching upper and lower bound on it in terms of the conditional entropy.
  arXiv  Detail & Related papers  (2022-01-17T10:41:50Z)
• Quantum Encryption with Certified Deletion, Revisited: Public Key, Attribute-Based, and Classical Communication [10.973034520723957]
  Broadbent and Islam proposed a quantum cryptographic primitive called quantum encryption with certified deletion. In this primitive, a receiver in possession of a quantum ciphertext can generate a classical certificate that the encrypted message is deleted. Although deletion certificates are privately verifiable, which means a verification key for a certificate has to be kept secret, in the definition by Broadbent and Islam, we can also consider public verifiability.
  arXiv  Detail & Related papers  (2021-05-12T01:41:46Z)
• Backflash Light as a Security Vulnerability in Quantum Key Distribution Systems [77.34726150561087]
  We review the security vulnerabilities of quantum key distribution (QKD) systems. We mainly focus on a particular effect known as backflash light, which can be a source of eavesdropping attacks.
  arXiv  Detail & Related papers  (2020-03-23T18:23:12Z)

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.