{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:14:49Z","timestamp":1761621289943},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,10,31]],"date-time":"2016-10-31T00:00:00Z","timestamp":1477872000000},"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,7]]},"DOI":"10.1007\/s11277-016-3862-z","type":"journal-article","created":{"date-parts":[[2016,10,31]],"date-time":"2016-10-31T04:50:27Z","timestamp":1477889427000},"page":"1495-1504","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["(t, n) Multi-Secret Sharing Scheme Based on Bivariate Polynomial"],"prefix":"10.1007","volume":"95","author":[{"given":"Lein","family":"Harn","sequence":"first","affiliation":[]},{"given":"Ching-Fang","family":"Hsu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,31]]},"reference":[{"issue":"2","key":"3862_CR1","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1109\/TIT.1983.1056651","volume":"30","author":"CA Asmuth","year":"1983","unstructured":"Asmuth, C. A., & 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":"3862_CR2","unstructured":"Blakley, G. R. (1979). Safeguarding cryptographic keys. In Proceedings of AFIPS\u201979 national computer conference (Vol. 48, pp. 313\u2013317). Montvale: AFIPS Press."},{"key":"3862_CR3","unstructured":"Benaloh, J. C. (1987). Secret sharing homomorphisms: Keeping shares of a secret. In Advances in cryptology\u2014CRYPTO\u201986, in LNCS (Vol. 263, pp. 251\u2013260). New York: Springer."},{"key":"3862_CR4","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Ishai, Y., Kushilevitz, E., & Rabin, T. (2001). The round complexity of verifiable secret sharing and secure multicast. In STOC (pp. 580\u2013589).","DOI":"10.1145\/380752.380853"},{"issue":"6","key":"3862_CR5","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1109\/TC.2010.40","volume":"59","author":"L Harn","year":"2010","unstructured":"Harn, L., & Lin, C. (2010). Authenticated group key transfer protocol based on secret sharing. IEEE Transactions on Computers, 59(6), 842\u2013846.","journal-title":"IEEE Transactions on Computers"},{"issue":"9","key":"3862_CR6","doi-asserted-by":"crossref","first-page":"1893","DOI":"10.1109\/TC.2012.251","volume":"62","author":"L Harn","year":"2013","unstructured":"Harn, L. (2013). Group authentication. IEEE Transactions on Computers, 62(9), 1893\u20131898.","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"3862_CR7","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1002\/sec.758","volume":"7","author":"L Harn","year":"2014","unstructured":"Harn, L. (2014). Secure secret reconstruction and multi-secret sharing schemes with unconditional security. Security and Communication Networks, 7(3), 567\u2013573.","journal-title":"Security and Communication Networks"},{"issue":"3","key":"3862_CR8","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1049\/ip-cdt:19951874","volume":"142","author":"L Harn","year":"1995","unstructured":"Harn, L. (1995). Efficient sharing (broadcasting) of multiple secrets. IEE Computers and Digital Techniques, 142(3), 237\u2013240.","journal-title":"IEE Computers and Digital Techniques"},{"issue":"4","key":"3862_CR9","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1049\/el:19950201","volume":"31","author":"L Harn","year":"1995","unstructured":"Harn, L. (1995). Comment multistage secret sharing based on one-way function. Electronic Letters, 31(4), 262.","journal-title":"Electronic Letters"},{"issue":"19","key":"3862_CR10","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. Electronic Letters, 30(19), 1591\u20131592.","journal-title":"Electronic Letters"},{"issue":"2","key":"3862_CR11","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1049\/el:19950073","volume":"31","author":"J He","year":"1995","unstructured":"He, J., & Dawson, E. (1995). Multi-secret sharing scheme based on one-way function. Electronic Letters, 31(2), 93\u201394.","journal-title":"Electronic Letters"},{"key":"3862_CR12","unstructured":"Katz, J., Koo, C., & Kumaresan, R. (2008). Improved the round complexity of VSS in point-to-point networks. In Proceedings of ICALP \u201808, Part II, in: LNCS (Vol. 5126, pp. 499\u2013510). New York: Springer."},{"key":"3862_CR13","doi-asserted-by":"crossref","unstructured":"Kumaresan, R., Patra, A., & Rangan, C. P. (2010). The round complexity of verifiable secret sharing: the statistical case. In Advances in cryptology\u2014ASIACRYPT 2010, in: LNCS (Vol. 6477, pp. 431\u2013447). New York: Springer.","DOI":"10.1007\/978-3-642-17373-8_25"},{"issue":"5","key":"3862_CR14","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1049\/ip-cdt:19990708","volume":"146","author":"TY Lin","year":"1999","unstructured":"Lin, T. Y., & Wu, T. C. (1999). (t,\u00a0n) threshold verifiable multisecret sharing scheme based on factorisation intractability and discrete logarithm modulo a composite problems. IEE Proceedings of Computers & Digital Techniques, 146(5), 264\u2013268.","journal-title":"IEE Proceedings of Computers & Digital Techniques"},{"issue":"1","key":"3862_CR15","first-page":"37","volume":"3","author":"HY Lin","year":"2008","unstructured":"Lin, H. Y., & Yeh, Y. S. (2008). Dynamic multi-secret sharing scheme. International Journal of Contemporary Mathematical Sciences, 3(1), 37\u201342.","journal-title":"International Journal of Contemporary Mathematical Sciences"},{"key":"3862_CR16","doi-asserted-by":"crossref","unstructured":"Mignotte, M. (1983). How to share a secret. In Cryptography-proceedings of the workshop on cryptography, lecture notes in computer science (Vol. 149, pp. 371\u2013375). New York: Springer.","DOI":"10.1007\/3-540-39466-4_27"},{"issue":"4","key":"3862_CR17","first-page":"63","volume":"2","author":"SJ Nirmala","year":"2012","unstructured":"Nirmala, S. J., Bhanu, S. M. S., & Patel, A. A. (2012). A comparative study of the secret sharing algorithms for secure data in the cloud. International Journal on Cloud Computing: Services and Architecture (IJCCSA), 2(4), 63\u201371.","journal-title":"International Journal on Cloud Computing: Services and Architecture (IJCCSA)"},{"key":"3862_CR18","doi-asserted-by":"crossref","unstructured":"Nojoumian, M., & Stinson, D. R. (2012). Social secret sharing in cloud computing using a new trust function. In Proceeding of 2012 tenth annual international conference on privacy, security and trust (pp. 16\u2013167).","DOI":"10.1109\/PST.2012.6297936"},{"key":"3862_CR19","unstructured":"Nikov, V., & Nikova, S. (2005). On proactive secret sharing schemes. In LNCS (Vol. 3357, pp. 308\u2013325). New York: Springer."},{"issue":"11","key":"3862_CR20","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"},{"issue":"1","key":"3862_CR21","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,\u00a0n) verifiable multi-secret sharing (VMSS) based on YCH scheme. Applied Mathematics and Computation, 168(1), 135\u2013140.","journal-title":"Applied Mathematics and Computation"},{"key":"3862_CR22","doi-asserted-by":"crossref","unstructured":"Takahashi, S., & Iwamura, K. (2013). Secret sharing scheme suitable for cloud computing. In Proceeding of 2013 IEEE 27th international conference on advanced information networking and applications (pp. 530\u2013537).","DOI":"10.1109\/AINA.2013.124"},{"key":"3862_CR23","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, 483\u2013490.","journal-title":"Applied Mathematics and Computation"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-016-3862-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-016-3862-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-016-3862-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,8]],"date-time":"2017-08-08T11:07:57Z","timestamp":1502190477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-016-3862-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,31]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["3862"],"URL":"https:\/\/doi.org\/10.1007\/s11277-016-3862-z","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"value":"0929-6212","type":"print"},{"value":"1572-834X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,31]]}}}