基于量子求和的安全多方量子排序协议

doi:10.3969/j.issn.1007-5461.2021.03.012

量子电子学报 ›› 2021, Vol. 38 ›› Issue (3): 354-364.doi: 10.3969/j.issn.1007-5461.2021.03.012

基于量子求和的安全多方量子排序协议

王蕊聪1,2∗, 冯雁1,3

1 北京电子科技学院网络空间安全系, 北京100070; 2 西安电子科技大学, 陕西西安710126; 3 中国科学技术大学, 安徽合肥230026

收稿日期:2020-06-10 修回日期:2020-10-19 出版日期:2021-05-28 发布日期:2021-05-28
通讯作者: E-mail: 1193238657@qq.com
作者简介:王蕊聪( 1995 - ), 女, 河南三门峡人, 主要从事网络安全, 量子密码方面的研究。E-mail: 1193238657@qq.com
基金资助:
Supported by National Key R & D Program of China (国家重点研发计划项目, 2018YFE0200600), Anhui Province Guidance Project of Quantum Communication and Quantum Computer Major Projects (安徽省量子通信与量子计算机重大项目引导性项目, AHY180500)

Secure multi-party quantum sorting protocol based on quantum summation

WANG Ruicong1,2∗, FENG Yan1,3

1 Cyberspace Security Department, Beijing Electronic Science and Technology Institute, Beijing 100070, China; 2 Xidian University, Xian 710126, China; 3 University of Science and Technology of China, Hefei 230026, China

Received:2020-06-10 Revised:2020-10-19 Published:2021-05-28 Online:2021-05-28

摘要/Abstract

摘要： 安全多方排序问题是保护用户隐私的安全多方计算中最为重要的核心问题之一。针对传统多方排序安全性低、易被窃取的问题, 提出了一种在半诚实模型下的安全多方量子排序协议, 该协议中各方基于量子傅立叶变换求和的方式参与计算, 在保密数值不被泄露的基础上获取排名。通过IBM 提供的量子计算模拟器, 对协议的正确性进行了实验验证, 并对协议的安全性进行了理论分析。协议不仅为现有的量子排序提供了新思路, 而且很好地兼顾了公平性、有效性以及安全性。

关键词: 量子通信, 安全多方计算, 安全多方量子排序, 安全多方量子求和, 量子傅里叶变换

Abstract: Secure multi-party sorting is one of the most important core issues in secure multi-party computing to protect user privacy. A secure multi-party quantum sorting protocol based on the semihonest model is proposed to solve the problem of low security and eavesdropping of traditional multiparty sorting. In this protocol, each party participates in the calculation based on the sum of quantum Fourier transform and obtains the rank on the basis that the secret values are not leaked. Through the quantum computing simulator provided by IBM, correctness of the protocol is verified experimentally and security of the protocol is analyzed theoretically. The protocol not only provides a new idea for the existing quantum sorting, but also gives consideration to fairness, validity and security.

Key words: quantum cummunication, secure multi-party computation, secure multi-party quantum sorting; secure multi-party quantum summation, quantum Fourier transform

中图分类号:

TN918.1

王蕊聪, ∗, 冯雁, . 基于量子求和的安全多方量子排序协议[J]. 量子电子学报, 2021, 38(3): 354-364.

WANG Ruicong, ∗, FENG Yan, . Secure multi-party quantum sorting protocol based on quantum summation[J]. Chinese Journal of Quantum Electronics, 2021, 38(3): 354-364.

参考文献 44

[1]	Cheng C, Luo Y L, Chen C X, et al. Research on secure multi-party ranking problem and secure selection problem [C].
	International Conference on International Conference on Web Information Systems and Mining, 2010: 79-84.
[2]	Wang N, Gu H M, Zheng T. A practical and efficient secure multi-party sort protocol [J]. Computer Applications and Software,
20	18, 35(10): 305-311.
	王宁, 顾昊旻, 郑彤. 一种实用高效的安全多方排序协议[J]. 计算机应用与软件, 2018, 35(10): 305-311.
[3]	Li S D, Zhang X P. Secure multi-party computation protocol for sorting problem [J]. Journal of Xi’an Jiaotong University,
20	08, 42(2): 231-233, 255.
	李顺东, 张选平. 排序问题的多方保密计算协议[J]. 西安交通大学学报, 2008, 42(2): 231-233, 255.
[4]	Yao A C. Protocols for secure computations [C]. Annual Symposium on Foundations of Computer Science, 1982, 54: 160-164.
[5]	GoodrichMT. Zig-zag sort: A simple deterministic data-oblivious sorting algorithm running in O(nlogn) time [C]. Proceedings
	of the Annual ACM Symposium on Theory of Computing, 2014, 46: 684-693.
[6]	Xiao Q, Luo S S, Chen P, et al. Research on secure multi party scheduling problem under semi honest model [J]. Acta
	Electronica Sinica, 2008, 36(4): 709-714.
	肖倩, 罗守山, 陈萍, 等. 半诚实模型下安全多方排序问题的研究[J]. 电子学报, 2008, 36(4): 709-714.
[7]	Qiu M, Luo S S, Liu W, et al. Using RSA cryptosystem to solve secure multi party multi data sorting problem [J]. Acta
	Electronica Sinica, 2009, 37(5): 1119-1123.
	邱梅, 罗守山, 刘文. 利用RSA 密码体制解决安全多方多数据排序问题[J]. 电子学报, 2009, 37(5): 1119-1123.
[8]	Shi B S, Jiang Y K, Guo G C. Manipulating the frequency-entangled states by an acoustic-optical modulator [J]. Physical
	Review A, 2000, 61(6): 064102.
[9]	Xue P, Li C F, Guo G C. Addendum to efficient quantum-key-distribution scheme with nonmaximally entangled states [J].
	Physical Review A, 2002, 65(3): 034302.
[10]	Yang Y G, Wen Q Y, Zhu F C. Optimal inclusive teleportation of a d-dimensional two particle unknown quantum state [J].
	Chinese Physics B (English Version), 2006, 15(5): 907-911.
[11]	YangY G, Wen Q Y, Zhu F C. An efficient two step quantum key distribution protocol with orthogonal product states [J].
	Chinese Physics B (English Version), 2007, 16(4): 910-914.
[12]	Cleve R, Gottesman D, Lo H K. How to share a quantum secret [J]. Physical Review Letters, 1999, 83(3): 648-651.
[13]	Lu H, Zhang Z, Chen L K, et al. Secret sharing of a quantum state [J]. Physical Review Letters, 2016, 117(3): 030501.
[14]	Ain N U. A novel approach for secure multi-party secret sharing scheme via quantum cryptography [C]. 2017 International
	Conference on Communication, Computing and Digital Systems (C-CODE). IEEE, 2017: 112-116.
[15]	Shi R H. Research on Quantum Secret Sharing and Other Multi-Party Quantum Cryptography Protocols [D]. Hefei: University
	of Science and Technology of China, 2011.
	石润华. 量子秘密共享及其它多方量子密码协议研究[D]. 合肥: 中国科学技术大学, 2011.
[16]	Majumder A, Mohapatra S, Kumar A. Experimental realization of secure multiparty quantum summation using five-qubit IBM
	quantum computer on cloud [J]. 2017, arXiv: 1707. 07460.
[17]	Zhong H, Huang L S, Luo Y L. Multi candidate electronic election scheme based on secure multi-party summation [J]. Computer
	Research and Development, 2006, 43(8): 1405-1410.
	仲红, 黄刘生, 罗永龙. 基于安全多方求和的多候选人电子选举方案[J]. 计算机研究与发展, 2006, 43(8): 1405-1410.
[18]	Zhang Y H. Research on the Choice of Protecting Private Information [D]. Anhui: Anhui University, 2014.
	张永华. 保护私有信息的选择问题研究[D]. 安徽: 安徽大学, 2014.
[19]	Zhang H X, Lu Z C. The ordering problem of quantization [J]. Journal of Hangzhou University (Natural Science Edition),
19	97, 24(3): 226-229.
	张洪宪, 陆志成. 量子化的排序问题[J]. 杭州大学学报(自然科学版), 1997, 24(3): 226-229.
[20]	Liu W, Wang Y B. Research on secure multiparty quantum scheduling problem [J]. Acta Physica Sinica, 2011, 60(7): 53-60.
	刘文, 王永滨. 保密多方量子排序问题的研究[J]. 物理学报, 2011, 60(7): 53-60.
[21]	Qian X Q. Research on Secure Multiparty Ordering [D]. Anhui: Anhui University, 2013.
	钱小强. 安全多方排序的研究[D]. 安徽: 安徽大学, 2013.
[22]	Shi R H, Mu Y, Zhong H, et al. Secure multiparty quantum computation for summation and multiplication [J]. Scientific
	Reports, 2016, 6(1): 28-34.
[23]	Yang H Y, Ye T Y. Secure multi-party quantum summation based on quantum Fourier transform [J]. Quantum Information
	Processing, 2018, 17(6): 1-17.
[24]	Du J Z, Chen X B, Wen Q Y, et al. Secure multiparty quantum summation [J]. Acta Physica Sinica, 2007, 56(11): 6214-6219.
	杜建忠, 陈秀波, 温巧燕, 等. 保密多方量子求和[J]. 物理学报, 2007, 56(11): 6214-6219.
[25]	Overill R E. Review: Foundations of cryptography, volume II: Basic applications [J]. Journal of Logic and Computation, 2005,
15	(3): 218-229.
[26]	Shen M Y, Cheng X Y, Guan Z J, et al. Realization method of two-dimensional nearest neighbor for quantum circuits [J].
	Chinese Journal of Quantum Electronics, 2019, 36(4): 476-482.
	沈鸣燕, 程学云, 管致锦, 等. 一种量子线路二维近邻实现方法[J]. 量子电子学报, 2019, 36(4): 476-482.
[27]	Dai J, Li Z Q, Pan S H, et al. Deutsch-Jozsa algorithm realization based on IBM Q [J]. Chinese Journal of Quantum Electronics,
20	20, 37(2): 202-209.
	戴娟, 李志强, 潘苏含, 等. 基于IBM Q 的Deutsch-Jozsa 算法实现[J]. 量子电子学报, 2020, 37(2): 202-209.
[28]	Wei J, Ni M, Zhou M, et al. Research of quantum algorithm based on IBM Q platform [J]. Computer Engineering, 2018,
44	(12): 6-12.
	卫佳, 倪明, 周明, 等. 基于IBM Q 平台的量子算法研究[J]. 计算机工程, 2018, 44(12): 6-12.

基于量子求和的安全多方量子排序协议

Secure multi-party quantum sorting protocol based on quantum summation

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献 44

相关文章 15

编辑推荐

Metrics

本文评价

[1]	唐世彪∗ , 李志 , 郑伟军 , 张万生 , 高松 , 李亚麟 , 程节 , 蒋连军. 量子密钥分发系统防死时间攻击方案研究[J]. 量子电子学报, 2023, 40(1): 95-103.
[2]	王跃, 张可佳, ∗, 韩睿. 基于量子中心的测量型量子保密求和协议[J]. 量子电子学报, 2023, 40(1): 104-111.
[3]	李天秀, 石磊∗, 王俊辉, 李佳豪. 基于深度学习的量子信号大气衰减系数预测[J]. 量子电子学报, 2022, 39(5): 786-794.
[4]	唐晓帆. 基于微环谐振腔的宽带纠缠源制备方案[J]. 量子电子学报, 2022, 39(3): 418-422.
[5]	周文婷, 王鑫, 卞宇翔, ∗, 乔涵, 冯宝, . 基于极化码的连续变量量子密钥分发多维逆向协商协议[J]. 量子电子学报, 2021, 38(4): 460-467.
[6]	冯宝, ∗, 赵子岩 , 贾玮, 窦天琦 , 周芬, 孙钟齐 , 马海强. 基于波分复用技术的参考系无关量子密钥分发[J]. 量子电子学报, 2021, 38(3): 346-353.
[7]	叶萌, 徐立坤, 黄观金, 李建辉, 刘云∗. 新型设备无关量子密钥分配协议研究[J]. 量子电子学报, 2021, 38(1): 45-49.
[8]	余松, 柏明强, 唐茜, 莫智文, ∗. 基于三粒子类GHZ态的受控量子安全直接通信协议[J]. 量子电子学报, 2021, 38(1): 57-65.
[9]	彭家寅. 基于十粒子纠缠态的三方受控联合远程态制备[J]. 量子电子学报, 2021, 38(1): 66-74.
[10]	彭家寅. 任意二量子态的混合双向受控量子通信[J]. 量子电子学报, 2020, 37(1): 50-56.
[11]	彭家寅. 四量子纠缠态的可选远程态制备[J]. 量子电子学报, 2019, 36(6): 719-726.
[12]	黄超李云霞石磊蒙文杨汝. 非线性效应对量子模分复用系统误码率的影响分析[J]. 量子电子学报, 2019, 36(4): 444-449.
[13]	陈倚天,刘宏伟，屈文秀，窦天琦，王吉鹏，李月梅，马海强. 量子密钥分发系统软件控制研究[J]. 量子电子学报, 2018, 35(6): 682-689.
[14]	王新良，黄青改,张中卫. 基于信道自校验的量子定值传输协议[J]. 量子电子学报, 2018, 35(6): 705-713.
[15]	王新良黄青改. 基于量子纠缠的自适应路由选择协议研究[J]. J4, 2018, 35(4): 461-469.