{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T13:28:06Z","timestamp":1761744486382,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,4,26]],"date-time":"2017-04-26T00:00:00Z","timestamp":1493164800000},"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":[[2017,9]]},"DOI":"10.1007\/s11277-017-4245-9","type":"journal-article","created":{"date-parts":[[2017,4,26]],"date-time":"2017-04-26T09:49:54Z","timestamp":1493200194000},"page":"1393-1405","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A Verifiable (k,n,m)-Threshold Multi-secret Sharing Scheme Based on NTRU Cryptosystem"],"prefix":"10.1007","volume":"96","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7290-0882","authenticated-orcid":false,"given":"Ali Nakhaei","family":"Amroudi","sequence":"first","affiliation":[]},{"given":"Ali","family":"Zaghain","sequence":"additional","affiliation":[]},{"given":"Mahdi","family":"Sajadieh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,26]]},"reference":[{"issue":"1","key":"4245_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2989\/16073606.2015.1023861","volume":"39","author":"E Ballico","year":"2016","unstructured":"Ballico, E., & Elia, M. (2016). On evaluating multivariate polynomials over finite fields. Quaestiones Mathematicae, 39(1), 1\u20138.","journal-title":"Quaestiones Mathematicae"},{"key":"4245_CR2","unstructured":"Blakley, G. R. (1979). Safeguarding cryptography keys. In Proceedings of the AFIPS 1979 national computer conference (pp. 313-317)."},{"issue":"1","key":"4245_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.amc.2004.04.081","volume":"166","author":"C-W Chan","year":"2005","unstructured":"Chan, C.-W., & Chang, C.-C. (2005). A scheme for threshold multi-secret sharing. Applied Mathematics Computation, 166(1), 1\u201314.","journal-title":"Applied Mathematics Computation"},{"key":"4245_CR4","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.amc.2004.01.029","volume":"163","author":"TY Chang","year":"2005","unstructured":"Chang, T. Y., Hwang, M. S., & Yang, W. P. (2005). An improvement on the Lin-Wu (t, n)-threshold verifiable multi-secret sharing scheme. Applied Mathematics Computation, 163, 169\u2013178.","journal-title":"Applied Mathematics Computation"},{"issue":"9","key":"4245_CR5","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1016\/j.aml.2010.04.024","volume":"23","author":"A Das","year":"2010","unstructured":"Das, A., & Adhikari, A. (2010). An efficient multi-use multi-secret sharing scheme based on hash function. Applied Mathematics Letters, 23(9), 993\u2013996.","journal-title":"Applied Mathematics Letters"},{"issue":"3","key":"4245_CR6","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.csi.2007.08.004","volume":"30","author":"MH Dehkordi","year":"2008","unstructured":"Dehkordi, M. H., & Mashhadi, S. (2008). An efficient threshold verifiable multi-secret sharing. Computer Standards and Interfaces, 30(3), 187\u2013190.","journal-title":"Computer Standards and Interfaces"},{"issue":"3","key":"4245_CR7","doi-asserted-by":"crossref","first-page":"1749","DOI":"10.1007\/s11277-015-2310-9","volume":"82","author":"MH Dehkordi","year":"2015","unstructured":"Dehkordi, M. H., & Farzaneh, Y. (2015). A new verifiable multi-secret sharing scheme realizing adversary structure. Wireless Personal Communications, 82(3), 1749\u20131758.","journal-title":"Wireless Personal Communications"},{"issue":"9","key":"4245_CR8","doi-asserted-by":"crossref","first-page":"2262","DOI":"10.1016\/j.ins.2007.11.031","volume":"178","author":"MH Dehkordi","year":"2008","unstructured":"Dehkordi, M. H., & Mashhadi, S. (2008). New efficient and practical verifiable multi-secret sharing schemes. Information Sciences, 178(9), 2262\u20132274.","journal-title":"Information Sciences"},{"issue":"9","key":"4245_CR9","doi-asserted-by":"crossref","first-page":"1777","DOI":"10.1016\/j.comcom.2007.11.014","volume":"31","author":"MH Dehkordi","year":"2008","unstructured":"Dehkordi, M. H., & Mashhadi, S. (2008). Verifiable secret sharing schemes based on non-homogeneous linear recursions and elliptic curves. Computer Communications, 31(9), 1777\u20131784.","journal-title":"Computer Communications"},{"issue":"3","key":"4245_CR10","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":"15","key":"4245_CR11","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"},{"key":"4245_CR12","volume-title":"Cryptography and network security","author":"BA Forouzan","year":"2007","unstructured":"Forouzan, B. A. (2007). Cryptography and network security. New York: McGraw-Hill Inc."},{"key":"4245_CR13","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.jsc.2015.11.013","volume":"75","author":"B Grenet","year":"2016","unstructured":"Grenet, B. (2016). Bounded-degree factors of lacunary multivariate polynomials. Journal of Symbolic Computation, 75, 171\u2013192.","journal-title":"Journal of Symbolic Computation"},{"key":"4245_CR14","unstructured":"Hoffstein J., Pipher J., & Silverman J.H. (1998). NTRU: a ring-based public key cryptosystem. In algorithmic number theory. Lecture notes in computer science, (Vol. 1423, pp. 267-288). Berlin: Springer."},{"issue":"16","key":"4245_CR15","doi-asserted-by":"crossref","first-page":"3059","DOI":"10.1016\/j.ins.2010.04.016","volume":"180","author":"L Harn","year":"2010","unstructured":"Harn, L., & Lin, C. (2010). Strong (n, t, n) verifiable secret sharing scheme. Information Sciences, 180(16), 3059\u20133064.","journal-title":"Information Sciences"},{"key":"4245_CR16","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.tcs.2012.05.006","volume":"445","author":"C Hu","year":"2012","unstructured":"Hu, C., Liao, X., & Cheng, X. (2012). Verifiable multi-secret sharing based on LFSR sequences. Theoretical Computer Science, 445, 52\u201362.","journal-title":"Theoretical Computer Science"},{"key":"4245_CR17","unstructured":"Kouzmenko, R. (2006), Generalizations of the NTRU cryptosystem. Master\u2019s thesis, Polytechnique, Montreal, Canada."},{"key":"4245_CR18","doi-asserted-by":"crossref","unstructured":"Lenstra, A. K., Lenstra, Jr., H. W., Manasse, M. S., & Pollard, J. M. (1990), The number field sieve, In Proceeding of the 22nd annual ACM symposium on theory of computing (pp. 564-572). New York: ACM","DOI":"10.1145\/100216.100295"},{"issue":"6","key":"4245_CR19","doi-asserted-by":"crossref","first-page":"1649","DOI":"10.1007\/BF02831842","volume":"11","author":"P Liaojun","year":"2006","unstructured":"Liaojun, P., Huixian, L., & Yumin, W. (2006). An efficient and secure multi-secret sharing scheme with general access structures. Wuhan University Journal of Natural Sciences, 11(6), 1649\u20131652.","journal-title":"Wuhan University Journal of Natural Sciences"},{"key":"4245_CR20","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":"2","key":"4245_CR21","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1111\/j.1467-9590.2006.00335.x","volume":"116","author":"PJ Olver","year":"2006","unstructured":"Olver, P. J. (2006). On multivariate interpolation. Studies in Applied Mathematics, 116(2), 201\u2013240.","journal-title":"Studies in Applied Mathematics"},{"key":"4245_CR22","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1016\/j.amc.2004.06.120","volume":"167","author":"L-J Pang","year":"2005","unstructured":"Pang, L.-J., & Wang, Y.-M. (2005). A new (t, n) multi-secret sharing scheme based on Shamirs secret sharing. Applied Mathematics Computation, 167, 840\u2013848.","journal-title":"Applied Mathematics Computation"},{"issue":"01","key":"4245_CR23","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1142\/S1793042117500063","volume":"13","author":"S Rosenberg","year":"2017","unstructured":"Rosenberg, S. (2017). Square-free values of multivariate polynomials over function fields in linear sparse sets. International Journal of Number Theory, 13(01), 77\u2013108.","journal-title":"International Journal of Number Theory"},{"issue":"11","key":"4245_CR24","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":"4245_CR25","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":"1","key":"4245_CR26","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/j.amc.2004.08.023","volume":"168","author":"J Shao","year":"2005","unstructured":"Shao, J., & Cao, Z. (2005). A new efficient (t, n) verifiable multi-secret sharing (VMSS) based on YCH scheme. Applied Mathematics and Computation, 168(1), 135\u2013140.","journal-title":"Applied Mathematics and Computation"},{"key":"4245_CR27","doi-asserted-by":"crossref","unstructured":"Shor, P. W. (1994). Algorithms for quantum computation: Discrete logarithms and factoring, In Proceedings, 35th annual symposium on foundations of computer science, IEEE (pp. 124-134).","DOI":"10.1109\/SFCS.1994.365700"},{"key":"4245_CR28","volume-title":"Interpolation","author":"JF Steffensen","year":"2006","unstructured":"Steffensen, J. F. (2006). Interpolation (2nd ed.). New York: Dover Publications, Inc.","edition":"2"},{"issue":"1","key":"4245_CR29","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/s10998-016-0171-y","volume":"74","author":"C Vincze","year":"2016","unstructured":"Vincze, C. (2016). Algebraic dependency of roots of multivariate polynomials and its applications to linear functional equations. Periodica Mathematica Hungarica, 74(1), 112\u2013117.","journal-title":"Periodica Mathematica Hungarica"},{"issue":"2","key":"4245_CR30","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1016\/S0096-3003(03)00355-2","volume":"151","author":"CC Yang","year":"2004","unstructured":"Yang, C. C., Chang, T. Y., & Hwang, M. S. (2004). A (t, n) multi-secret sharing scheme. Applied Mathematics and Computation, 151(2), 483\u2013490.","journal-title":"Applied Mathematics and Computation"},{"key":"4245_CR31","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.ins.2013.08.012","volume":"254","author":"H-D Yuan","year":"2016","unstructured":"Yuan, H.-D. (2016). Secret sharing with multi-cover adaptive steganography. Information Sciences, 254, 197\u2013212.","journal-title":"Information Sciences"},{"issue":"1","key":"4245_CR32","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/j.csi.2006.02.004","volume":"29","author":"J Zhao","year":"2007","unstructured":"Zhao, J., Zhang, J., & Zhao, R. (2007). A practical verifiable multi-secret sharing scheme. Computer Standards and Interfaces, 29(1), 138\u2013141.","journal-title":"Computer Standards and Interfaces"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-017-4245-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-017-4245-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-017-4245-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,21]],"date-time":"2017-08-21T08:36:10Z","timestamp":1503304570000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-017-4245-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,26]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["4245"],"URL":"https:\/\/doi.org\/10.1007\/s11277-017-4245-9","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"type":"print","value":"0929-6212"},{"type":"electronic","value":"1572-834X"}],"subject":[],"published":{"date-parts":[[2017,4,26]]}}}