{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:56:30Z","timestamp":1753883790014,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671411"},{"type":"electronic","value":"9783540465416"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46541-3_52","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T16:03:24Z","timestamp":1186070604000},"page":"626-638","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Randomness in Visual Cryptography"],"prefix":"10.1007","author":[{"given":"Annalisa","family":"De Bonis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfredo","family":"De Santis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"key":"52_CR1","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1006\/inco.1996.0076","volume":"129-2","author":"G. Ateniese","year":"1996","unstructured":"G. Ateniese, C. Blundo, A. De Santis, and D. R. Stinson, Visual Cryptography for General Access Structures. Information and Computation 129-2, 86\u2013106 (1996).","journal-title":"Information and Computation"},{"key":"52_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/3-540-61440-0_147","volume-title":"ICALP 1996","author":"G. Ateniese","year":"1996","unstructured":"G. Ateniese, C. Blundo, A. De Santis, and D. R. Stinson, Constructions and Bounds for Visual Cryptography. ICALP 1996, LNCS 1099, 416\u2013428."},{"key":"52_CR3","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1002\/(SICI)1520-6610(1996)4:5<353::AID-JCD4>3.0.CO;2-E","volume":"4","author":"M. Atici","year":"1996","unstructured":"M. Atici, S. S. Magliveras, D. R. Stinson, and W.-D. Wei, Some Recursive Constructions for Perfect Hash Families. Journal of Comb. Design, 4, 352\u2013363 (1996).","journal-title":"Journal of Comb. Design"},{"issue":"3","key":"52_CR4","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1109\/18.335890","volume":"40","author":"A. Beimel","year":"1994","unstructured":"A. Beimel and B. Chor, Universally ideal secret sharing schemes. IEEE Trans. Inform. Theory, 40(3), 786\u2013794 (1994).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"52_CR5","unstructured":"C. Blundo, P. D\u2019Arco, A. De Santis, and D. R. Stinson, Contrast Optimal Threshold Visual Cryptography Schemes. submitted for publication (1998)."},{"key":"52_CR6","unstructured":"C. Blundo and A. De Bonis, New Constructions for Visual Cryptography. Proc. ICTCS\u2019 98, P. Degano, U. Vaccaro, G. Pirillo, (Eds.), 290\u2013303, World Scientific."},{"key":"52_CR7","unstructured":"C. Blundo, A. De Santis, and D. R. Stinson, On the Contrast in Visual Cryptography Schemes. To appear on Journal of Cryptology. Available also at Theory of Cryptography Library as ftp:\/\/theory.lcs.mit.edu\/pub\/tcryptol\/96-13.ps ."},{"key":"52_CR8","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/inco.1996.0095","volume":"131","author":"C. Blundo","year":"1996","unstructured":"C. Blundo, A. De Santis, and U. Vaccaro, Randomness in Distribution Protocols. Information and Computation, 131, 111\u2013139 (1996).","journal-title":"Information and Computation"},{"key":"52_CR9","unstructured":"A. De Bonis and A. De Santis, Visual and Non-Visual Secret Sharing Schemes. submitted for publication."},{"issue":"1","key":"52_CR10","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1137\/0605009","volume":"5","author":"Michael L. Fredman","year":"1984","unstructured":"M. L. Fredman and J. Koml\u00f3s, On the Size of Separating System and Families of Perfect Hash Functions. SIAM J. Alg. Disc. Math., 5(1), 1984.","journal-title":"SIAM Journal on Algebraic Discrete Methods"},{"key":"52_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/BFb0045084","volume-title":"COCOON\u2019 97","author":"T. Hofmeister","year":"1997","unstructured":"T. Hofmeister, M. Krause, and H. U. Simon, Contrast-Optimal k out of n Secret Sharing Schemes in Visual Cryptography. COCOON\u2019 97, LNCS 1276, 176\u2013185."},{"key":"52_CR12","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo and D. Zuckerman, How to Recycle Random Bits. Proc. 21st Annual ACM Symp. on Theory of Computing, 248\u2013255 (1989).","DOI":"10.1109\/SFCS.1989.63486"},{"key":"52_CR13","doi-asserted-by":"crossref","unstructured":"M. Mehlhorn, On the Program Size of Perfect and Universal Hash Functions. Proc. 23rd IEEE Symp. on Foundations of Comp. Science, 170\u2013175 (1982).","DOI":"10.1109\/SFCS.1982.80"},{"key":"52_CR14","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Visual Cryptography","author":"M. Naor","year":"1995","unstructured":"M. Naor and A. Shamir, Visual Cryptography. LNCS 950, 1\u201312 (1995)."},{"key":"52_CR15","unstructured":"D. R. Stinson, An Introduction to Visual Cryptography. Presented at Public Key Solutions\u2019 97, Toronto, Canada, April 28\u201330 (1997). Available as http:\/\/bibd.unl.edu\/stinson\/VKS-PKS.ps ."},{"key":"52_CR16","unstructured":"D. R. Stinson and R. Wei, New Constructions for Perfect Hash Families and Related Structures using Combinatorial Designs and Codes. preprint."},{"key":"52_CR17","first-page":"72","volume":"1","author":"G. J. Simmons","year":"1991","unstructured":"G. J. Simmons, W.-A. Jackson, and K. Martin, Decomposition Constructions for Secret Sharing Schemes. Bulletin of the ICA, 1:72\u201388 (1991).","journal-title":"Bulletin of the ICA"},{"key":"52_CR18","doi-asserted-by":"crossref","unstructured":"D. Zuckerman, Simulating BPP Using a General Weak Random Source. Proc. 32nd IEEE Symp. on Foundations of Comp. Science, 79\u201389 (1991).","DOI":"10.1109\/SFCS.1991.185351"}],"container-title":["Lecture Notes in Computer Science","STACS 2000"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46541-3_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T02:56:17Z","timestamp":1737341777000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46541-3_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671411","9783540465416"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-46541-3_52","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"24 March 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}