{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T18:48:53Z","timestamp":1723574933017},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2005,9,1]],"date-time":"2005-09-01T00:00:00Z","timestamp":1125532800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Applied Mathematics and Computation"],"published-print":{"date-parts":[[2005,9]]},"DOI":"10.1016\/j.amc.2004.08.023","type":"journal-article","created":{"date-parts":[[2004,10,21]],"date-time":"2004-10-21T18:48:22Z","timestamp":1098384502000},"page":"135-140","source":"Crossref","is-referenced-by-count":52,"title":["A new efficient (t,n) verifiable multi-secret sharing (VMSS) based on YCH scheme"],"prefix":"10.1016","volume":"168","author":[{"given":"Jun","family":"Shao","sequence":"first","affiliation":[]},{"given":"Zhenfu","family":"Cao","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.amc.2004.08.023_bib1","doi-asserted-by":"crossref","unstructured":"G.R. Blakley, Safeguarding cryptographic keys, in: Proc. AFIPS 1979 NCC, vol. 48, Arlington, VA, June 1979, pp. 313\u2013317.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"10.1016\/j.amc.2004.08.023_bib2","series-title":"Proceeding of 26th IEEE Symposium on Foundations of Computer Science [C]","article-title":"Verifiable secret sharing and achieving simultaneity in the presence of faults [A]","author":"Chor","year":"1985"},{"key":"10.1016\/j.amc.2004.08.023_bib3","series-title":"Proceedings of the Second Australisian Conference on Information Security and Privacy\u2013\u2013ACISP\u201997 [C]","article-title":"Secret sharing with reusable polynomials [A]","author":"Chen","year":"1997"},{"issue":"12","key":"10.1016\/j.amc.2004.08.023_bib4","first-page":"2762","article-title":"A practical (t,n) multi-secret sharing scheme","volume":"E83-A","author":"Chien","year":"2000","journal-title":"IEICE Trans. Fundam."},{"key":"10.1016\/j.amc.2004.08.023_bib5","series-title":"Proceedings of 28th IEEE Symposium on Foundations of Computer Science [C]","article-title":"A practical scheme for non-interactive verifiable secret sharing [A]","author":"Feldman","year":"1987"},{"issue":"3","key":"10.1016\/j.amc.2004.08.023_bib6","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1049\/ip-cdt:19951874","article-title":"Efficient sharing (broadcasting) of multiple secrets [J]","volume":"142","author":"Harn","year":"1995","journal-title":"IEE Proc. Comput. Digit. Tech."},{"key":"10.1016\/j.amc.2004.08.023_bib7","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","article-title":"How to share a secret","volume":"22","author":"Shamir","year":"1979","journal-title":"Commun. ACM"},{"key":"10.1016\/j.amc.2004.08.023_bib8","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1016\/S0096-3003(03)00355-2","article-title":"A (t,n) multi-secret sharing scheme","volume":"151","author":"Yang","year":"2004","journal-title":"Appl. Math. Comput."}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300304005922?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300304005922?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T12:08:15Z","timestamp":1585915695000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096300304005922"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,9]]}},"alternative-id":["S0096300304005922"],"URL":"https:\/\/doi.org\/10.1016\/j.amc.2004.08.023","relation":{},"ISSN":["0096-3003"],"issn-type":[{"value":"0096-3003","type":"print"}],"subject":[],"published":{"date-parts":[[2005,9]]}}}