{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T04:13:29Z","timestamp":1749615209263,"version":"3.41.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319470719"},{"type":"electronic","value":"9783319470726"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","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":[[2016]]},"DOI":"10.1007\/978-3-319-47072-6_11","type":"book-chapter","created":{"date-parts":[[2016,9,21]],"date-time":"2016-09-21T01:20:20Z","timestamp":1474420820000},"page":"165-180","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Securing Multiparty Protocols Against the Exposure of Data to Honest Parties"],"prefix":"10.1007","author":[{"given":"Peeter","family":"Laud","sequence":"first","affiliation":[]},{"given":"Alisa","family":"Pankova","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,22]]},"reference":[{"key":"11_CR1","unstructured":"Schneier, B.: Data is a toxic asset, March 2016. https:\/\/www.schneier.com\/blog\/archives\/2016\/03\/data_is_a_toxic.html"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: FOCS, pp. 136\u2013145. IEEE Computer Society (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-32009-5_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"J Alwen","year":"2012","unstructured":"Alwen, J., Katz, J., Maurer, U., Zikas, V.: Collusion-preserving computation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 124\u2013143. Springer, Heidelberg (2012)"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-642-32928-9_16","volume-title":"Security and Cryptography for Networks","author":"R Canetti","year":"2012","unstructured":"Canetti, R., Vald, M.: Universally composable security with local adversaries. In: Visconti, I., De Prisco, R. (eds.) SCN 2012. LNCS, vol. 7485, pp. 281\u2013301. Springer, Heidelberg (2012)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/3-540-48184-2_10","volume-title":"Advances in Cryptology - CRYPTO 1987","author":"Z Galil","year":"1988","unstructured":"Galil, Z., Haber, S., Yung, M.: Cryptographic computation: secure fault tolerant protocols and the public-key model. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 135\u2013155. Springer, Heidelberg (1988)"},{"issue":"2","key":"11_CR6","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s00145-009-9040-7","volume":"23","author":"Y Aumann","year":"2010","unstructured":"Aumann, Y., Lindell, Y.: Security against covert adversaries: efficient protocols for realistic adversaries. J. Cryptol. 23(2), 281\u2013343 (2010)","journal-title":"J. Cryptol."},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Mohassel, P., Rosulek, M., Zhang, Y.: Fast, secure three-party computation: the garbled circuit approach. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security (CCS 2015), pp. 591\u2013602, New York, NY, USA. ACM (2015)","DOI":"10.1145\/2810103.2813705"},{"key":"11_CR8","unstructured":"Maurer, U., Renner, R.: Abstract cryptography. In: Chazelle, B., (ed.) Innovations in Computer Science - ICS, 7\u20139 January 2011, Tsinghua University, Beijing, China, pp. 1\u201321. Tsinghua University Press (2010)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-540-85174-5_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"J Alwen","year":"2008","unstructured":"Alwen, J., Shelat, A., Visconti, I.: Collusion-free protocols in the mediated model. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 497\u2013514. Springer, Heidelberg (2008)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/978-3-642-03356-8_31","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"J Alwen","year":"2009","unstructured":"Alwen, J., Katz, J., Lindell, Y., Persiano, G., shelat, a, Visconti, I.: Collusion-free multiparty computation in the mediated model. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 524\u2013540. Springer, Heidelberg (2009)"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Lepinski, M., Micali, S., Shelat, A.: Collusion-free protocols. In: Gabow, H.N., Fagin, R., (eds.) Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, 22\u201324 May 2005, pp. 543\u2013552. ACM (2005)","DOI":"10.1145\/1060590.1060671"},{"key":"11_CR12","unstructured":"Halevi, S., Karger, P.A., Naor, D.: Enforcing confinement in distributed storage and a cryptographic model for access control. IACR Cryptology ePrint Archive 2005, p. 169 (2005)"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-70936-7_4","volume-title":"Theory of Cryptography","author":"R Canetti","year":"2007","unstructured":"Canetti, R., Dodis, Y., Pass, R., Walfish, S.: Universally composable security with global setup. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 61\u201385. Springer, Heidelberg (2007)"},{"key":"11_CR14","unstructured":"Laud, P., Pankova, A.: Securing multiparty protocols against the exposure of data to honest parties. Cryptology ePrint Archive, Report 2016\/650 (2016). http:\/\/eprint.iacr.org\/2016\/650"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-642-11799-2_9","volume-title":"Theory of Cryptography","author":"I Damg\u00e5rd","year":"2010","unstructured":"Damg\u00e5rd, I., Geisler, M., Nielsen, J.B.: From passive to covert security at low cost. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 128\u2013145. Springer, Heidelberg (2010)"},{"key":"11_CR16","unstructured":"Laud, P., Pankova, A.: Preprocessing-based verification of multiparty protocols with honest majority. Cryptology ePrint Archive, Report 2015\/674 (2015). http:\/\/eprint.iacr.org\/"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC, pp. 218\u2013229. ACM (1987)","DOI":"10.1145\/28395.28420"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: Reif, J.H., (ed.) Proceedings on 34th Annual ACM Symposium on Theory of Computing, 19\u201321 May 2002, Montr\u00e9al, Qu\u00e9bec, Canada, pp. 494\u2013503. ACM (2002)","DOI":"10.1145\/509978.509980"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. IACR Cryptology ePrint Archive 2002, p. 140 (2002)","DOI":"10.1145\/509978.509980"}],"container-title":["Lecture Notes in Computer Science","Data Privacy Management and Security Assurance"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-47072-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T20:21:47Z","timestamp":1749586907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-47072-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319470719","9783319470726"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-47072-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 September 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}