{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:42:48Z","timestamp":1774946568132,"version":"3.50.1"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319042671","type":"print"},{"value":"9783319042688","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-04268-8_2","type":"book-chapter","created":{"date-parts":[[2014,1,22]],"date-time":"2014-01-22T13:17:57Z","timestamp":1390396677000},"page":"18-38","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Secure Two-Party Computation: A Visual Way"],"prefix":"10.1007","author":[{"given":"Paolo","family":"D\u2019Arco","sequence":"first","affiliation":[]},{"given":"Roberto","family":"De Prisco","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,1,23]]},"reference":[{"issue":"2","key":"2_CR1","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1006\/inco.1996.0076","volume":"129","author":"G Ateniese","year":"1996","unstructured":"Ateniese, G., Blundo, C., De Santis, A., Stinson, D.R.: Visual cryptography for general access structures. Inf. Comput. 129(2), 86\u2013106 (1996)","journal-title":"Inf. Comput."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: Proceedings of 22nd ACM Symposium on Theory of Computing, pp. 503\u2013513 (1990)","DOI":"10.1145\/100216.100287"},{"key":"2_CR3","first-page":"11","volume-title":"IWCC 2011. LNCS","author":"A Beimel","year":"2011","unstructured":"Beimel, A.: Secret-sharing schemes: a survey. In: Chee, Y.M., Guo, Z., Ling, S., Shao, F., Tang, Y., Wang, H., Xing, C. (eds.) IWCC 2011. LNCS, vol. 6639, pp. 11\u201346. Springer, Heidelberg (2011)"},{"key":"2_CR4","unstructured":"Bellare, M., Hoang, V.T., Rogaway, P.: Garbling schemes. Cryptology ePrint archive, report 2012\/265 (2012)"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Robust computational secret sharing and a unified account of classical secret-sharing goals. In: Proceedings of the 14th ACM Conference on Computer and Communications Security (ACM CCS), ACM (2007)","DOI":"10.1145\/1315245.1315268"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1137\/S0895480198336683","volume":"16","author":"C Blundo","year":"2003","unstructured":"Blundo, C., D\u2019Arco, P., De Santis, A., Stinson, D.R.: Contrast optimal threshold visual cryptography schemes. SIAM J. Discrete Math. 16, 224\u2013261 (2003)","journal-title":"SIAM J. Discrete Math."},{"key":"2_CR7","first-page":"253","volume-title":"TCC 2011. LNCS","author":"D Boneh","year":"2011","unstructured":"Boneh, D., Sahai, A., Waters, B.: Functional encryption: definitions and challenges. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 253\u2013273. Springer, Heidelberg (2011)"},{"key":"2_CR8","first-page":"101","volume-title":"CRYPTO 1991. LNCS","author":"RM Capocelli","year":"1992","unstructured":"Capocelli, R.M., De Santis, A., Gargano, L., Vaccaro, U.: On the size of shares for secret sharing schemes. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 101\u2013113. Springer, Heidelberg (1992)"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptol. 13, 143\u2013202 (2000)","journal-title":"J. Cryptol."},{"key":"2_CR10","unstructured":"Chaum, D.: Secret-Ballot receipts and transparent integrity. http:\/\/www.vreceipt.com\/article.pdf"},{"key":"2_CR11","first-page":"235","volume-title":"SCN 2004. LNCS","author":"S Cimato","year":"2005","unstructured":"Cimato, S., De Prisco, R., De Santis, A.: Colored visual cryptography without color darkening. In: Blundo, C., Cimato, S. (eds.) SCN 2004. LNCS, vol. 3352, pp. 235\u2013248. Springer, Heidelberg (2005)"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10623-003-6741-z","volume":"35","author":"S Cimato","year":"2005","unstructured":"Cimato, S., De Prisco, R., De Santis, A.: Optimal colored threshold visual cryptography schemes. Des. Codes. Crypt. 35, 311\u2013335 (2005)","journal-title":"Des. Codes. Crypt."},{"issue":"1","key":"2_CR13","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1093\/comjnl\/bxh152","volume":"49","author":"S Cimato","year":"2006","unstructured":"Cimato, S., De Prisco, R., De Santis, A.: Probabilistic visual cryptography schemes. Comput. J. 49(1), 97\u2013107 (2006)","journal-title":"Comput. J."},{"issue":"1\u20133","key":"2_CR14","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/j.tcs.2007.01.006","volume":"374","author":"S Cimato","year":"2007","unstructured":"Cimato, S., De Prisco, R., De Santis, A.: Colored visual cryptography without color darkening. Theor. Comput. Sci. 374(1\u20133), 261\u2013276 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR15","volume-title":"Visual Cryptography and Secret Image Sharing","year":"2012","unstructured":"Cimato, S., Yang, C.-N. (eds.): Visual Cryptography and Secret Image Sharing. CRC Press, Boca Raton (2012). ISBN: 978-1-4398-3721-4"},{"key":"2_CR16","first-page":"182","volume-title":"ICITS 2011. LNCS","author":"R De Prisco","year":"2011","unstructured":"De Prisco, R., De Santis, A.: Using colors to improve visual cryptography for black and white images. In: Fehr, S. (ed.) ICITS 2011. LNCS, vol. 6673, pp. 182\u2013201. Springer, Heidelberg (2011)"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"De Prisco, R., De Santis, A.: Color visual cryptography schemes for black and white secret image. Theoretical Computer Science. http:\/\/dx.doi.org\/10.1016\/j.tcs.2013.09.005 (to appear)","DOI":"10.1016\/j.tcs.2013.09.005"},{"issue":"6","key":"2_CR18","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Commun. ACM. 28(6), 637\u2013647 (1985)","journal-title":"Commun. ACM."},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1023\/A:1012504516447","volume":"25","author":"PA Eisen","year":"2002","unstructured":"Eisen, P.A., Stinson, D.R.: Threshold visual cryptography schemes with specified whiteness levels of reconstructed pixels. Des. Codes. Crypt. 25, 15\u201361 (2002)","journal-title":"Des. Codes. Crypt."},{"key":"2_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundation Cryptography","author":"O Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundation Cryptography, vol. II. MIT Press, Cambridge (2004)"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: STOC, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"2_CR22","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/978-3-642-14623-7_25","volume-title":"CRYPTO 2010. LNCS","author":"R Gennaro","year":"2010","unstructured":"Gennaro, R., Gentry, C., Parno, B.: Non-interactive verifiable computing: outsourcing computation to untrusted workers. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 465\u2013482. Springer, Heidelberg (2010)"},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/S0304-3975(99)00243-1","volume":"240","author":"T Hofmeister","year":"2000","unstructured":"Hofmeister, T., Krause, M., Simon, H.U.: Contrast-optimal $$k$$ out of $$n$$ secret sharing schemes in visual cryptography. Theor. Comput. Sci. 240, 471\u2013485 (2000)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"2_CR24","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1364\/OL.12.000377","volume":"12","author":"O Kafri","year":"1987","unstructured":"Kafri, O., Keren, E.: Encryption of pictures and shapes by random grids. Opt. Lett. 12(6), 377\u2013379 (1987)","journal-title":"Opt. Lett."},{"issue":"1","key":"2_CR25","first-page":"3551","volume":"29","author":"E Karnin","year":"1983","unstructured":"Karnin, E., Greene, J., Hellman, M.: On secret sharing systems. IEEE Trans. Inf. Theor. 29(1), 3551 (1983)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"2_CR26","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/11593447_8","volume-title":"ASIACRYPT 2005. LNCS","author":"V Kolesnikov","year":"2005","unstructured":"Kolesnikov, V.: Gate evaluation secret sharing and secure one-round two-party computation. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 136\u2013155. Springer, Heidelberg (2005)"},{"key":"2_CR27","first-page":"1","volume-title":"EUROCRYPT 1994. LNCS","author":"M Naor","year":"1995","unstructured":"Naor, M., Shamir, A.: Visual cryptography. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 1\u201312. Springer, Heidelberg (1995)"},{"key":"2_CR28","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00145-008-9036-8","volume":"22","author":"Y Lindell","year":"2009","unstructured":"Lindell, Y., Pinkas, B.: A proof of security of Yao\u2019s protocol for two-party computation. J. Cryptology 22, 161\u2013188 (2009)","journal-title":"J. Cryptology"},{"key":"2_CR29","doi-asserted-by":"publisher","first-page":"1283","DOI":"10.1016\/j.tcs.2009.10.023","volume":"411","author":"T Moran","year":"2010","unstructured":"Moran, T., Naor, M.: Basing cryptographic protocols on tamper-evident seals. Theor. Comput. Sci. 411, 1283\u20131310 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR30","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/j.patrec.2003.12.011","volume":"25","author":"C-N Yang","year":"2004","unstructured":"Yang, C.-N.: New visual secret sharing schemes using probabilistic method. Pattern Recogn. Lett. 25, 481\u2013494 (2004)","journal-title":"Pattern Recogn. Lett."},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: Proceedings of 23rd IEEE Symposium on Foundations of Computational Science, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets (extended abstract). In: Proceedings of 27th IEEE Symposium on Foundations of Computational Science, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-04268-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T20:11:27Z","timestamp":1674245487000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-04268-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319042671","9783319042688"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-04268-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"23 January 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}