Abstract
A multi-secret sharing scheme allows several secrets to be shared amongst a group of participants. In 2005, Shao and Cao developed a verifiable multi-secret sharing scheme where each participant’s share can be used several times which reduces the number of interactions between the dealer and the group members. In addition some secrets may require a higher security level than others involving the need for different threshold values. Recently Chan and Chang designed such a scheme but their construction only allows a single secret to be shared per threshold value.
In this article we combine the previous two approaches to design a multiple time verifiable multi-secret sharing scheme where several secrets can be shared for each threshold value. Since the running time is an important factor for practical applications, we will provide a complexity comparison of our combined approach with respect to the previous schemes.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Blakley, G.R.: Safeguarding cryptographic keys. In: AFIPS 1979 National Computer Conference, pp. 313–317. AFIPS Press (1979)
Chan, C.-W., Chang, C.-C.: A scheme for threshold multi-secret sharing. Applied Mathematics and Computation 166(1), 1–14 (2005)
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(1), 169 (2005)
Chien, H.-Y., Jan, J.-K., Tseng, Y.-M.: A practical (t,n) multi-secret sharing. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E83-A(12), 2762–2765 (2000)
Contini, S., Lenstra, A.K., Steinfeld, R.: VSH: an efficient and provable collision resistant hash collision. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 165–182. Springer, Heidelberg (2006)
Desmedt, Y.: Society and group oriented cryptography: A new concept. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 120–127. Springer, Heidelberg (1988)
Gibson, J.K.: Discrete logarithm hash function that is collision free and one way. IEE Proceedings - Computers and Digital Techniques 138(6), 407–410 (1991)
Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. The Johns Hopkins University Press (1996)
Gong, L.: New protocols for third-party-based authentication and secure broadcast. In: 2nd ACM Conference on Computer and Communications Security, pp. 176–183. ACM Press, New York (1994)
Harn, L.: Efficient sharing (broadcast) of multiple secrets. IEE Proceedings - Computers and Digital Techniques 142(3), 237–240 (1995)
He, J., Dawson, E.: Multisecret sharing scheme based one-way function. IEE Electronic Letters 31(2), 93–95 (1995)
Jackson, W.-A., Martin, K.M., O’Keefe, C.M.: On sharing many secrets (extended abstract). In: Safavi-Naini, R., Pieprzyk, J.P. (eds.) ASIACRYPT 1994. LNCS, vol. 917, pp. 42–54. Springer, Heidelberg (1995)
Karnin, E.D., Greene, J.W., Hellman, M.E.: On secret sharing systems. IEEE Transactions on Information Theory 29(1), 35–41 (1983)
Krawczyk, H.: Secret sharing made short. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 136–146. Springer, Heidelberg (1994)
Lin, T.-Y., Wu, T.-C.: (t,n) threshold verifiable multisecret sharing scheme based on factorisation intractability and discrete logarithm modulo a composite problems. IEE Proceedings - Computers and Digital Techniques 146(5), 264–268 (1999)
Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)
Pieprzyk, J., Hardjono, T., Seberry, J.: Fundamentals of Computer Security. Springer, Heidelberg (2003)
Shamir, A.: How to share a secret. Communication of the ACM 22(11), 612–613 (1979)
Shao, J., Cao, Z.: A new efficient (t,n) verifiable multi-secret sharing (VMSS) based on YCH scheme. Applied Mathematics and Computation 168(1), 135–140 (2005)
Stinson, D.R.: Cryptography: Theory and Practice, 3rd edn. Chapman & Hall/CRC (2006)
Wang, X., Lai, X., Feng, D., Chen, H., Yu, X.: Cryptanalysis of the hash functions MD4 and RIPEMD. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 1–18. Springer, Heidelberg (2005)
Wang, X., Yin, Y.L., Yu, H.: Finding collisions in the full SHA-1. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 17–36. Springer, Heidelberg (2005)
Wang, X., Yu, H.: How to break MD5 and other hash functions. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 19–35. Springer, Heidelberg (2005)
Wang, X., Yu, H., Yin, Y.L.: Efficient collision search attacks on SHA-0. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 1–16. Springer, Heidelberg (2005)
Yang, C.-C., Chang, T.-Y., Hwang, M.-S.: A (t,n) multi-secret sharing scheme. Applied Mathematics and Computation 151(2), 483–490 (2004)
Yu, H., Wang, G., Zhang, G., Wang, X.: The second-preimage attack on MD4. In: Desmedt, Y.G., Wang, H., Mu, Y., Li, Y. (eds.) CANS 2005. LNCS, vol. 3810, pp. 1–12. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tartary, C., Pieprzyk, J., Wang, H. (2008). Verifiable Multi-secret Sharing Schemes for Multiple Threshold Access Structures. In: Pei, D., Yung, M., Lin, D., Wu, C. (eds) Information Security and Cryptology. Inscrypt 2007. Lecture Notes in Computer Science, vol 4990. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79499-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-79499-8_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79498-1
Online ISBN: 978-3-540-79499-8
eBook Packages: Computer ScienceComputer Science (R0)