一种基于Hamming码的门限多秘密共享方案  

A threshold multi-secret sharing scheme based on Hammimg code

作　　者：李富林[1] 刘杨 王娅如 LI Fulin;LIU Yang;WANG Yaru(School of Mathematics, Hefei University of Technology, Hefei 230601, China)

机构地区：[1]合肥工业大学数学学院,安徽合肥230601

出　　处：《合肥工业大学学报（自然科学版）》2021年第5期711-714,720,共5页Journal of Hefei University of Technology：Natural Science

基　　金：国家自然科学基金资助项目(61772168,60973125,61572168);安徽省自然科学基金资助项目(1508085MA13)。

摘　　要：秘密共享方案为信息安全和数据保密提供了有效方法,在密码学领域中有着重要地位。文章以纠错码中Ham(k,q)的纠错能力为基础,提出了一个新的(n,n)门限多秘密共享方案。将Hamming码中码字作为方案的秘密,并且将参与者进行分组,每个组拥有一份秘密份额,只有全部n个小组提供其正确秘密份额时才能重构秘密。最后依据双变量单向函数f(r,s)的性质和组内成员身份验证,保证秘密的安全性,避免秘密泄露与合谋攻击。Secret sharing schemes offer efficient methods for information security and data confidentiality,and play an important role in cryptography.In this paper,a novel(n,n)threshold multi-secret sharing scheme is presented based on the error correcting capacity of Ham(k,q).In this scheme,the secrets are codewords in the Hamming code.The mastery of secret shares is given to each group by grouping participants.Therefore,reconstructing the secret requires all groups to provide their correct secret shares.This scheme can verify the validation of the secret shares between the participants by using two-variable one-way function f(r,s)and membership verification,thus avoiding secret disclosure and collusion attacks.

关 键 词：多秘密共享 门限 汉明码 双变量单向函数 

分 类 号：TN918[电子电信—通信与信息系统]