Open Access

ARTICLE

Secure Multi-Party Quantum Summation Based on Quantum Homomorphic Encryption

Gang Xu^1,2, Fan Yun¹, Xiu-Bo Chen^3,*, Shiyuan Xu¹, Jingzhong Wang¹, Tao Shang⁴, Yan Chang⁵, Mianxiong Dong⁶

1 School of Information Science and Technology, North China University of Technology, Beijing, 100144, China
2 Advanced Cryptography and System Security Key Laboratory of Sichuan Province, Chengdu, 610025, China
3 Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, 100876, China
4 School of Cyber Science and Technology, Beihang University, Beijing, 100083, China
5 School of Cybersecurity, Chengdu University of Information Technology, Chengdu, 610225, China
6 Muroran Institution of Technology, Muroran, 050-8585, Japan

* Corresponding Author: Xiu-Bo Chen. Email:

Intelligent Automation & Soft Computing 2022, 34(1), 531-541. https://doi.org/10.32604/iasc.2022.028264

Received 06 February 2022; Accepted 15 March 2022; Issue published 15 April 2022

Abstract

Secure multi-party computation has been playing a fundamental role in terms of classical cryptography. Quantum homomorphic encryption (QHE) could compute the encrypted data without decryption. At present, most protocols use a semi-honest third party (TP) to protect participants’ secrets. We use a quantum homomorphic encryption scheme instead of TP to protect the privacy of parties. Based on quantum homomorphic encryption, a secure multi-party quantum summation scheme is proposed in which N participants can delegate a server with strong quantum computing power to assist computation. By delegating the computation and key update processes to a server and a semi-honest key center, participants encrypt their private information data using Pauli operators to get the sum. Besides, the server can design and optimize the summation lines itself, and the correct results can be obtained even if the secret information is negative. The correctness analysis showed that the participants could correctly obtain the results of the calculation. The security analysis proves the scheme is resistant to both outside attack and participant’s attack, and is secure against collusive attack by up to N-2 participants. From the theoretical point of view, our protocol can extend to other secure multi-party computing problems.

---

Keywords

---