摘要
给出了一种多重密钥共享认证方案 .在该方案中 ,管理者容易给出任意用于共享的多重密钥集 ,成员拥有的子密钥不仅能重复使用 ,而且是可认证的 .所给方案提供了抵御管理者欺骗和成员欺骗的解决方法 .该方案的安全性取决于求解因子分解问题与离散对数问题的计算难度 .所给方案与已有方案相比具有明显的优越性 .
This paper proposes a multisecret sharing authenticating scheme. In the scheme, the dealer can freely give any set of multiple secrets for sharing and the sub-secret held by the participant is not only reusable but also verifiable. The proposed scheme provides efficient solutions against cheating by the dealer and cheating by any participant. The scheme′s security is based on the computing difficulty of solving the Factorization Problem and the Discrete Logarithm Problem. The proposed scheme is clearly superior to the other existing schemes.
出处
《计算机学报》
EI
CSCD
北大核心
2003年第5期552-556,共5页
Chinese Journal of Computers
基金
国家自然科学基金 (60 173 0 41)
湖南省自然科学基金 (0 2JJY2 0 94)资助
关键词
多重密钥共享认证
管理者欺骗
成员欺骗
离散对数问题
密码
信息安全
multisecret sharing
dealer cheating
participant cheating
factorization problem
discrete logarithm problem
threshold scheme
authenticating