一种基于二进制序列的秘密共享新方法  

A Novel Secret Sharing Method Based on Binary Sequence

作　　者：程叶霞[1,2] 杜跃进[1,3] 杨凯[2] 何申[2] 彭晋[2] 姜文[4] 

机构地区：[1]中国科学院信息工程研究所,北京100093 [2]中国移动通信研究院安全技术研究所,北京100053 [3]阿里巴巴集团安全部,北京100102 [4]国家计算机网络应急技术处理协调中心,北京100029

出　　处：《电信科学》2015年第11期19-25,共7页Telecommunications Science

基　　金：国家自然科学基金资助项目(No.61171173);国家高技术研究发展计划("863"计划)基金资助项目(No.2011AA01A103);国家发展和改革委员会信息化领域创新能力建设专项(网络安全应急技术国家工程实验室项目)资助项目~~

摘　　要：提出了一种与传统的秘密共享方法不同的新型的秘密共享方法,该方法是基于二进制秘密序列的位运算的秘密共享方法。秘密包括但不限于密码、消息等,秘密序列包括但不限于密码序列、消息序列等,将采用非M序列法则法形成的非M序列作为其秘密共享的子秘密序列M'的构成元素。提出了基于二进制序列的秘密共享的子秘密生成方法及对应的秘密恢复方法,该方法具有可行性与实效性。A novel secret sharing method was proposed based on binary sequence, which was quite different from the traditional secret sharing method. This secret sharing method was based on binary secret sequence using bit operations. The secret here included but not limited to key, message, etc, meanwhile the secret sequence included but not limited to key sequence, message sequence and so on. And two new concepts which were called non-M sequence and non-M sequence rule method were defined. By using the non-M sequence rule method, the elements of sub-secret sequence M＇ of secret sharing were computed. The method for generating sub-secrets and the method for recovering secret was proposed based on binary sequence. The method was practical and effective.

关 键 词：秘密共享 二进制序列 非M序列 门限方案 秘密恢复 信息安全 

分 类 号：TN911.1[电子电信—通信与信息系统]