{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T18:04:37Z","timestamp":1725645877967},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540649380"},{"type":"electronic","value":"9783642722837"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/978-3-642-72283-7_1","type":"book-chapter","created":{"date-parts":[[2011,12,23]],"date-time":"2011-12-23T17:16:30Z","timestamp":1324660590000},"page":"3-12","source":"Crossref","is-referenced-by-count":0,"title":["Visual Cryptography \u2014 How to Use Images to Share a Secret"],"prefix":"10.1007","author":[{"given":"Ingrid","family":"Biehl","sequence":"first","affiliation":[]},{"given":"Bernd","family":"Meyer","sequence":"additional","affiliation":[]},{"given":"Susanne","family":"Wetzel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","volume-title":"Electronic Colloquium on Computational Complexity (TR96-012)","author":"G Ateniese","year":"1996","unstructured":"Ateniese, G., Blundo, C., De Santis, A., and Stinson, D.R.: Visual Cryptography for General Access Structures. Information and Computation, Vol. 129, No. 2, pp. 86\u2013106,1996 and ECCC, Electronic Colloquium on Computational Complexity (TR96-012), 1996."},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Ateniese, G., Blundo, C., De Santis, A., and Stinson, D.R.: Constructions and Bounds for Visual Cryptography. Proc. 23rd International Colloquium on Au-tomata, Languages and Programming (ICALP \u201996), Springer Lecture Notes in Computer Science, pp. 416\u2013428, 1996.","DOI":"10.1007\/3-540-61440-0_147"},{"key":"1_CR3","volume-title":"Extended Schemes for Visual Cryptography","author":"G Ateniese","year":"1995","unstructured":"Ateniese, G., Blundo, C., De Santis, A., and Stinson, D.R.: Extended Schemes for Visual Cryptography. Preprint, 1995."},{"key":"1_CR4","volume-title":"Preprint","author":"G Ateniese","year":"1996","unstructured":"Ateniese, G., Blundo, C., De Santis, A., and Stinson, D.R.: New Schemes for Visual Cryptography. Preprint, 1996."},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Biehl, I., and Wetzel, S.: Traceable Visual Cryptography. Proc. ICICS \u201997, Springer Lecture Notes on Computer Science, pp. 61\u201371, 1997.","DOI":"10.1007\/BFb0028462"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"JL Carter","year":"1979","unstructured":"Carter, J.L., and Wegman, M.N.: Universal Classes of Hash Functions. Journal of Computer and System Sciences 18, pp 143\u2013154, 1979.","journal-title":"Journal of Computer and System Sciences"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Droste, S.: New Results on Visual Cryptography. Proc. CRYPTO \u201996, Springer Lecture Notes in Computer Science, pp. 401\u2013415, 1996.","DOI":"10.1007\/3-540-68697-5_30"},{"key":"1_CR8","first-page":"176","volume-title":"Proc. COCOON \u201997, Springer Lecture Notes in Computer Science","author":"T Hofmeister","year":"1997","unstructured":"Hofmeister, T., Krause, M., and Simon, H.U.: Contrast-Optimal k out of n Secret Sharing Schemes in Visual Cryptography. Proc. COCOON \u201997, Springer Lecture Notes in Computer Science, pp. 176 \u2013 185, 1997."},{"key":"1_CR9","first-page":"1","volume-title":"Proc. EUROCRYPT \u201994, Springer Lecture Notes in Computer Science","author":"M Naor","year":"1995","unstructured":"Naor, M., and Shamir, A.: Visual Cryptography. Proc. EUROCRYPT \u201994, Springer Lecture Notes in Computer Science, pp. 1\u201312, 1995."},{"key":"1_CR10","unstructured":"Naor, M., and Shamir, A.: Visual Cryptography II: Improving the Contrast via the Cover Base. Proc. Security Protocols: International Workshop 1996, Springer Lecture Notes in Computer Science, pp. 69\u201374, 1997."},{"key":"1_CR11","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. Comm. of the ACM, Vol. 22, pp. 612\u2013613, 1979.","journal-title":"Comm. of the ACM"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"MN Wegman","year":"1981","unstructured":"Wegman, M.N., and Carter, J.L.: New Hash Functions and their Use in Authenti-cation and Set Equality. Journal of Computer and System Sciences 22, pp 265\u2013279, 1981.","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Informatik aktuell","Informatik \u201998"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-72283-7_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,6]],"date-time":"2021-05-06T12:29:39Z","timestamp":1620304179000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-72283-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540649380","9783642722837"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-72283-7_1","relation":{},"ISSN":["1431-472X"],"issn-type":[{"type":"print","value":"1431-472X"}],"subject":[],"published":{"date-parts":[[1998]]}}}