CIS 2005: Computational Intelligence and Security pp 532-537 | Cite as
A Secure and Efficient (t, n) Threshold Verifiable Multi-secret Sharing Scheme
Conference paper
Abstract
Ting-Yi Chang et al.(2005) have proposed an efficient (t, n) threshold verifiable multi-secret sharing (VMSS) scheme, which is more secure than the one adopted in Lin and Wu (1999) and it can provide more efficient performance than the other VMSS schemes in terms of computational complexity. However, this paper will show that Chang et al.’s scheme is in fact insecure by presenting a conspiracy attack on it. Furthermore, a more secure scheme is proposed.
Preview
Unable to display preview. Download preview PDF.
References
- 1.Harn, L.: Efficient sharing (broadcasting) of multiple secret. IEE Proc. Comput. Digit. Tech. 142(3), 237–240 (1995)CrossRefGoogle Scholar
- 2.Chen, L., Gollmann, D., Mitchell, C.J., Wild, P.: Secret sharing with reusable polynomials. In: Proceedings of ACISP’s 1997, pp. 183–193 (1997)Google Scholar
- 3.Lin, T.Y., Wu, T.C. (t, n) threshold verifiable multi-secret sharing scheme based on factorization intractability and discrete logarithm modulo a composite problems. IEE Proc. Comput. Digit. Tech. 146(5), 264–268 (1999)CrossRefGoogle Scholar
- 4.Chang, T.-Y., Hwang, M.-S., Yang, W.-P.: An improvement on the Lin-Wu (t, n) threshold verifiable multi-secret sharing scheme. Applied Mathematics and Computation 163, 169–178 (2005)MATHCrossRefMathSciNetGoogle Scholar
- 5.Li, C.-M., Hwang, T., Lee, N.-Y.: Remark on the Threshold RSA Signature Scheme. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 413–419. Springer, Heidelberg (1994)Google Scholar
- 6.Adleman, L., McCurley, K.: Open Problems in Number Theoretic Complexity. In: Huang, M.-D.A., Adleman, L.M. (eds.) ANTS 1994. LNCS, vol. 877, pp. 291–322. Springer, Heidelberg (1994)Google Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2005