Quantum Public-Key Encryption with Tamper-Resilient Public Keys from One-Way Functions

• URL: http://arxiv.org/abs/2304.01800v4
• Date: Thu, 23 May 2024 23:42:01 GMT
• Title: Quantum Public-Key Encryption with Tamper-Resilient Public Keys from One-Way Functions
• Authors: Fuyuki Kitagawa, Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa,
• Abstract summary: We construct quantum public-key encryption from one-way functions. In our construction, public keys are quantum, but ciphertexts are classical.
• Score: 12.45203887838637
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We construct quantum public-key encryption from one-way functions. In our construction, public keys are quantum, but ciphertexts are classical. Quantum public-key encryption from one-way functions (or weaker primitives such as pseudorandom function-like states) are also proposed in some recent works [Morimae-Yamakawa, eprint:2022/1336; Coladangelo, eprint:2023/282; Barooti-Grilo-Malavolta-Sattath-Vu-Walter, eprint:2023/877]. However, they have a huge drawback: they are secure only when quantum public keys can be transmitted to the sender (who runs the encryption algorithm) without being tampered with by the adversary, which seems to require unsatisfactory physical setup assumptions such as secure quantum channels. Our construction is free from such a drawback: it guarantees the secrecy of the encrypted messages even if we assume only unauthenticated quantum channels. Thus, the encryption is done with adversarially tampered quantum public keys. Our construction is the first quantum public-key encryption that achieves the goal of classical public-key encryption, namely, to establish secure communication over insecure channels, based only on one-way functions. Moreover, we show a generic compiler to upgrade security against chosen plaintext attacks (CPA security) into security against chosen ciphertext attacks (CCA security) only using one-way functions. As a result, we obtain CCA secure quantum public-key encryption based only on one-way functions.

Related papers

• 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. 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)
• Unclonable Functional Encryption [1.1510009152620668]
  We introduce unclonable quantum functional encryption (UFE), which both extends the notion of FE quantum setting and also possesses the unclonable security of UE. We give a construction for UFE that supports arbitrary quantum messages and achieves unclonable-indistinguishable security for independently sampled function keys.
  arXiv  Detail & Related papers  (2024-10-08T13:30:20Z)
• Public-Key Encryption with Quantum Keys [11.069434965621683]
  We study the notion of quantum public-key encryption (qPKE) where keys are allowed to be quantum states. We show that computational assumptions are necessary to build quantum public-key encryption.
  arXiv  Detail & Related papers  (2023-06-13T11:32:28Z)
• 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)
• A Simple Construction of Quantum Public-Key Encryption from Quantum-Secure One-Way Functions [13.677574076242188]
  We show that quantum PKE can be constructed from any quantum-secure one-way function. Our construction is simple, uses only classical ciphertexts, and satisfies the strong notion of CCA security.
  arXiv  Detail & Related papers  (2023-03-02T10:45:16Z)
• 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)
• An Evolutionary Pathway for the Quantum Internet Relying on Secure Classical Repeaters [64.48099252278821]
  We conceive quantum networks using secure classical repeaters combined with the quantum secure direct communication principle. In these networks, the ciphertext gleaned from a quantum-resistant algorithm is transmitted using QSDC along the nodes. We have presented the first experimental demonstration of a secure classical repeater based hybrid quantum network.
  arXiv  Detail & Related papers  (2022-02-08T03:24:06Z)
• A practical quantum encryption protocol with varying encryption configurations [0.0]
  We propose a quantum encryption protocol that utilizes a quantum algorithm to create blocks oftext ciphers based on quantum states. The main feature of our quantum encryption protocol is that the encryption configuration of each block is determined by the previous blocks.
  arXiv  Detail & Related papers  (2021-01-22T20:09:03Z)
• Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security [67.06003361150228]
  A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task. In this work, we examine the hardness of finding such chain of PoWs against quantum strategies. We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
  arXiv  Detail & Related papers  (2020-12-30T18:03:56Z)
• Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network with Free One-Way Public Communication [56.678354403278206]
  We propose a canonical method to derive a secure quantum network code over a multiple unicast quantum network. Our code correctly transmits quantum states when there is no attack. It also guarantees the secrecy of the transmitted quantum state even with the existence of an attack.
  arXiv  Detail & Related papers  (2020-03-30T09:25:13Z)
• 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.