基于RS码生成机制的(k,n)门限量子秘密共享方案

doi:10.3969/j.issn.1671-1122.2016.04.007

信息网络安全 ›› 2016, Vol. 16 ›› Issue (4): 44-49.doi: 10.3969/j.issn.1671-1122.2016.04.007

基于RS码生成机制的(k,n)门限量子秘密共享方案

程资, 靳俐荣, 石金晶()

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

收稿日期:2016-03-11 出版日期:2016-04-20 发布日期:2020-05-13
作者简介:
作者简介：程资（1990—）,女,河北,硕士研究生,主要研究方向为信息安全、量子密码、量子安全通信等;靳俐荣（1994—）,女,内蒙古,本科,主要研究方向为信息安全、量子密码、量子安全通信;石金晶（1986—）,女,四川,博士,主要研究方向为信息安全、量子密码、量子安全通信等。
基金资助:
国家自然科学基金[61272495, 61379153, 61401519];教育部博士点基金[20130162110012];本科生自由探索国家级立项[201510533281]

(k,n) Threshold Quantum Secret Sharing Scheme Based on the Generation of Reed Solomon Code

Zi CHENG, lirong JIN, Jinjing SHI()

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

Received:2016-03-11 Online:2016-04-20 Published:2020-05-13

摘要/Abstract

摘要：

文章利用生成矩阵分割法提出了(k,n)量子门限秘密共享方案。与以往经典方案相比,它具有更好的安全性和可靠性。从量子方案的角度看,编码多样性提高了密钥破译难度。针对生成矩阵的循环周期问题和因某些元素不存在本原根而不能构造生成矩阵的问题,文章也提出了解决方案。本文方案的核心思想是参照量子信息与经典信息的对应关系,利用有限域中的本原根构造生成矩阵来实现经典秘密的分割,生成矩阵满足任意k列列向量线性独立;传输采用了基于超密集编码的量子安全直接通信。

关键词: 量子秘密共享, 生成矩阵, 量子安全直接通信, 超密集编码

Abstract:

A (k,n) quantum threshold secret sharing scheme based on generator matrix segmentation is proposed in this paper. Compared with the previous classical schemes, our scheme has better security and reliability, and it also has the diversity of encoding with the quantum system, which can improve the difficulty of deciphering. A solution for the issue of matrix cycle period and the problem that some numbers without the primitive element can’t construct generation matrix is derived. The core idea of our scheme is to achieve the secret division by applying the primitive element in the finite domain for generation matrix based on the correspondence between the quantum and classical information, where the generation matrix satisfies that any k column vectors are linearly independent. The transmission process involves quantum secure direct communication (QSDC) based on super-dense coding.

Key words: quantum secret sharing, generator matrix, quantum secure direct communication, super-dense coding

中图分类号:

TP309

程资, 靳俐荣, 石金晶. 基于RS码生成机制的(k,n)门限量子秘密共享方案[J]. 信息网络安全, 2016, 16(4): 44-49.

Zi CHENG, lirong JIN, Jinjing SHI. (k,n) Threshold Quantum Secret Sharing Scheme Based on the Generation of Reed Solomon Code[J]. Netinfo Security, 2016, 16(4): 44-49.

图/表 3

参考文献 23

[1]	BLAKLEY G. Safeguarding Cryptographic Keys[EB/OL]., 2015-9-28.
[2]	SHAMIR A.How to Share a Secret[J]. Communication of ACM, 1979, 22(11): 612-613.
[3]	GUO Y, ZENG G H, CHEN Z G.Multiparty Quantum Secret Sharing of Quantum States with Quantum Registers[J]. Chinese Physics Letters, 2007, 24(4): 863-866.
[4]	GUO Y, HUANG D Z, ZENG G H, et al.Multiparty Quantum Secret Sharing of Quantum States Using Entanglement States[J]. Chinese Physics Letters, 2008, 25(1): 16-19.
[5]	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.
[6]	GUO Y, ZHAO Y.High-efficient Quantum Wecret Wharing Based on the Chinese Remainder Theorem via the Orbital Angular Momentum Entanglement Analysis[J]. Quantum Information Processing, 2013, 12(2): 1125-1139.
[7]	SHI R H, LV G L, WANG Y, et al.On Quantum Secret Sharing via Chinese Remainder Theorem with the Non-maximally Entanglement State Analysis[J]. International Journal of Theoretical Physics, 2013, 52(2): 539-548.
[8]	GAO G.Improvement of Efficient Multiparty Quantum Secret Sharing Based on Bell States and Continuous Variable Operations[J]. International Journal of Theoretical Physics, 2014, 53(7): 2231-2235.
[9]	李元兴,王新梅. 密钥分散管理方案与线性分组码[J]. 通信学报, 1993,14(3): 22-28.
[10]	梅挺,代群,张明. 基于线性分组码的(k, n)门限方案的研究[J]. 通信技术,2008 (11): 288-290.
[11]	郭玉娟,李志慧,赖红. 基于线性码上的动态可验证的秘密共享方案[J]. 陕西师范大学学报(自然科学版),2010,38(4): 7-12.
[12]	宋云,李志慧,李永明. 基于极小线性码上的秘密共享方案[J]. 电子学报,2013,41(2):220-226.
[13]	刘荣香,赖红. 基于线性码上无可信第三方的多秘密共享方案[J]. 青岛科技大学学报(自然科学版), 2014,35(5): 539-542.
[14]	WANG C, DENG F G, LI Y S, et al.Quantum secure direct Communication with High-dimension Quantum Super Dense Coding[J]. Physical Review A, 2005, 71(4): 044305.
[15]	SHI R H, SU Q, GUO Y, et al.The Dining Cryptographer Problem-Based Anonymous Quantum Communication via Non-maximally Entanglement State Analysis[J]. International Journal of Theoretical Physics, 2013, 52(2): 376-384.
[16]	LONG G L, LIU X S.Theoretically Efficient High-capacity Quantum-Key-distribution Scheme[J]. Physical, Review, A, 2002, 65(3): 2302.
[17]	DENG F G, LONG G L, LIU X S.Two-step Quantum Direct Communication Protocol Using the Einstein-Podolsky-Rosen Pair Block[J]. Physical Review A, 2003, 68(4): 113-114.
[18]	HUANG D Z, GUO Y, ZENG G H.Quantum Secure Direct Intercommunication with Super Dense Coding and Entanglement Swapping[J]. Communications in Theoretical Physics, 2008, 50(6): 1290-1294.
[19]	LAI H, XIAO J, ORGUN M A, et al.Quantum Direct Secret Sharing with Efficient Eavesdropping-check and Authentication Based on Distributed Fountain Codes[J]. Quantum information processing, 2014, 13(4): 895-907.
[20]	KARNIN E D, GREEN J W, HELLMAN M E.On Secret Sharing Systems[J]. IEEE Tran. IT, 1983, 24(1): 35-41.
[21]	SHI R H, GUO Y, LEE M H.Quantum Codes Based on Fast Pauli Block Transforms in the Finite Field[J]. Quantum Information Processing, 2010, 9(5): 611-628.
[22]	KAPETANAKIS G.Normal Bases and Primitive Elements over Finite Fields[J]. Finite Fields and Their Applications, 2014, 26(3): 123-143.
[23]	COHEN S D.Pairs of Primitive Elements in Fields of Even Order[J]. Finite Fields and Their Applications, 2014, 28(28): 22-42.

基于RS码生成机制的(k,n)门限量子秘密共享方案

(k,n) Threshold Quantum Secret Sharing Scheme Based on the Generation of Reed Solomon Code

RichHTML

PDF (PC)

可视化

摘要/Abstract

引用本文

使用本文

图/表 3

参考文献 23

相关文章 2

编辑推荐

Metrics

本文评价

[1]	刘晓芬, 陈晓峰, 连桂仁, 林崧. 基于d级单粒子的可认证多方量子秘密共享协议[J]. 信息网络安全, 2020, 20(3): 51-55.
[2]	刘成基, 李志慧, 司萌萌, 白晨明. 基于局域区分的六粒子正交纠缠态的量子秘密共享方案[J]. 信息网络安全, 2018, 18(4): 56-64.