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

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Zhang, Haoyun, Lei, Yu-Ting, Pan, Xing-bo
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866929732360077312
author Zhang, Haoyun
Lei, Yu-Ting
Pan, Xing-bo
author_facet Zhang, Haoyun
Lei, Yu-Ting
Pan, Xing-bo
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2502_18880
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Universal quantum homomorphic encryption based on $(k, n)$-threshold quantum state sharing
Zhang, Haoyun
Lei, Yu-Ting
Pan, Xing-bo
Quantum Physics
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.
title Universal quantum homomorphic encryption based on $(k, n)$-threshold quantum state sharing
topic Quantum Physics
url https://arxiv.org/abs/2502.18880