含至多四个参与者的量子秘密共享方案的最优信息率

doi:10.3969/j.issn.0372-2112.2014.10.013

电子学报 ›› 2014, Vol. 42 ›› Issue (10): 1951-1956.DOI: 10.3969/j.issn.0372-2112.2014.10.013

含至多四个参与者的量子秘密共享方案的最优信息率

宋云¹, 李志慧¹, 李永明²

1. 陕西师范大学数学与信息科学学院, 陕西西安 710062;
2. 陕西师范大学计算机科学学院, 陕西西安 710062

收稿日期:2013-03-29 修回日期:2014-04-08 出版日期:2014-10-25
- 通讯作者:
- 李志慧
- 作者简介:
- 宋云 女,1987年生于陕西西安,陕西师范大学数学与信息科学学院博士研究生.研究方向为有限域、密码学. E-mail:songyun09@163.com
- 基金资助:
- 国家自然科学基金 (No.61373150); 陕西省科学技术研究发展计划工业攻关项目 (No.2013k0611)

The Optimal Information Rate of Quantum-Secret-Sharing Schemes Based on at Most Four Participants

SONG Yun¹, LI Zhi-hui¹, LI Yong-ming²

1. College of Mathematics and Information Science, Shaanxi Normal University, Xi'an, Shaanxi 710062, China;
2. College of Computer Science, Shaanxi Normal University, Xi'an, Shaanxi 710062, China

Received:2013-03-29 Revised:2014-04-08 Online:2014-10-25 Published:2014-10-25

摘要/Abstract

摘要：

信息率是衡量量子秘密共享方案性能的一个重要指标.在本文中,我们利用超图的相关理论刻画了量子存取结构.然后,利用超图和量子存取结构间的关系给出了参与者人数至多为4的所有13个量子存取结构,并基于量子信息论研究了其最优信息率及所对应的完善的量子秘密共享方案.对其中的5种存取结构的最优信息率的准确值进行了计算,并讨论了达到此信息率的方案的具体构造;对余下的8种存取结构的最优信息率的上界进行了计算.

关键词: 信息率, 量子秘密共享, 量子存取结构, 超图, 量子熵

Abstract:

The information rate is an important metric of the performance of a quantum-secret-sharing scheme.In this paper, we characterize the quantum access structures by means of the theory of hypergraph.Furthermore, we derive the optimal information rate and the construction of perfect quantum-secret-sharing schemes corresponding to the quantum access structures with at most four players which are given in terms of the relationship between certain access structures and hypergraphs.The exact values for the optimal information rate in 5 of the 13 access structures are computed and the relevant construction of perfect secret sharing schemes is discussed.At the same time, the upper bounds for the information rate of other 8 quantum access structures are computed.

Key words: information rate, quantum-secret-sharing scheme, quantum access structures, hypergraph, quantum entropy

中图分类号:

TP309

宋云, 李志慧, 李永明. 含至多四个参与者的量子秘密共享方案的最优信息率[J]. 电子学报, 2014, 42(10): 1951-1956.

SONG Yun, LI Zhi-hui, LI Yong-ming. The Optimal Information Rate of Quantum-Secret-Sharing Schemes Based on at Most Four Participants[J]. Acta Electronica Sinica, 2014, 42(10): 1951-1956.

参考文献

[1] Hillery M,Buzek V,Berthiaume A.Quantum secret sharing[J].Phys Rev A,1999,59(3):1829-1834.
[2] Cleve R,Gottesman D,Lo H-K.How to share a quantum secret[J].Phys Rev Lett,1999,83:648-651.
[3] Gottesman D.Theory of quantum secret sharing[J].Phys Rev A,2000,61:042311.
[4] Smith A.Quantum secret sharing for general access structures[DB/OL].http://arxiv.org/abs/quant-ph/0001087.pdf,2000-01-24.
[5] Imai H,Muller-Quade J,Nascimento A,et al.A quantum information theoretical model for quantum secret sharing schemes[J].Quantum Inf Comput,2005,5(1):69-80.
[6] Helwig W,Cui W,et al.Absolute maximal entanglement and quantum secret sharing[J].Phys Rev A,2012,86:052335.
[7] Du Yu-tao,Bao Wan-su.Multiparty quantum secret sharing scheme based on the phase shift operations[J].Optics Communications,2013,308(1):159-163.
[8] Gao Gan.Improvement of efficient multiparty quantum secret sharing based on bell states and continuous variable operations[J].International Journal of Theoretical Physics,2014:1-5.
[9] 周淳,鲍皖苏,付向群.基于态关联性不完美的诱骗态量子密钥分配[J].电子学报,2012,40(10):2015-2020. Zhou Chun,Bao Wan-su,Fu Xiang-qun.Decoy-state quantum key distribution based on state-dependent imperfections[J].Acta Electronica Sinica,2012,40(10):2015-2020.(in Chinese)
[10] Wang Ming-ming,et al.Quantum secret sharing for general access structure based on multiparticle entanglement[J].Quantum Information Processing,2014,13(2):429-443.
[11] Fortescue B,Gour G.Reducing the quantum communication cost of quantum secret Sharing[J].IEEE Trans Inform Theory,2012,58(10):6659-6666.
[12] Sarvepalli P.Bounds on the information rate of quantum-secret-sharing schemes[J].Phys Rev A,2011,83:042324.
[13] Nielsen M A,Chuang I L.Quantum Computation and Quantum Information[M].Cambridge,England:Cambridge University,2000.410.
[14] Crescenzo G D,Galdi C.Hypergraph decomposition and secret sharing[J].Discrete Applied Mathematics,2009,157(5):928-946.

含至多四个参与者的量子秘密共享方案的最优信息率

The Optimal Information Rate of Quantum-Secret-Sharing Schemes Based on at Most Four Participants

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 12

编辑推荐

Metrics

[1]	王雪松, 张翰林, 程玉虎. 基于自编码器和超图的半监督宽度学习系统[J]. 电子学报, 2022, 50(3): 533-539.
[2]	王雄, 董一鸿, 潘剑飞, 陈华辉, 钱江波. 基于编辑行为码的图概要技术[J]. 电子学报, 2020, 48(12): 2434-2443.
[3]	宋云. 基于GHZ态局域测量的量子秘密共享[J]. 电子学报, 2019, 47(7): 1443-1448.
[4]	马慧芳, 刘芳, 夏琴, 郝占军. 基于加权超图随机游走的文献关键词提取算法[J]. 电子学报, 2018, 46(6): 1410-1414.
[5]	冀中, 樊帅飞. 基于超图排序算法的视频摘要[J]. 电子学报, 2017, 45(5): 1035-1043.
[6]	彭巧, 田有亮. 基于多线性Diffie-Hellman问题的秘密共享方案[J]. 电子学报, 2017, 45(1): 200-205.
[7]	夏胜平;宋锐;刘建军;张乐峰;虞华;Edwin Hancock. 面向非合作目标识别的大规模类属超图建模[J]. 电子学报, 2011, 39(6): 1399-1404.
[8]	郭奋卓, 高飞, 温巧燕, 朱甫臣. 一种高效的量子秘密共享方案[J]. 电子学报, 2006, 34(5): 883-886.
[9]	孙雪冬, 徐晓飞, 王刚. 基于有向超图的工作流资源分配均衡优化方法[J]. 电子学报, 2005, 33(8): 1370-1374.
[10]	刘军, 杨学军, 王俊伟, 唐玉华. 盘阵中基于平衡超图划分的自适应请求并发与负载平衡策略[J]. 电子学报, 2005, 33(4): 735-741.
[11]	赵俊忠;黄厚宽;田盛丰. 确定性退火算法在"伪装"入侵行为检测中的应用[J]. 电子学报, 2004, 32(2): 303-305.
[12]	许春香;陈恺;肖国镇. 安全的矢量空间秘密共享方案[J]. 电子学报, 2002, 30(5): 715-718.