动态的(t,n)门限多秘密分享方案  

Dynamic(t,n) threshold multi-secret sharing scheme

作　　者：刘锋[1] 何业锋[2] 程学翰[1] 

机构地区：[1]鲁东大学数学与信息学院,山东烟台264025 [2]西安邮电学院信息与控制系,西安710061

出　　处：《计算机应用研究》2008年第1期241-242,245,共3页Application Research of Computers

基　　金：国家自然科学基金项目(10671086);陕西省教育厅青年科学基金资助项目(2006JK198)

摘　　要：基于单向函数和大整数因子分解问题,提出了一个动态有效的(t,n)门限多秘密分享方案。通过此分享方式,秘密分发者可以给出任一待分享秘密的集合,而每个成员只需持有惟一可以重复使用的秘密份额;它能同时有效地检测出分发者和分享者的欺诈行为,解决秘密恢复时计算量大等问题。对于本方案来说,新成员的加入是容易的;为了在不影响其他任何成员的情况下删除某个或某些成员,引入了一个新奇的方法。Based on a one-way function and the large-integer factorization problem, proposed an efficient and dynamic （t, n） threshold multi-secret sharing scheme. By this scheme, the dealer could arbitrarily give any set of multiple secrets to be kept by every participant; meanwhile, it could efficiently prevent both dealer cheating and other participants cheating, and the computation of a secret recovery was overhead. Considering the scheme, it was easy for new participants to join. However, the revocation schemes were always difficult. A novel revocation scheme is used, which needs little computational cost at the user end, without affecting any of the other performance parameters.

关 键 词：秘密分享 门限体制 单向函数 成员删除 

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