{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:24:12Z","timestamp":1740122652809,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,1,8]],"date-time":"2018-01-08T00:00:00Z","timestamp":1515369600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s11277-017-5187-y","type":"journal-article","created":{"date-parts":[[2018,1,8]],"date-time":"2018-01-08T06:50:51Z","timestamp":1515394251000},"page":"1329-1344","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A New Gradual Secret Sharing Scheme with Diverse Access Structure"],"prefix":"10.1007","volume":"99","author":[{"given":"Jamal","family":"Zarepour-Ahmadabadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8312-5276","authenticated-orcid":false,"given":"MohammadEbrahim","family":"Shiri-Ahmadabadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Miri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"AliMohammad","family":"Latif","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,8]]},"reference":[{"issue":"2","key":"5187_CR1","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1109\/TIT.1983.1056651","volume":"30","author":"C Asmuth","year":"1983","unstructured":"Asmuth, C., & Bloom, J. (1983). A modular approach to key safeguarding. IEEE Transactions on Information Theory, 30(2), 208\u2013210.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5187_CR2","doi-asserted-by":"crossref","unstructured":"Blakely, G. (1979). Safeguarding cryptographic keys. In Proceedings of the 1979 AFIPS national computer conference (pp. 313\u2013317).","DOI":"10.1109\/MARK.1979.8817296"},{"key":"5187_CR3","volume-title":"A course in computational algebraic number theory","author":"H Cohen","year":"2013","unstructured":"Cohen, H. (2013). A course in computational algebraic number theory (4th ed., Vol. 138). Berlin: Springer.","edition":"4"},{"issue":"3","key":"5187_CR4","doi-asserted-by":"crossref","first-page":"1459","DOI":"10.1007\/s11277-016-3539-7","volume":"91","author":"MH Dehkordi","year":"2016","unstructured":"Dehkordi, M. H., & Ghasemi, R. (2016). A lightweight public verifiable multi secret sharing scheme using short integer solution. Wireless Personal Communications, 91(3), 1459\u20131469.","journal-title":"Wireless Personal Communications"},{"issue":"4","key":"5187_CR5","doi-asserted-by":"crossref","first-page":"2114","DOI":"10.1016\/j.eswa.2014.10.035","volume":"42","author":"AM Rey del","year":"2015","unstructured":"del Rey, A. M. (2015). A multi-secret sharing scheme for 3D solid objects. Expert Systems with Applications, 42(4), 2114\u20132120.","journal-title":"Expert Systems with Applications"},{"key":"5187_CR6","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.ins.2016.01.019","volume":"339","author":"CC Dr\u0103gan","year":"2016","unstructured":"Dr\u0103gan, C.\u00a0C., & \u0162iplea, F.\u00a0L. (2016). Distributive weighted threshold secret sharing schemes. Information Sciences, 339, 85\u201397.","journal-title":"Information Sciences"},{"issue":"11","key":"5187_CR7","first-page":"13906","volume":"38","author":"E Elsheh","year":"2011","unstructured":"Elsheh, E., & Hamza, A. B. (2011). Secret sharing approaches for 3D object encryption. Expert Systems with Applications, 38(11), 13906\u201313911.","journal-title":"Expert Systems with Applications"},{"issue":"15","key":"5187_CR8","doi-asserted-by":"crossref","first-page":"2889","DOI":"10.1016\/j.ins.2010.04.015","volume":"180","author":"Z Eslami","year":"2010","unstructured":"Eslami, Z., & Ahmadabadi, J. Z. (2010). A verifiable multi-secret sharing scheme based on cellular automata. Information Sciences, 180(15), 2889\u20132894.","journal-title":"Information Sciences"},{"issue":"5","key":"5187_CR9","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1016\/j.jss.2011.01.002","volume":"84","author":"Z Eslami","year":"2011","unstructured":"Eslami, Z., & Ahmadabadi, J. Z. (2011). Secret image sharing with authentication-chaining and dynamic embedding. Journal of Systems and Software, 84(5), 803\u2013809.","journal-title":"Journal of Systems and Software"},{"issue":"1","key":"5187_CR10","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/j.patcog.2009.06.007","volume":"43","author":"Z Eslami","year":"2010","unstructured":"Eslami, Z., Razzaghi, S., & Ahmadabadi, J. Z. (2010). Secret image sharing based on cellular automata and steganography. Pattern Recognition, 43(1), 397\u2013404.","journal-title":"Pattern Recognition"},{"issue":"4","key":"5187_CR11","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1049\/iet-ifs.2013.0046","volume":"8","author":"M Fatemi","year":"2014","unstructured":"Fatemi, M., Ghasemi, R., Eghlidos, T., & Aref, M. R. (2014). Efficient multistage secret sharing scheme using bilinear map. IET Information Security, 8(4), 224\u2013229.","journal-title":"IET Information Security"},{"issue":"6","key":"5187_CR12","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1002\/sec.807","volume":"7","author":"L Harn","year":"2014","unstructured":"Harn, L., Fuyou, M., & Chang, C.-C. (2014). Verifiable secret sharing based on the Chinese remainder theorem. Security and Communication Networks, 7(6), 950\u2013957.","journal-title":"Security and Communication Networks"},{"issue":"2","key":"5187_CR13","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1007\/s11277-016-3862-z","volume":"95","author":"L Harn","year":"2017","unstructured":"Harn, L., & Hsu, C.-F. (2017). (t, n) multi-secret sharing scheme based on bivariate polynomial. Wireless Personal Communications, 95(2), 1495\u20131504.","journal-title":"Wireless Personal Communications"},{"key":"5187_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jisa.2015.07.001","volume":"23","author":"L Harn","year":"2015","unstructured":"Harn, L., Lin, C., & Li, Y. (2015). Fair secret reconstruction in (t, n) secret sharing. Journal of Information Security and Applications, 23, 1\u20137.","journal-title":"Journal of Information Security and Applications"},{"issue":"19","key":"5187_CR15","doi-asserted-by":"crossref","first-page":"1591","DOI":"10.1049\/el:19941076","volume":"30","author":"J He","year":"1994","unstructured":"He, J., & Dawson, E. (1994). Multistage secret sharing based on one-way function. Electronics Letters, 30(19), 1591\u20131592.","journal-title":"Electronics Letters"},{"issue":"1","key":"5187_CR16","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/s11277-013-1511-3","volume":"77","author":"C-F Hsu","year":"2014","unstructured":"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\u2013394.","journal-title":"Wireless Personal Communications"},{"issue":"5","key":"5187_CR17","doi-asserted-by":"crossref","first-page":"7087","DOI":"10.1007\/s11042-016-3364-8","volume":"76","author":"W Hua","year":"2017","unstructured":"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\u20137103.","journal-title":"Multimedia Tools and Applications"},{"issue":"1","key":"5187_CR18","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/s11277-016-3332-7","volume":"90","author":"S Mashhadi","year":"2016","unstructured":"Mashhadi, S. (2016). How to fairly share multiple secrets stage by stage. Wireless Personal Communications, 90(1), 93\u2013107.","journal-title":"Wireless Personal Communications"},{"key":"5187_CR19","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.ins.2014.08.046","volume":"294","author":"S Mashhadi","year":"2015","unstructured":"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\u201340.","journal-title":"Information Sciences"},{"issue":"1","key":"5187_CR20","first-page":"2","volume":"14","author":"H Pilaram","year":"2017","unstructured":"Pilaram, H., & Eghlidos, T. (2017). An efficient lattice based multi-stage secret sharing scheme. IEEE Transactions on Dependable and Secure Computing, 14(1), 2\u20138.","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"issue":"11","key":"5187_CR21","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A. (1979). How to share a secret. Communications of the ACM, 22(11), 612\u2013613.","journal-title":"Communications of the ACM"},{"key":"5187_CR22","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.ins.2014.03.025","volume":"278","author":"J Shao","year":"2014","unstructured":"Shao, J. (2014). Efficient verifiable multi-secret sharing scheme based on hash function. Information Sciences, 278, 104\u2013109.","journal-title":"Information Sciences"},{"issue":"2","key":"5187_CR23","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1049\/iet-ifs.2012.0064","volume":"7","author":"Y Tian","year":"2013","unstructured":"Tian, Y., Ma, J., Peng, C., & Jiang, Q. (2013). Fair (t, n) threshold secret sharing scheme. IET Information Security, 7(2), 106\u2013112.","journal-title":"IET Information Security"},{"issue":"4","key":"5187_CR24","doi-asserted-by":"crossref","first-page":"680","DOI":"10.2197\/ipsjjip.24.680","volume":"24","author":"Y Watanabe","year":"2016","unstructured":"Watanabe, Y., & Shikata, J. (2016). Information-theoretically secure timed-release secret sharing schemes. Journal of Information Processing, 24(4), 680\u2013689.","journal-title":"Journal of Information Processing"},{"key":"5187_CR25","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1016\/j.ins.2016.07.001","volume":"369","author":"J Zarepour-Ahmadabadi","year":"2016","unstructured":"Zarepour-Ahmadabadi, J., Ahmadabadi, M. S., & Latif, A. (2016). An adaptive secret image sharing with a new bitwise steganographic property. Information Sciences, 369, 467\u2013480.","journal-title":"Information Sciences"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-017-5187-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-017-5187-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-017-5187-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T23:40:06Z","timestamp":1570578006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-017-5187-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,8]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["5187"],"URL":"https:\/\/doi.org\/10.1007\/s11277-017-5187-y","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"type":"print","value":"0929-6212"},{"type":"electronic","value":"1572-834X"}],"subject":[],"published":{"date-parts":[[2018,1,8]]}}}