一種安全有效的（t, n）多秘密共享認(rèn)證方案
A secure and Efficient （t, n） Multisecret Sharing Authenticating Scheme
-
摘要: 基于雙子密鑰的思想給出了一種安全有效的(t,n)多秘密共享認(rèn)證方案,其優(yōu)點(diǎn)是每個(gè)成員可以多次使用自己的子密鑰來恢復(fù)莊家任意給定的用于共享的多個(gè)密鑰,重構(gòu)一個(gè)密鑰只需公開3個(gè)參數(shù),為抵抗成員的欺騙無須執(zhí)行零知識證明協(xié)議.所給的方案與已有的方案相比在計(jì)算量和通信量方面有明顯的優(yōu)越性.
-
關(guān)鍵詞:
- 多秘密分享; 成員欺騙; 認(rèn)證
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]何明星,范平志,袁丁.一個(gè)可驗(yàn)證的門限多秘密共享方案[J].電子學(xué)報(bào),2002,30(4):540-543. -
計(jì)量
- 文章訪問數(shù): 2149
- HTML全文瀏覽量: 100
- PDF下載量: 684
- 被引次數(shù): 0
下載:
