Robust Semi-Quantum Summation over a Collective-Dephasing Noise Channel

Author:

Yang Chun-Wei1ORCID,Tsai Chia-Wei2ORCID,Chen Chi-An1,Lin Jason3ORCID

Affiliation:

1. Master Program for Digital Health Innovation, College of Humanities and Sciences, China Medical University, No. 100, Sec. 1, Jingmao Rd., Beitun District, Taichung 406040, Taiwan

2. Department of Computer Science and Information Engineering, National Taichung University of Science and Technology, No.129, Sec. 3, Sanmin Rd., North District, Taichung 40401, Taiwan

3. Department of Computer Science and Engineering, National Chung Hsing University, No. 145, Xingda Rd., South District, Taichung 40227, Taiwan

Abstract

Quantum summation is one of the various applications in secure multi-party computation. However, most of the existing quantum summation protocols assume that the participants possess all the quantum devices. Considering future applications, the capability of the participants must be adjusted before it can be put into practical use. Although Boyer et al. proposed that the semi-quantum environment could be used to solve this problem; another practical problem is the interference by noise. In 2022, Ye et al. proposed a two-party semi-quantum summation (SQS) protocol resistant to the interference of collective noise, in which two classical participants can accomplish the summation of their private binary sequences with the assistance of a quantum semi-honest third party. They proved that their SQS protocol is resistant to various eavesdropping attacks. This paper unveils two risks of information leakage in Ye et al.’s SQS protocol. If the aforementioned security issues are not resolved, Ye et al.’s SQS protocol may not be able to perform private quantum computations securely. Fortunately, the SQS protocol against the collective-dephasing noise proposed in this study is free from the issue of information leakage as well as resistant to various quantum attacks. In addition, the quantum efficiency of the SQS protocol proposed in this study is four times higher than that of Ye et al.’s SQS protocol, which can effectively improve the quantum utilization rate.

Funder

National Science and Technology Council, Taiwan, R.O.C.

China Medical University, Taiwan

Publisher

MDPI AG

Subject

General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)

Reference57 articles.

1. Shor, P.W. (1994, January 20–22). Algorithms for quantum computation: Discrete logarithms and factoring. Proceedings of the 35th Annual Symposium on the Foundations of Computer Science, Los Alamitos, CA, USA.

2. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer;Shor;SIAM Rev.,1999

3. Quantum factoring, discrete logarithms, and the hidden subgroup problem;Jozsa;Comput. Sci. Eng.,2001

4. Shor’s discrete logarithm quantum algorithm for elliptic curves;Proos;Quantum Inf. Comput.,2003

5. Quantum Summation with an Application to Integration;Heinrich;J. Complex.,2002

Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3