Abstract
A multi-secret sharing scheme tries to share multiple secrets among a group of players in such a way that co-operation of pre-specified subsets of them, called access structures, can reconstruct the secrets. Existing methods allow for all secrets to be recovered at once, by the same sharing algorithm, and by identical access structures. However, in many real world applications, secrets may not needed all at once, access structure may vary for different secrets (change over time), and a group of dishonest players may collude to obtain all secrets. In this paper, we propose a novel and efficient algorithm to address these issues. Our main objectives are, to recover each secret according to its own scheme, by its own access structure, and whenever needed. Our proposed algorithm also blocks collusion attacks by dishonest players. Our scheme can work with any general purpose threshold schemes. It is also rather efficient in terms of computational and communication overhead costs. There computational costs for sharing and recovering stages are almost negligible, and communication costs of sharing and recovering are of order \({{\mathcal {O}}}(n+k)\) and \({{\mathcal {O}}}(\sum _{i=1}^{k} t^{i})\) respectively, where n is the number of players and where \(t^i\)’s are the threshold values for the k secrets.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Asmuth, C., & Bloom, J. (1983). A modular approach to key safeguarding. IEEE Transactions on Information Theory, 30(2), 208–210.
Blakely, G. (1979). Safeguarding cryptographic keys. In Proceedings of the 1979 AFIPS national computer conference (pp. 313–317).
Cohen, H. (2013). A course in computational algebraic number theory (4th ed., Vol. 138). Berlin: Springer.
Dehkordi, M. H., & Ghasemi, R. (2016). A lightweight public verifiable multi secret sharing scheme using short integer solution. Wireless Personal Communications, 91(3), 1459–1469.
del Rey, A. M. (2015). A multi-secret sharing scheme for 3D solid objects. Expert Systems with Applications, 42(4), 2114–2120.
Drăgan, C. C., & Ţiplea, F. L. (2016). Distributive weighted threshold secret sharing schemes. Information Sciences, 339, 85–97.
Elsheh, E., & Hamza, A. B. (2011). Secret sharing approaches for 3D object encryption. Expert Systems with Applications, 38(11), 13906–13911.
Eslami, Z., & Ahmadabadi, J. Z. (2010). A verifiable multi-secret sharing scheme based on cellular automata. Information Sciences, 180(15), 2889–2894.
Eslami, Z., & Ahmadabadi, J. Z. (2011). Secret image sharing with authentication-chaining and dynamic embedding. Journal of Systems and Software, 84(5), 803–809.
Eslami, Z., Razzaghi, S., & Ahmadabadi, J. Z. (2010). Secret image sharing based on cellular automata and steganography. Pattern Recognition, 43(1), 397–404.
Fatemi, M., Ghasemi, R., Eghlidos, T., & Aref, M. R. (2014). Efficient multistage secret sharing scheme using bilinear map. IET Information Security, 8(4), 224–229.
Harn, L., Fuyou, M., & Chang, C.-C. (2014). Verifiable secret sharing based on the Chinese remainder theorem. Security and Communication Networks, 7(6), 950–957.
Harn, L., & Hsu, C.-F. (2017). (t, n) multi-secret sharing scheme based on bivariate polynomial. Wireless Personal Communications, 95(2), 1495–1504.
Harn, L., Lin, C., & Li, Y. (2015). Fair secret reconstruction in (t, n) secret sharing. Journal of Information Security and Applications, 23, 1–7.
He, J., & Dawson, E. (1994). Multistage secret sharing based on one-way function. Electronics Letters, 30(19), 1591–1592.
Hsu, C.-F., Harn, L., & Cui, G. (2014). An ideal multi-secret sharing scheme based on connectivity of graphs. Wireless Personal Communications, 77(1), 383–394.
Hua, W., & Liao, X. (2017). A secret image sharing scheme based on piecewise linear chaotic map and Chinese remainder theorem. Multimedia Tools and Applications, 76(5), 7087–7103.
Mashhadi, S. (2016). How to fairly share multiple secrets stage by stage. Wireless Personal Communications, 90(1), 93–107.
Mashhadi, S., & Dehkordi, M. H. (2015). Two verifiable multi secret sharing schemes based on nonhomogeneous linear recursion and LFSR public-key cryptosystem. Information Sciences, 294, 31–40.
Pilaram, H., & Eghlidos, T. (2017). An efficient lattice based multi-stage secret sharing scheme. IEEE Transactions on Dependable and Secure Computing, 14(1), 2–8.
Shamir, A. (1979). How to share a secret. Communications of the ACM, 22(11), 612–613.
Shao, J. (2014). Efficient verifiable multi-secret sharing scheme based on hash function. Information Sciences, 278, 104–109.
Tian, Y., Ma, J., Peng, C., & Jiang, Q. (2013). Fair (t, n) threshold secret sharing scheme. IET Information Security, 7(2), 106–112.
Watanabe, Y., & Shikata, J. (2016). Information-theoretically secure timed-release secret sharing schemes. Journal of Information Processing, 24(4), 680–689.
Zarepour-Ahmadabadi, J., Ahmadabadi, M. S., & Latif, A. (2016). An adaptive secret image sharing with a new bitwise steganographic property. Information Sciences, 369, 467–480.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zarepour-Ahmadabadi, J., Shiri-Ahmadabadi, M., Miri, A. et al. A New Gradual Secret Sharing Scheme with Diverse Access Structure. Wireless Pers Commun 99, 1329–1344 (2018). https://doi.org/10.1007/s11277-017-5187-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11277-017-5187-y