aqora

Practical multi-party quantum homomorphic encryption

Chen Lv, Lingli Chen, Qin Li

Theoretical Computer ScienceJul 16, 202315 citations

A secure quantum homomorphic encryption ciphertext retrieval scheme

Zhenwen Cheng, Xiu‐Bo Chen, Gang Xu +4 more

Soft ComputingFeb 1, 20253 citations

Secure Multiparty Logical AND Based on Quantum Homomorphic Encryption and Its Applications

Xinglan Zhang, Yunxin Xi

International Journal of Theoretical PhysicsSep 12, 20242 citations

Cross quantum homomorphic encryption based on the butterfly network

Xing-Bo Pan, Yu-Ting Lei, Xiangjie Li +2 more

Quantum homomorphic encryption hides quantum information from unauthorized participants while still allowing them to perform calculations on encrypted quantum information. In this paper, we propose a cross quantum homomorphic encryption scheme based on the butterfly network, in which every receiver can receive the evaluated quantum state with perfect fidelity. The entangled states between senders of the butterfly network are preshared, and the Bell basis measurements are used to encrypt the quantum plaintext. With both classical and quantum channels, the homomorphic evaluation of quantum plaintext can be completed on the butterfly network perfectly and crossly. Our scheme solves a bottleneck problem of cross evaluation at the bottleneck nodes, and improves the evaluation efficiency and total network throughput. In addition, we have designed quantum circuits according to different quantum evaluations with a butterfly network, which provide a basic blueprint for experimental implementation. The security of the scheme is also analyzed.Quantum homomorphic encryption hides quantum information from unauthorized participants while still allowing them to perform calculations on encrypted quantum information. In this paper, we propose a cross quantum homomorphic encryption scheme based on the butterfly network, in which every receiver can receive the evaluated quantum state with perfect fidelity. The entangled states between senders of the butterfly network are preshared, and the Bell basis measurements are used to encrypt the quantum plaintext. With both classical and quantum channels, the homomorphic evaluation of quantum plaintext can be completed on the butterfly network perfectly and crossly. Our scheme solves a bottleneck problem of cross evaluation at the bottleneck nodes, and improves the evaluation efficiency and total network throughput. In addition, we have designed quantum circuits according to different quantum evaluations with a butterfly network, which provide a basic blueprint for experimental implementation. The security of the scheme is also analyzed.

Physical Review AJun 12, 202410 citations

Quantum Fully Homomorphic Encryption with Verification

Gorjan Alagic, Yfke Dulek, Christian Schaffner +1 more

arXiv:1708.09156Lecture notes in computer scienceJan 1, 201737 citations

On statistically-secure quantum homomorphic encryption

Ching–Yi Lai, Kai-Min Chung

Homomorphic encryption is an encryption scheme that allows computations to be evaluated on encrypted inputs without knowledge of their raw messages. Recently Ouyang et al. constructed a quantum homomorphic encryption (QHE) scheme for Clifford circuits with statistical security (or information-theoretic security (IT-security)). It is desired to see whether an information-theoretically-secure (ITS) quantum FHE exists. If not, what other nontrivial class of quantum circuits can be homomorphically evaluated with IT-security? We provide a limitation for the first question that an ITS quantum FHE necessarily incurs exponential overhead. As for the second one, we propose a QHE scheme for the instantaneous quantum polynomial-time (IQP) circuits. Our QHE scheme for IQP circuits follows from the one-time pad.Homomorphic encryption is an encryption scheme that allows computations to be evaluated on encrypted inputs without knowledge of their raw messages. Recently Ouyang et al. constructed a quantum homomorphic encryption (QHE) scheme for Clifford circuits with statistical security (or information-theoretic security (IT-security)). It is desired to see whether an information-theoretically-secure (ITS) quantum FHE exists. If not, what other nontrivial class of quantum circuits can be homomorphically evaluated with IT-security? We provide a limitation for the first question that an ITS quantum FHE necessarily incurs exponential overhead. As for the second one, we propose a QHE scheme for the instantaneous quantum polynomial-time (IQP) circuits. Our QHE scheme for IQP circuits follows from the one-time pad.

arXiv:1705.00139Quantum Information and ComputationAug 1, 201820 citations

Practical cross-quantum homomorphic encryption with complete security

Related papers

Practical cross-quantum homomorphic encryption with complete security

Related papers