Verifiable quantum homomorphic encryption based on garbled evaluation

Abstract Quantum homomorphic encryption (QHE) can allow directly computation on the encrypted data without need to decrypt it in advance. It is also necessary to provide another property of verifiability that the client should verify whether the evaluation result is correct. However, most existing QHE schemes did not consider it and only assumed servers to be honest. In this paper, we propose a verifiable QHE (vQHE) scheme by using different types of circuits indistinguishable to the server, where the client can detect whether the server is honest or not by verifying the results of test circuits. Furthermore, by designing the gadgets to implement and test T gates and H gates in a non-interactive way for the used circuits, the proposed vQHE scheme does not require interaction during the process of evaluation. Thus the proposed vQHE scheme has the potential to make clients prefer to use it for protecting their private data in future quantum cloud environments.

Authors

Institutions

Publication Details

Journal
Quantum Science and Technology
Published
2024-09-13
DOI
https://doi.org/10.1088/2058-9565/ad7a9c
Citations
4
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
1.39

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Verifiable quantum homomorphic encryption based on garbled evaluation

Chen Lv, Xiaoqing Tan, Qin Li, Renke He et al.
4 citations
Quantum Science and Technology
Cryptography and Data Security
1.39
article

Verifiable quantum homomorphic encryption based on garbled evaluation

Chen Lv, Xiaoqing Tan, Qin Li, Renke He, Lingli Chen
article en
4 citations

Abstract

Abstract Quantum homomorphic encryption (QHE) can allow directly computation on the encrypted data without need to decrypt it in advance. It is also necessary to provide another property of verifiability that the client should verify whether the evaluation result is correct. However, most existing QHE schemes did not consider it and only assumed servers to be honest. In this paper, we propose a verifiable QHE (vQHE) scheme by using different types of circuits indistinguishable to the server, where the client can detect whether the server is honest or not by verifying the results of test circuits. Furthermore, by designing the gadgets to implement and test T gates and H gates in a non-interactive way for the used circuits, the proposed vQHE scheme does not require interaction during the process of evaluation. Thus the proposed vQHE scheme has the potential to make clients prefer to use it for protecting their private data in future quantum cloud environments.

Quantum Science and TechnologyVol. 9(4)
Jinan University (CN), Xiangtan University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 16%
Cryptography and Data Security
1.39
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Verifiable quantum homomorphic encryption based on garbled evaluation — Chen Lv, Xiaoqing Tan, et al. · Quantum Science and Technology (2024) | TGRS Research Map | TGRS