Universal quantum homomorphic encryption based on $(k, n)$-threshold quantum state sharing

• URL: http://arxiv.org/abs/2502.18880v1
• Date: Wed, 26 Feb 2025 06:56:25 GMT
• Title: Universal quantum homomorphic encryption based on $(k, n)$-threshold quantum state sharing
• Authors: Haoyun Zhang, Yu-Ting Lei, Xing-bo Pan,
• Abstract summary: homomorphic encryption integrates quantum computing with homomorphic encryption.<n>We propose a $(k, n)$-threshold universal quantum homomorphic encryption scheme based on quantum state sharing.
• Score: 0.26217304977339473
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum homomorphic encryption integrates quantum computing with homomorphic encryption, which allows calculations to be performed directly on encrypted data without decryption on the server side. In this paper, we explore distributed quantum homomorphic encryption, focusing on the coordination of multiple evaluators to achieve evaluation tasks, which not only ensures security but also boosts computational power. Notably, we propose a $(k, n)$-threshold universal quantum homomorphic encryption scheme based on quantum state sharing. Each server is capable of executing a universal gate set, including the Clifford gates $\{X,Y,Z,H,S,CNOT\}$ and a non-Clifford T gate. The scheme provides that k evaluation servers chosen from $n$ $(0 < k \leq n)$ cooperate to complete the quantum homomorphic encryption so that the client can get the evaluated plaintext after decryption. Several concrete examples are presented to provide clarity to our solution. We also include security analysis, demonstrating its security against eavesdroppers.

Related papers

• Efficient Quantum-Safe Homomorphic Encryption for Quantum Computer Programs [0.0]
  homomorphic encryption is lifted to the quantum setting by replacing composite-order groups with Module Learning-Errors (MLWE) lattices. We formalize security with the qIND-CPA game that allows coherent access to the encryption oracle. Performance analysis shows that the extra lattice arithmetic fits inside today's QPU idle windows.
  arXiv  Detail & Related papers  (2025-04-30T00:08:43Z)
• Homomorphic Encryption Based on Lattice Post-Quantum Cryptography [0.0]
  Homomorphic encryption methods are vulnerable to quantum computing attacks. This study proposes a lattice-based post-quantum homomorphic encryption scheme. The findings are intended to serve as a reference for developers of homomorphic encryption applications.
  arXiv  Detail & Related papers  (2024-12-23T05:30:44Z)
• 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)
• 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)
• Publicly-Verifiable Deletion via Target-Collapsing Functions [81.13800728941818]
  We show that targetcollapsing enables publiclyverifiable deletion (PVD) We build on this framework to obtain a variety of primitives supporting publiclyverifiable deletion from weak cryptographic assumptions.
  arXiv  Detail & Related papers  (2023-03-15T15:00:20Z)
• 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)
• Delegated variational quantum algorithms based on quantum homomorphic encryption [69.50567607858659]
  Variational quantum algorithms (VQAs) are one of the most promising candidates for achieving quantum advantages on quantum devices. The private data of clients may be leaked to quantum servers in such a quantum cloud model. A novel quantum homomorphic encryption (QHE) scheme is constructed for quantum servers to calculate encrypted data.
  arXiv  Detail & Related papers  (2023-01-25T07:00:13Z)
• 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)
• 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)
• Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [48.94443749859216]
  We introduce a quantum copy-protection scheme for a class of evasive functions known as " compute-and-compare programs" We prove that our scheme achieves non-trivial security against fully malicious adversaries in the quantum random oracle model (QROM) As a complementary result, we show that the same scheme fulfils a weaker notion of software protection, called "secure software leasing"
  arXiv  Detail & Related papers  (2020-09-29T08:41:53Z)
• Classical Homomorphic Encryption for Quantum Circuits [2.1756081703276]
  We present the first leveled fully homomorphic encryption scheme for quantum circuits with classical keys. We show that it is possible to construct such a scheme directly from a quantum secure classical homomorphic encryption scheme with certain properties.
  arXiv  Detail & Related papers  (2017-08-07T14:27:06Z)

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.