基于线性码的量子秘密共享方案  

Quantum Secret Sharing Scheme Based on Linear Codes

作　　者：刘璐[1] 李志慧 芦殿军 闫晨红 LIU Lu;LI Zhihui;LU Dianjun;YAN Chenhong(Shaanxi Normal University,Xi’an 710119,China)

机构地区：[1]陕西师范大学,西安710119

出　　处：《信息网络安全》2021年第8期62-69,共8页Netinfo Security

基　　金：国家自然科学基金[11671244]。

摘　　要：文章基于线性纠错码提出了一个具有ε安全性的可识别作弊的量子秘密共享方案。在该方案中,秘密被正交阵列的列标和某行中的两个元素唯一决定。其中正交阵列的列标可通过非对称二元多项式在经典信道恢复,而某行中的两个元素基于线性纠错码在量子信道部分恢复。该方案不仅具有作弊者可识别和身份验证的功能,而且可实现秘密的双重加密。安全性分析表明,该协议可抵抗拦截重发攻击和纠缠测量攻击。Based on Linear error-correcting codes,a cheating-detectable quantum secret sharing scheme withεsecurity is proposed.In this scheme,the secret is uniquely determined by the column index of the orthogonal array and two elements in a row.The column index of the orthogonal array is recovered in the classical channel through an asymmetric bivariate polynomial.The two elements in a row are partially recovered in the quantum channel based on the linear error correction code.This scheme not only has the function of identifying and authenticating cheaters,but also realizes double encryption of secrets.Security analysis shows that the protocol is capable of resisting interception retransmission attacks and entanglement measurement attacks externally.

关 键 词：量子秘密共享 正交阵列 线性纠错码 非对称二元多项式 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]