A secure and Efficient （t, n） Multisecret Sharing Authenticating Scheme

Xie Qi; Yu XiuYuan; Wang JiLin

Volume 27 Issue 9

Sep. 2005

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2005 > 27(9): 1476-1478

Xie Qi, Yu XiuYuan, Wang JiLin. A secure and Efficient （t, n） Multisecret Sharing Authenticating Scheme[J]. Journal of Electronics & Information Technology, 2005, 27(9): 1476-1478.

Citation:

Xie Qi, Yu XiuYuan, Wang JiLin. A secure and Efficient （t, n） Multisecret Sharing Authenticating Scheme[J]. Journal of Electronics & Information Technology, 2005, 27(9): 1476-1478.

Xie Qi, Yu XiuYuan, Wang JiLin. A secure and Efficient （t, n） Multisecret Sharing Authenticating Scheme[J]. Journal of Electronics & Information Technology, 2005, 27(9): 1476-1478.

Citation:

Xie Qi, Yu XiuYuan, Wang JiLin. A secure and Efficient （t, n） Multisecret Sharing Authenticating Scheme[J]. Journal of Electronics & Information Technology, 2005, 27(9): 1476-1478.

PDF( 289 KB)

A secure and Efficient （t, n） Multisecret Sharing Authenticating Scheme

Xie Qi^{①②;于秀源},
Yu XiuYuan,
Wang JiLin

Received Date: 2004-05-17
Rev Recd Date: 2004-08-23
Publish Date: 2005-09-19

Abstract

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.

FullText(HTML)

References(1)

References

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.

Relative Articles

Supplements(0)

Cited By

Proportional views