Abstract
A multi-stage secret sharing scheme (MSSS) allows a dealer to share multiple secrets among a set of participants, in such a way that any authorized subset of participants can reconstruct the secrets stage-by-stage. In this paper, for the first time we propose an efficient MSSS based on the non-homogeneous linear feedback shift register (NHLFSR). According to the properties of NHLFSRs, this scheme has few public information, a new simple distribution, and various techniques for the reconstruction phase.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Iftene, S. (2007). General secret sharing based on the chinese remaindertheorem with applications in e-voting. Electronic Notes inTheoretical Computer Science, 186, 6784.
Hsu, C.-F., & Harn, L. (2014). Multipartite secret sharing based on CRT. Wireless Personal Communications, 78, 271–282.
Schoenmakers, B. (2011). Encyclopedia of cryptography and security. In H. C. A. van Tilborg & S. Jajodia (Eds.), Verifiable secret sharing (pp. 1357–1358). Heidelberg: Springer.
Shamir, A. (1979). How to share a secret. Communications of the ACM, 22, 612–613.
Wu, T.-Y., & Tseng, Y.-M. (2011). A pairing-based publicly verifiable secret sharing scheme. Journal of Systems Science and Complexity, 24, 186–194.
Dehkordi, M. H., & Mashhadi, S. (2008). An efficient threshold verifiable multi-secret sharing. Computer Standards and Interfaces, 30, 187–190.
Eslami, Z., & Kabiri Rad, S. (2012). A new verifiable multi-secret sharing scheme based on bilinear maps. Wireless Personal Communications, 63, 45946.
Lin, C., & Harn, L. (2012). Unconditionally secure verifiable secret sharing scheme. Advances in Information Sciences and Service Sciences, 4, 514–518.
Hadian, M., & Mashhadi, S. (2008). New efficient and practical verifiable multi-secret sharing schemes. Information Sciences, 178, 2262–2274.
Mashhadi, S. (2015). Computationally-secure multiple secret sharing: Models schemes, and formal security analysis. The ISC International Journal of Information Security, 7, 91–99.
Chang, T.-Y., Hwang, M.-S., & Yang, W.-P. (2005). A new multi-stage secret sharing scheme using one-way function. ACM SIGOPS Operating Systems, 39, 48–55.
Fatemi, M., Eghlidos, T., & Aref, M. R. (2009). A multi-stage secret sharing scheme using all-or-nothing transform approach. LNCS, 5927, 449–458.
Harn, L. (1995). Comment multistage secret sharing based on one-way function. Electronics Letters, 31, 262.
He, J., & Dawson, E. (1994). Multistage secret sharing based on one-way function. Electronics Letters, 30, 1591–1592.
Li, H.-X., Cheng, C.-T., & Pang, L.-J. (2005). An impoved multi-stage \((t, n)\)-threshold secret sharing scheme. LNCS, 3739, 267–274.
Hadian, M., & Mashhadi, S. (2008). Verifiable secret sharing schemes based on non-homogeneous linear recursions and elliptic curves. Computer Communications, 31, 1777–1784.
Biggs, N. L. (1989). Discrete mathematics (Revised ed.). New York: Oxford University Press.
Mashhadi, S., & Hadian, M. (2015). Two verifiable multi secret sharing schemes based on nonhomogeneous linear recursion and LFSR public-key cryptosystem. Information Sciences, 294, 31–40.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Mashhadi, S. How to Fairly Share Multiple Secrets Stage by Stage. Wireless Pers Commun 90, 93–107 (2016). https://doi.org/10.1007/s11277-016-3332-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11277-016-3332-7