基于内P-集合理论的门限秘密共享方案  

Threshold Secret Sharing Scheme Based on Internal P-sets Theory

作　　者：吴玉杰[1] 于秀清[1] 李雄[2] 

机构地区：[1]德州学院数学科学学院,山东德州253023 [2]湖南科技大学计算机科学与工程学院,湖南湘潭411201

出　　处：《计算机工程》2015年第9期159-163,共5页Computer Engineering

基　　金：国家自然科学基金青年基金资助项目(61300220);山东省自然科学基金资助项目(ZR2010AL019)

摘　　要：为确保密钥安全,防止密钥丢失,基于离散对数难题和内P-集合理论,提出一种新的(n,t)门限秘密共享方案。该方案将共享密钥先分成小块,然后混入构造的集合中。在密钥重构过程中,选取某个参与者作为密钥恢复者,有至少t个参与者为密钥恢复者提供秘密份额,通过构造单项映射和内P-集合的计算进行密钥恢复。由参与者自己设定子秘密,秘密分发者与参与者之间不需要维护安全信道,从而减小通信负担。实例分析结果表明,该方案实现简单,具有较高的安全性。In order to protect secret, a new efficient （n, t） threshold secret sharing scheme is proposed basea on alscrete logarithm problem and the P-sets theory in this paper. In this scheme,the sharing secret is divided into small pieces and is mixed into the structural set,in the secret reconstruction, the sharing secret is reconstructed through computing a map and the internal P-sets by more than t secret shares by a designated participant,and the computational complexity is very low. The secret shares are chosen by the participants themselves, so there is no secure channel between the secret dealer and participants and reduces the communication costs. Example results show that the proposed scheme has high security and is easy to implement.

关 键 词：门限秘密 秘密共享 离散对数 内P-集合 属性集 单向映射 

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