一种安全有效的(t, n)多秘密共享认证方案
A secure and Efficient (t, n) Multisecret Sharing Authenticating Scheme
-
摘要: 基于双子密钥的思想给出了一种安全有效的(t,n)多秘密共享认证方案,其优点是每个成员可以多次使用自己的子密钥来恢复庄家任意给定的用于共享的多个密钥,重构一个密钥只需公开3个参数,为抵抗成员的欺骗无须执行零知识证明协议.所给的方案与已有的方案相比在计算量和通信量方面有明显的优越性.
-
关键词:
- 多秘密分享; 成员欺骗; 认证
Abstract: A secure and efficient (t, n) multisecret sharing authenticating scheme based on double shadow is proposed. The main merits are that the participant can reuse his shadows to recover the sharing multiple secrets that the dealer given and it only needs three parameters to reconstruct one secret, and need not to perform a zero-knowledge protocol to prevent the participant cheating. The proposed scheme is clearly superior to the other existing schemes in terms of both computational costs and communication costs. -
Shamir A. How to share a secret[J].Commun. ACM.1979, 22(11):612-613[2]Blackly G R. Safeguarding cryptographic keys[A]. Proc. Nat.Computer Conf. AFIPS Conf. Proc., New York, USA, 1979:313-317.[3]Ham L. Efficient sharing of multiple secrets[J].IEE Proc.Comput. andDigit. Tech.1995, 142(3):237-[4]Lin T Y. Wu T C. (t, n)-threshold verifiable multisecret sharing scheme based on the factorization and the discrete logarithm modulo a composite problems [J]. IEE Proc. Comput. Digit. Tech.,1999. 146(5): 264 - 268.[5]He W H, Wu T S. Comment on Lin-Wu (t, n)-threshold verifiable multisecret sharing scheme [J].IEE Proc. Comput. Digit. Tech.2001, 148(3):139-[6]何明星,范平志,袁丁.一个可验证的门限多秘密共享方案[J].电子学报,2002,30(4):540-543.
计量
- 文章访问数: 2138
- HTML全文浏览量: 98
- PDF下载量: 684
- 被引次数: 0