{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T22:59:34Z","timestamp":1756076374397},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540614401"},{"type":"electronic","value":"9783540685807"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61440-0_147","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:38:49Z","timestamp":1330274329000},"page":"416-428","source":"Crossref","is-referenced-by-count":56,"title":["Constructions and bounds for visual cryptography"],"prefix":"10.1007","author":[{"given":"Giuseppe","family":"Ateniese","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlo","family":"Blundo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfrede","family":"Santis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas R.","family":"Stinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"35_CR1","unstructured":"G. Ateniese, C. Blundo, A. De Santis, and D. R. Stinson, Visual Cryptography for General Access Structures. Available from ECCC, Electronic Colloquium on Computational Complexity (TR96-012), via WWW using http:\/\/www.eccc.uni-trier.de\/eccc\/."},{"key":"35_CR2","unstructured":"G. Ateniese, C. Blundo, A. De Santis, and D. R. Stinson, Extended Schemes for Visual Cryptography, preprint, 1995."},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"M. Atici, S. S. Magliveras, D. R. Stinson, and W.-D. Wei, Some Recursive Constructions for Perfect Hash Families, Technical Report UNL, Univ. of NebraskaLincoln, June 1995.","DOI":"10.1002\/(SICI)1520-6610(1996)4:5<353::AID-JCD4>3.3.CO;2-6"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF00204801","volume":"8","author":"C. Blundo","year":"1995","unstructured":"C. Blundo, A. De Santis, D. R. Stinson, and U. Vaccaro, Graph Decomposition and Secret Sharing Schemes, Journal of Cryptology, Vol. 8, (1995), pp. 39\u201364.","journal-title":"Journal of Cryptology"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"M. L. Fredman and J. Koml\u00f3s, On the Size of Separating System and Families of Perfect Hash Functions, SIAM J. Alg. Disc. Meth., Vol 5, No 1, March 1984.","DOI":"10.1137\/0605009"},{"key":"35_CR6","unstructured":"J. H. van Lint and R. M. Wilson, A Course in Combinatorics, Cambridge University Press, (1992)."},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"K. Melhorn, On the Program Size of Perfect and Universal Hash Functions, in Proc. of 23rd Annual IEEE Symposium on Foundation of Computer Science, pp. 170\u2013175, 1982.","DOI":"10.1109\/SFCS.1982.80"},{"key":"35_CR8","series-title":"Vol. 950 of Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology \u2014 Eurocrypt '94","author":"M. Naor","year":"1995","unstructured":"M. Naor and A. Shamir, Visual Cryptography, in \u201cAdvances in Cryptology \u2014 Eurocrypt '94\u201d, A. De Santis Ed., Vol. 950 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 1\u201312, 1995."},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"P. Elias, Zero Error Capacity Under List Decoding, IEEE Trans. Inform. Theory, Vol. 34, 1988.","DOI":"10.1109\/18.21233"},{"key":"35_CR10","first-page":"71","volume":"1","author":"G. J. Simmons","year":"1991","unstructured":"G. J. Simmons, W. Jackson, and K. Martin, The Geometry of Shared Secret Schemes, Bulletin of the ICA, 1:71\u201388, 1991.","journal-title":"Bulletin of the ICA"},{"key":"35_CR11","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1109\/18.272461","volume":"40","author":"D. R. Stinson","year":"1994","unstructured":"D. R. Stinson, Decomposition Constructions for Secret Sharing Schemes, IEEE Trans. Inform. Theory, Vol. 40, pp. 118\u2013125, 1994.","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61440-0_147.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:06:17Z","timestamp":1605629177000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61440-0_147"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614401","9783540685807"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-61440-0_147","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}