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

Soft Computing

A secure quantum homomorphic encryption ciphertext retrieval scheme

Zhenwen Cheng, Xiu‐Bo Chen, Gang Xu, Yan Zuo Chang, Li-Hua Miao, Yixian Yang, Yalan Wang

Published Feb 1, 2025• 3 citations
Publisher
DOI
10.1007/s00500-025-10454-w

Related papers

Grover algorithm-based quantum homomorphic encryption ciphertext retrieval scheme in quantum cloud computing

Changqing Gong, Du Juan, Zhaoyang Dong +4 more

Quantum Information Processing•Feb 10, 2020•45 citations

An Universal Quantum Homomorphic Encryption Framework

Yajun Liu

International Conference on Mobile Internet, Cloud Computing and Information Security (MICCIS)•Apr 1, 2026•0 citations

Non-interactive quantum homomorphic encryption scheme based on the rotation operator

WANG ShuoLin, SHANG Tao, LIU JianWei

Quantum homomorphic encryption (QHE) is an important branch of quantum cryptography. It can directly calculate the quantum ciphertext while ensuring calculation correctness and data security. QHE for a T-gate generates an additional S-gate. If this error is not eliminated, the desired output cannot be obtained. Using quantum gate teleportation can eliminate the S-error non-interactively, but increases the decryption complexity. This paper uses the rotation operator to realize QHE for the T / T^† -gate, and proposes a non-interactive QHE scheme. The decryption complexity of this scheme is O(1), and the encryption complexity is O(N) , where N is the number of quantum gates in the evaluated circuit. We prove that the scheme is information-theoretic secure and mathcalF-homomorphic, i.e., homomorphic for any quantum circuit, and implement QHE for a Toffoli-gate decomposition circuit on an IBM Quantum Experience platform.

Zhongguo kexue. Wulixue Lixue Tianwenxue•Nov 16, 2022•5 citations

Quantum Homomorphic Encryption

Tao Shang

Springer eBooks•Oct 15, 2024•0 citations

A Compact Multi-Identity Fully Homomorphic Encryption Scheme Without Fresh Ciphertexts

Ziwei Wang, Ruwei Huang, Xiyi Wei

The lattice-based multi-identity fully homomorphic encryption scheme combines the quantum security of lattice cryptography with the advantage of identity-based encryption. However, existing schemes face challenges such as large key sizes, inefficient ciphertext expansion processes, and reliance on outdated trapdoor designs, limiting their compactness and practicality. In this study, we propose a novel Compact Multi-Identity Fully Homomorphic Encryption Scheme (WZ-MIBFHE) that eliminates the need for fresh ciphertexts during expansion. First, we construct a compact identity-based encryption scheme by combining the YJW23 trapdoor and ABB10 under the standard model, proving its IND-sID-CPA security. The scheme is then adapted to ensure correctness and security when integrated with the decomposition method for ciphertext expansion. This adaptation also utilizes approximation errors to reduce overall noise. Finally, we expand the modified IBE scheme’s ciphertext using the decomposition method to construct the WZ-MIBFHE scheme. Compared to existing methods, WZ-MIBFHE reduces the lattice dimension to nlogq+logbq, improves public and private key sizes, and significantly lowers ciphertext expansion rates by removing the need for fresh ciphertexts. These improvements enhance both the compactness and efficiency of the scheme, making it a promising solution for multi-identity homomorphic encryption.

Applied Sciences•Jan 6, 2025•2 citations

Quantum Fully Homomorphic Encryption with Verification

Gorjan Alagic, Yfke Dulek, Christian Schaffner +1 more

arXiv:1708.09156•Lecture notes in computer science•Jan 1, 2017•37 citations
Quantum homomorphic encryption (QHE) is an important branch of quantum cryptography. It can directly calculate the quantum ciphertext while ensuring calculation correctness and data security. QHE for a T-gate generates an additional S-gate. If this error is not eliminated, the desired output cannot be obtained. Using quantum gate teleportation can eliminate the S-error non-interactively, but increases the decryption complexity. This paper uses the rotation operator to realize QHE for the T / T^† -gate, and proposes a non-interactive QHE scheme. The decryption complexity of this scheme is O(1), and the encryption complexity is O(N) , where N is the number of quantum gates in the evaluated circuit. We prove that the scheme is information-theoretic secure and mathcalF-homomorphic, i.e., homomorphic for any quantum circuit, and implement QHE for a Toffoli-gate decomposition circuit on an IBM Quantum Experience platform.
The lattice-based multi-identity fully homomorphic encryption scheme combines the quantum security of lattice cryptography with the advantage of identity-based encryption. However, existing schemes face challenges such as large key sizes, inefficient ciphertext expansion processes, and reliance on outdated trapdoor designs, limiting their compactness and practicality. In this study, we propose a novel Compact Multi-Identity Fully Homomorphic Encryption Scheme (WZ-MIBFHE) that eliminates the need for fresh ciphertexts during expansion. First, we construct a compact identity-based encryption scheme by combining the YJW23 trapdoor and ABB10 under the standard model, proving its IND-sID-CPA security. The scheme is then adapted to ensure correctness and security when integrated with the decomposition method for ciphertext expansion. This adaptation also utilizes approximation errors to reduce overall noise. Finally, we expand the modified IBE scheme’s ciphertext using the decomposition method to construct the WZ-MIBFHE scheme. Compared to existing methods, WZ-MIBFHE reduces the lattice dimension to nlogq+logbq, improves public and private key sizes, and significantly lowers ciphertext expansion rates by removing the need for fresh ciphertexts. These improvements enhance both the compactness and efficiency of the scheme, making it a promising solution for multi-identity homomorphic encryption.