基于图态和中国剩余定理的量子秘密共享方案

doi:10.11959/j.issn.1000-436x.2018220

通信学报 ›› 2018, Vol. 39 ›› Issue (10): 72-78.doi: 10.11959/j.issn.1000-436x.2018220

基于图态和中国剩余定理的量子秘密共享方案

梁建武,刘晓书,程资

中南大学信息科学与工程学院，湖南长沙410083

修回日期:2018-06-22 出版日期:2018-10-01 发布日期:2018-11-23
作者简介:梁建武（1964-），男，湖南长沙人，中南大学副教授，主要研究方向为量子通信和无线通信。|刘晓书（1994-），女，湖南衡阳人，中南大学硕士生，主要研究方向为量子通信和无线通信。|程资（1990-），女，河北晋州人，中南大学硕士生，主要研究方向为量子通信和无线通信。

Quantum secret sharing with graph states based on Chinese remainder theorem

Jianwu LIANG,Xiaoshu LIU,Zi CHENG

Institute of Information Science and Engineering,Central South University,Changsha 410083,China

Revised:2018-06-22 Online:2018-10-01 Published:2018-11-23

摘要/Abstract

摘要：

受到量子图态几何结构和特性的启发，提出了一种基于图态和中国剩余定理的量子秘密共享方案。在该方案中，分发者在有限域内利用中国剩余定理分发秘密，秘密被编码到量子图态里并且通过酉正操作传送给合法参与者，合法参与者使用群恢复协议合作重建子秘密。该方案提供了一个简洁的方法，即通过使用纠缠图态的稳定子来传递信息，分析显示它能提供更好的信息安全性和性能。

关键词: 量子信息, 量子秘密共享, 图态, 中国剩余定理

Abstract:

Based on the topological features of quantum graph states,a quantum secret sharing scheme based on Chinese remainder theorem with a vivid graphic description was proposed.The dealer extracts sub-secrets according to Chinese remainder theorem over finite field,which were imbedded with quantum graph states and transmitted to the legal participants with unitary operations.Group-recovery protocols were used in the secret recovering processing through rebuilding sub-secrets among legal cooperative participants.Analysis shows that it could provide better security and capability of the information.

Key words: quantum information, quantum secret sharing, graph states, Chinese remainder theorem

中图分类号:

TN918.1

梁建武,刘晓书,程资. 基于图态和中国剩余定理的量子秘密共享方案[J]. 通信学报, 2018, 39(10): 72-78.

Jianwu LIANG,Xiaoshu LIU,Zi CHENG. Quantum secret sharing with graph states based on Chinese remainder theorem[J]. Journal on Communications, 2018, 39(10): 72-78.

图/表 7

图1

图2

表1

图3

图5

图4

图6

参考文献 21

[1]	SHAMIR A . How to share a secret[J]. Communication of ACM, 1979,22(11): 621-613.
[2]	HILLERY M , BUˇZEK V , BERTHIAUME A . Quantum secret sharing[J]. Physical Review A, 1999,59(3): 1829-1834.
[3]	SHI R H , SU Q , GUO Y ,et al. Quantum secret sharing based on Chinese remainder theorem[J]. Communications in Theoretical Physics, 2011,55(4): 573-578.
[4]	GUO Y , ZHAO Y . High efficient quantum secret sharing based o-n the Chinese remainder theorem via the orbital angular momentum entanglement analysis[J]. Quantum Information Processing, 2013,12(2): 1125-1139.
[5]	GUO Y , HUANG D Z , ZENG G H . Multiparty quantum secret s-haring of quantum states using entanglement states[J]. Chinese Physics Letters, 2008,25(1): 16-19.
[6]	MARKHAM D , SANDERS B C . Graph states for quantum secret sharing[J]. Physical Review A, 2008,78(4):042309.
[7]	KEET A , FORTESCUE B , MARKHAM D ,et al. Quantum secret sharing with qudit graph states[J]. Physical Review A, 2010,82(6):062315.
[8]	RAHAMAN R , PARKER M G . Quantum scheme for secret sharing based on local distinguish ability[J]. Physical Review A, 2015,91(2):022330.
[9]	TAVAKOLI A , HERBAUTS I , ZUKOWSKI M ,et al. Secret sharing with a single dlevelquantum system[J]. Physical Review A, 2015,92(3):030302.
[10]	LIANG J W , ZHOU J , SHI J J ,et al. Improving continuous variable quantum key distribution using the heralded noiseless linear amplifier with source in the middle[J]. International Journal of Theoretical Physics, 2015,55(2): 1156-1166.
[11]	WANG C , HUANG P , HUANG D ,et al. Practical security of continuous variable quantum key distribution with finite sampling bandwidtheffects[J]. Physical Review A, 2016,93(2):022315.
[12]	WU Y D , ZHOU J , GONG X B ,et al. Continuous variable measurement device independent multipartite quantum communication[J]. Physical Review A, 2016,93(2):022325.
[13]	AMIRI R , WALLDEN P , KENT A ,et al. Secure quantum signatures using insecure quantum channels[J]. Physical Review A, 2016,3(3):032325.
[14]	QIN H W , DAI Y W . An efficient (t,n) threshold quantum secret sharing without entanglement Quantum error correcting codes using qudit graph states[J]. Modern Physics Letters B, 2016,30(12):1650138.
[15]	QIN H , ZHU X , DAI Y . A proactive quantum secret sharing scheme based on GHZ state[J]. Modern Physics Letters B, 2015,29(27):1550165.
[16]	HE X L , YANG C P . Deterministic transfer of multi-qubit GHZ entangled states and quantum secret sharing between different cavityes[J]. Quantum Information Processing, 2015,14(12): 4461-4474.
[17]	QIN H , DAI Y . Verifiable (t,n) threshold quantum secret sharing using d-dimensional Bellstate[J]. Information Processing Letters, 2016,116(5): 351-355.
[18]	KEET A , FORTESCUE B , MARKHAM D ,et al. Quantum sec-ret sharing with qudit graph states[J]. Physical Review A, 2010,82(6): 4229-4231.
[19]	梁建武, 程资, 石金晶 ,等. 基于量子图态的量子秘密共享[J]. 物理学报. 2016,65(16): 35-41.
	LIANG J W , CHEGN Z , SHI J J ,et al. Quantum secret sharing based on quantum graph States[J]. Acta Physica Sinica, 2016,65(16): 35-41.
[20]	KONDRACKI A . The Chinese remainder theorem[J]. Formalized Mathematics, 1997,6(4): 573-577.
[21]	佟鑫, 温巧燕, 朱甫臣 . 基于 GHZ 态纠缠交换的量子秘密共享[J]. 北京邮电大学学报. 2007,30(1): 44-48.
	TONG X , WEN Q Y , ZHU F C . Quantum secret sharing based on GHZ state entanglement swapping[J]. Journal of Beijing University of Posts and Telecommunications, 2007,30(1): 44-48.

基于图态和中国剩余定理的量子秘密共享方案

Quantum secret sharing with graph states based on Chinese remainder theorem

在线阅读

PDF下载

可视化

摘要/Abstract

引用本文

使用本文

图/表 7

参考文献 21

相关文章 10

Metrics

推荐阅读 0

[1]	张海波, 陈舟, 黄宏武, 贺晓帆. VANET系统中基于中国剩余定理的群内相互认证密钥协商协议[J]. 通信学报, 2022, 43(1): 182-193.
[2]	常相茂, 占俊, 王志伟. 低开销的NB-IoT节点群组身份安全认证协议[J]. 通信学报, 2021, 42(12): 152-162.
[3]	梁建武,王晓慧,郭迎,程资. 基于量子纠缠的盲签名方案[J]. 通信学报, 2016, 37(2): 39-43.
[4]	王辉,石润华,仲红,崔杰,张顺,汪开婷. 有序双重的量子盲签名协议[J]. 通信学报, 2015, 36(9): 259-266.
[5]	黄海平,戴庭,王汝传,秦小麟,陈九天. 基于(t,n)门限和划分树的可再生散列链构造方案[J]. 通信学报, 2013, 34(4): 70-81.
[6]	黄海平1,2,4，戴庭1,2，王汝传1,2,3，秦小麟4，陈九天1. 基于(t, n)门限和划分树的可再生Hash链构造方案[J]. 通信学报, 2013, 34(4): 8-81.
[7]	张国华,孙蓉,王新梅. 围长为8的QC-LDPC码的显式构造及其在CRT方法中的应用[J]. 通信学报, 2012, 33(3): 171-176.
[8]	刘修生. 卡氏积码的MDR码和自对偶码[J]. 通信学报, 2010, 31(3): 123-125.
[9]	朱珍超,张玉清. 基于量子理论的秘密共享方案研究[J]. 通信学报, 2009, 30(11A): 127-132.
[10]	王剑,张权,唐朝京. 针对经典消息的高效量子签名协议[J]. 通信学报, 2007, 28(1): 64-68.

S	z₂(m₁=2)	z₃(m ₂=3)
1	1	1
2	0	2
3	1	0
4	0	1
5	1	2