{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T06:43:10Z","timestamp":1771483390859,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4794,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1016\/s0304-3975(99)00243-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:58:49Z","timestamp":1027605529000},"page":"471-485","source":"Crossref","is-referenced-by-count":97,"title":["Contrast-optimal k out of n secret sharing schemes in visual cryptography"],"prefix":"10.1016","volume":"240","author":[{"given":"Thomas","family":"Hofmeister","sequence":"first","affiliation":[]},{"given":"Matthias","family":"Krause","sequence":"additional","affiliation":[]},{"given":"Hans U.","family":"Simon","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00243-1_BIB1","doi-asserted-by":"crossref","unstructured":"G. Ateniese, C. Blundo, A. De Santis, D.R. Stinson, Visual cryptography for general access structures, Proc. ICALP 96, Springer, Berlin, 1996, pp. 416\u2013428.","DOI":"10.1006\/inco.1996.0076"},{"key":"10.1016\/S0304-3975(99)00243-1_BIB2","series-title":"\u201cAdvances in Cryptology\u201d \u2014 CRYPTO \u201996","first-page":"401","article-title":"New results on visual cryptography","author":"Droste","year":"1996"},{"key":"10.1016\/S0304-3975(99)00243-1_BIB3","series-title":"Introduction to Finite Fields and their Applications","author":"Lidl","year":"1994"},{"key":"10.1016\/S0304-3975(99)00243-1_BIB4","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF02128670","article-title":"Approximate inclusion\u2013exclusion","volume":"10","author":"Linial","year":"1990","journal-title":"Combinatorica"},{"key":"10.1016\/S0304-3975(99)00243-1_BIB5","series-title":"A Course in Combinatorics","author":"van Lint","year":"1996"},{"key":"10.1016\/S0304-3975(99)00243-1_BIB6","series-title":"\u201cAdvances in Cryptology \u2014 Eurocrypt 94\u201d","first-page":"1","article-title":"Visual Cryptography","author":"Naor","year":"1995"},{"key":"10.1016\/S0304-3975(99)00243-1_BIB7","first-page":"69","article-title":"Visual cryptography II","volume":"vol. 1189","author":"Naor","year":"1997"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002431?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002431?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T21:58:58Z","timestamp":1556488738000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599002431"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0304397599002431"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00243-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}