两类完美的门限可变多秘密共享方案  

Two perfect threshold changeable multi-secret sharing schemes

作　　者：张本慧[1] 唐元生[2] ZHANG Benhui;TANG Yuansheng(School of Mathematical Sciences, Huaibei Normal University, Huaibei, Anhui 235000, China;School of Mathematical Sciences, Yangzhou University, Yangzhou, Jiangsu 225002, China)

机构地区：[1]淮北师范大学数学科学学院,安徽淮北235000 [2]扬州大学数学科学学院,江苏扬州225002

出　　处：《计算机工程与应用》2017年第5期24-27,35,共5页Computer Engineering and Applications

基　　金：国家自然科学基金(No.61379004);安徽省教育厅自然科学研究重点项目(No.KJ2016A634)

摘　　要：(t→t′,n)门限可变方案研究如何将门限t改变为t′(>t)以增加攻击者攻击方案的难度。基于拉格朗日插值多项式提出两类完美的门限可变多秘密共享方案:(t→t+1,n)门限可变方案Π,Π′、(t→t+v-1,n)门限可变方案Π,Π″,并证明Π′是(t-1,t+1,n)ramp秘密共享方案,Π″是最优(t-1,t+v-1,n)ramp秘密共享方案,Π,Π″是最优(t→t+v-1,n)门限可变方案。The threshold t can be changed into t ′(> t) in (t→t ′,n) threshold changeable schemes, which can increase the difficulty for attackers to attack the schemes. Based on Lagrange interpolation polynomial, two perfect threshold changeable multi- secret sharing schemes: (t→t + 1,n) threshold changeable scheme Π,Π′ and (t→t + v - 1,n)threshold changeable scheme Π,Π″ are proposed. It is shown that Π′ is a (t - 1,t + 1,n) ramp secret sharing scheme,Π″ is an optimal (t - 1,t + v - 1,n) ramp secret sharing scheme and Π,Π″ is an optimal (t→t + v - 1,n) threshold changeable scheme.

关 键 词：拉格朗日插值多项式 多秘密共享 ramp秘密共享 门限可变秘密共享 

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