Quantum Searchable Encryption for Cloud Data Based on Full-Blind Quantum Computation
Wenjie Liu, Yinsong Xu, Wen Liu, Haibin Wang, Zhibin Lei
TL;DR
The paper tackles secure cloud-based quantum search by introducing a multi-client, circuit-based full-blind quantum computation (FBQC) framework (QSE-FBQC) in which a trusted key center outsources keys and a data center executes masked quantum gates. By decomposing gates into a restricted $\{R_z(\tfrac{\pi}{4}), R_y(\tfrac{\pi}{4}), CR_z(\tfrac{\pi}{4}), CR_y(\tfrac{\pi}{4}), CCR_z(\tfrac{\pi}{4}), CCR_y(\tfrac{\pi}{4})\}$ set and using trap qubits, the scheme preserves blindness of both data and computation while supporting multi-client access and Grover-based search. The authors provide protocol steps, concrete gate examples (X, CZ, Toffoli), a detailed Grover-based encryption example, and security analyses against external and internal attacks, including eavesdropping detection via BB84-style checks. They compare performance with classical SE and existing BQC schemes, showing quadratic speedups in search and improved multi-client applicability, with discussions on practical trust and extension directions. The work advances secure quantum data sharing and search in the cloud by integrating FBQC with quantum-secure searchable encryption.
Abstract
Searchable encryption (SE) is a positive way to protect users sensitive data in cloud computing setting, while preserving search ability on the server side, i.e., it allows the server to search encrypted data without leaking information about the plaintext data. In this paper, a multi-client universal circuit-based full-blind quantum computation (FBQC) model is proposed. In order to meet the requirements of multi-client accessing or computing encrypted cloud data, all clients with limited quantum ability outsource the key generation to a trusted key center and upload their encrypted data to the data center. Considering the feasibility of physical implementation, all quantum gates in the circuit are replaced with the combination of π/8 rotation operator set {Rz(π/4), Ry(π/4), CRz(π/4), CRy(π/4), CCRz(π/4), CCRy(π/4)}. In addition, the data center is only allowed to perform one π/8 rotation operator each time, but does not know the structure of the circuit (i.e., quantum computation), so it can guarantee the blindness of computation. Then, through combining this multi-client FBQC model and Grover searching algorithm, we continue to propose a quantum searchable encryption scheme for cloud data. It solves the problem of multi-client access mode under searchable encryption in the cloud environment, and has the ability to resist against some quantum attacks. To better demonstrate our scheme, an example of our scheme to search on encrypted 2-qubit state is given in detail. Furthermore, the security of our scheme is analysed from two aspects: external attacks and internal attacks, and the result indicates that it can resist against such kinds of attacks and also guarantee the blindness of data and computation.