计算机工程与应用2017，Vol.53Issue(5)：24-27,35,5.DOI:10.3778/j.issn.1002-8331.1608-0356
两类完美的门限可变多秘密共享方案
Two perfect threshold changeable multi-secret sharing schemes
摘要
Abstract
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秘密共享/门限可变秘密共享Key words
Lagrange interpolation polynomial/multi-secret sharing/ramp secret sharing/threshold changeable secret sharing分类
信息技术与安全科学引用本文复制引用
张本慧,唐元生..两类完美的门限可变多秘密共享方案[J].计算机工程与应用,2017,53(5):24-27,35,5.基金项目
国家自然科学基金(No.61379004) （No.61379004）
安徽省教育厅自然科学研究重点项目(No.KJ2016A634). （No.KJ2016A634）
