Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Designs Codes and Cryptography

Efficient quantum homomorphic encryption scheme with flexible evaluators and its simulation

Jiang Liu, Qin Li, Junyu Quan, Can Wang, Jinjing Shi, Haozhen Situ

Published Jan 8, 2022• 24 citations
Publisher
DOI
10.1007/s10623-021-00993-2

Related papers

Quantum homomorphic encryption scheme with flexible number of evaluator based on (k, n)-threshold quantum state sharing

Xiu‐Bo Chen, Yiru Sun, Gang Xu +1 more

Information Sciences•Jun 6, 2019•52 citations

A flexible multi-party quantum homomorphic encryption scheme based on graph states

Zhao Zhang, Qin-Han Zhang, Shaocong Wang +1 more

Chinese Journal of Physics•Jul 9, 2026•0 citations

A quantum approach to homomorphic encryption

Tan, S.H., Kettlewell, J.A., Ouyang, Y. +2 more

•Sep 23, 2016•56 citations

Flexible Threshold Quantum Homomorphic Encryption on Quantum Networks

Yongli Tang, Menghao Guo, Binyong Li +3 more

Currently, most quantum homomorphic encryption (QHE) schemes only allow a single evaluator (server) to accomplish computation tasks on encrypted data shared by the data owner (user). In addition, the quantum computing capability of the evaluator and the scope of quantum computation it can perform are usually somewhat limited, which significantly reduces the flexibility of the scheme in quantum network environments. In this paper, we propose a novel (t,n)-threshold QHE (TQHE) network scheme based on the Shamir secret sharing protocol, which allows k(t≤k≤n) evaluators to collaboratively perform evaluation computation operations on each qubit within the shared encrypted sequence. Moreover, each evaluator, while possessing the ability to perform all single-qubit unitary operations, is able to perform arbitrary single-qubit gate computation task assigned by the data owner. We give a specific (3, 5)-threshold example, illustrating the scheme's correctness and feasibility, and simulate it on IBM quantum computing cloud platform. Finally, it is shown that the scheme is secure by analyzing encryption/decryption private keys, ciphertext quantum state sequences during transmission, plaintext quantum state sequence, and the result after computations on the plaintext quantum state sequence.

Entropy•Dec 26, 2024•3 citations

Implementing the Grover algorithm in homomorphic encryption schemes

Pablo Fernández, Miguel Angel Martin-Delgado

We apply quantum homomorphic encryption (QHE) schemes suitable for circuits with a polynomial number of T + T † gates to Grover's algorithm, performing a simulation in Qiskit of a Grover circuit that contains three qubits. The T + T † -gate complexity of Grover's algorithm is also analyzed in order to show that any Grover circuit can be evaluated homomorphically in an efficient manner. We discuss how to apply these QHE schemes to allow for the efficient homomorphic evaluation of any Grover circuit composed of n qubits using n − 2 extra ancilla qubits. We also show how the homomorphic evaluation of the special case where there is only one marked item can be implemented using an algorithm that makes the decryption process more efficient compared with the standard Grover algorithm. Published by the American Physical Society 2024

arXiv:2403.04922•Physical Review Research•Nov 6, 2024•13 citations

Efficient quantum fully homomorphic encryption scheme based on the quantum circuit

Zhenzhen Li, Ming-Kui Liu, Jun Xu +2 more

Quantum Information Processing•Jun 9, 2026•0 citations
Currently, most quantum homomorphic encryption (QHE) schemes only allow a single evaluator (server) to accomplish computation tasks on encrypted data shared by the data owner (user). In addition, the quantum computing capability of the evaluator and the scope of quantum computation it can perform are usually somewhat limited, which significantly reduces the flexibility of the scheme in quantum network environments. In this paper, we propose a novel (t,n)-threshold QHE (TQHE) network scheme based on the Shamir secret sharing protocol, which allows k(t≤k≤n) evaluators to collaboratively perform evaluation computation operations on each qubit within the shared encrypted sequence. Moreover, each evaluator, while possessing the ability to perform all single-qubit unitary operations, is able to perform arbitrary single-qubit gate computation task assigned by the data owner. We give a specific (3, 5)-threshold example, illustrating the scheme's correctness and feasibility, and simulate it on IBM quantum computing cloud platform. Finally, it is shown that the scheme is secure by analyzing encryption/decryption private keys, ciphertext quantum state sequences during transmission, plaintext quantum state sequence, and the result after computations on the plaintext quantum state sequence.
We apply quantum homomorphic encryption (QHE) schemes suitable for circuits with a polynomial number of T + T † gates to Grover's algorithm, performing a simulation in Qiskit of a Grover circuit that contains three qubits. The T + T † -gate complexity of Grover's algorithm is also analyzed in order to show that any Grover circuit can be evaluated homomorphically in an efficient manner. We discuss how to apply these QHE schemes to allow for the efficient homomorphic evaluation of any Grover circuit composed of n qubits using n − 2 extra ancilla qubits. We also show how the homomorphic evaluation of the special case where there is only one marked item can be implemented using an algorithm that makes the decryption process more efficient compared with the standard Grover algorithm. Published by the American Physical Society 2024