{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T15:41:50Z","timestamp":1766158910228},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T00:00:00Z","timestamp":1648684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T00:00:00Z","timestamp":1648684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No.61972168"],"award-info":[{"award-number":["No.61972168"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U21A20428"],"award-info":[{"award-number":["U21A20428"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171134"],"award-info":[{"award-number":["12171134"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s12095-022-00576-5","type":"journal-article","created":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T21:03:59Z","timestamp":1648760639000},"page":"1039-1053","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A new fair multi-secret sharing scheme based on asymmetric bivariate polynomial"],"prefix":"10.1007","volume":"14","author":[{"given":"Fulin","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiayun","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shixin","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,31]]},"reference":[{"issue":"11","key":"576_CR1","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"576_CR2","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. IEEE Computer Society, 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"576_CR3","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwassser, S, Macalis, et al.: Verifiable secret sharing and achieving simultanrity in presence of fault. In: Proceeding of IEEE 26th Symposium on Foudation of Computer Science(FOCS), 383\u2013395 (1985)","DOI":"10.1109\/SFCS.1985.64"},{"key":"576_CR4","doi-asserted-by":"crossref","unstructured":"Liu, Y., Yang, C., Wang, Y., et al.: Cheating identifiable secret sharing scheme using symmetric bivariate polynomial. Inform. Sci., 453 (2018)","DOI":"10.1016\/j.ins.2018.04.043"},{"issue":"3","key":"576_CR5","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1002\/sec.758","volume":"7","author":"L Harn","year":"2014","unstructured":"Harn, L.: Secure secret reconstruction and multi-secret sharing schemes with unconditional security. Secur. Commun. Netw. 7(3), 567\u2013573 (2014)","journal-title":"Secur. Commun. Netw."},{"issue":"2","key":"576_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11277-016-3862-z","volume":"95","author":"L Harn","year":"2017","unstructured":"Harn, L., Hsu, C.F.: (T,n) multi-secret sharing scheme based on bivariate polynomial. Wirel. Pers. Commun. 95(2), 1\u201310 (2017)","journal-title":"Wirel. Pers. Commun."},{"key":"576_CR7","first-page":"1","volume":"23","author":"L Harn","year":"2015","unstructured":"Harn, L., Lin, C., Li, Y.: Fair secret reconstruction in (t,n) secret sharing. J. Inf. Secur. Appl. 23, 1\u20137 (2015)","journal-title":"J. Inf. Secur. Appl."},{"issue":"3","key":"576_CR8","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF02252871","volume":"1","author":"M Tompa","year":"1989","unstructured":"Tompa, M., Woll, H.: How to share a secret with cheaters. J. Cryptol. 1(3), 133\u2013138 (1989)","journal-title":"J. Cryptol."},{"issue":"2","key":"576_CR9","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1049\/iet-ifs.2012.0064","volume":"7","author":"J Y Tian","year":"2013","unstructured":"Y Tian, J, Ma, C, et al.: Peng Fair (t,n) threshold secret sharing scheme. IET Inf. Secur. 7(2), 106\u2013122 (2013)","journal-title":"IET Inf. Secur."},{"key":"576_CR10","unstructured":"William Gilbert Strang, G.S.: Introduction to Linear Algebra. Harper and Row (1963)"},{"key":"576_CR11","doi-asserted-by":"crossref","unstructured":"Peled, D., Vardi, Y., Yannakakis, M.: Black box checking. Formal Methods for Protocol Engineering and Distributed Systems Springer US (1999)","DOI":"10.1007\/978-0-387-35578-8_13"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-022-00576-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-022-00576-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-022-00576-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,18]],"date-time":"2022-08-18T10:20:52Z","timestamp":1660818052000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-022-00576-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,31]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["576"],"URL":"https:\/\/doi.org\/10.1007\/s12095-022-00576-5","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,31]]},"assertion":[{"value":"12 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}