.png){kind=icon}
.png){kind=icon}
Return
Verifiable Quantum Homomorphic Encryption
.png){kind=icon}
PRE
AI
DOI：10.1109/JSAC.2025.3568057.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Quantum homomorphic encryption (QHE) can allow clients to directly perform quantum computation on encrypted data with the assistance of a remote quantum server. However, existing QHE schemes often overlook the crucial property of verifiability which enables clients to validate the correctness of computation results provided by the server. In this paper, we propose a verifiable QHE scheme based on the universal quantum gate set $\left \{{{ \mathrm {H}, \mathrm {P}, \mathrm {Toffoli} }}\right \}$ . At first, a specialized gadget is designed to eliminate the errors that may arise during the homomorphic evaluation of non-Clifford Toffoli gates in a non-interactive manner. Furthermore, the designed gadget is versatile and can be seamlessly integrated into an existing QHE scheme that implements quantum gates in another universal quantum gate set $\left \{{{ \mathrm {H}, \mathrm {T}, \mathrm {CNOT}}}\right \}$ to homomorphically evaluate more quantum gates. Subsequently, a verifiable method is introduced to the QHE scheme based on $\left \{{{ \mathrm {H}, \mathrm {P}, \mathrm {Toffoli} }}\right \}$ for the client to detect whether the server is honest during the homomorphic computation by employing three types of indistinguishable quantum circuits.
Keywords:
Quantum homomorphic encryption
verifiable method
quantum cryptography
Journal
IF:
17.2
Papers:
6.4K
Citations:
3.1W