{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T01:25:28Z","timestamp":1775265928127,"version":"3.50.1"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030038090","type":"print"},{"value":"9783030038106","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-03810-6_10","type":"book-chapter","created":{"date-parts":[[2018,11,7]],"date-time":"2018-11-07T16:30:29Z","timestamp":1541608229000},"page":"255-281","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Best Possible Information-Theoretic MPC"],"prefix":"10.1007","author":[{"given":"Shai","family":"Halevi","sequence":"first","affiliation":[]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[]},{"given":"Eyal","family":"Kushilevitz","sequence":"additional","affiliation":[]},{"given":"Tal","family":"Rabin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,8]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Feigenbaum, J., Kilian, J.: On hiding information from an oracle (extended abstract). In: Aho, A. (ed.) 19th ACM STOC, pp. 195\u2013203. ACM Press, May 1987","DOI":"10.1145\/28395.28417"},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"Agarwal, N., Anand, S., Prabhakaran, M.: Brief announcement: on secure m-party computation, commuting permutation systems and unassisted non-interactive MPC. In: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, 9\u201313 July 2018, Prague, Czech Republic, pp. 103:1\u2013103:4 (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.103","DOI":"10.4230\/LIPIcs.ICALP.2018.103"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: lightweight sublinear arguments without a trusted setup. In: CCS, pp. 2087\u20132104. ACM (2017)","DOI":"10.1145\/3133956.3134104"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-662-44381-1_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"A Beimel","year":"2014","unstructured":"Beimel, A., Gabizon, A., Ishai, Y., Kushilevitz, E., Meldgaard, S., Paskin-Cherniavsky, A.: Non-interactive secure multiparty computation. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 387\u2013404. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_22"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-48405-1_6","volume-title":"Advances in Cryptology \u2014 CRYPTO 1999","author":"A Beimel","year":"1999","unstructured":"Beimel, A., Malkin, T., Micali, S.: The all-or-nothing nature of two-party secure computation. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 80\u201397. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_6"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: 20th ACM STOC, pp. 1\u201310. ACM Press, May 1988","DOI":"10.1145\/62212.62213"},{"key":"10_CR7","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-47721-7_19","volume-title":"CRYPTO 1986","author":"JC Benaloh","year":"1987","unstructured":"Benaloh, J.C.: Secret sharing homomorphisms: keeping shares of a secret sharing. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 251\u2013260. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_19"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-319-63688-7_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"F Benhamouda","year":"2017","unstructured":"Benhamouda, F., Krawczyk, H., Rabin, T.: Robust non-interactive multiparty computation against constant-size collusion. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 391\u2013419. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_13"},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D Chaum","year":"1988","unstructured":"Chaum, D.: The dining cryptographers problem: unconditional sender and recipient untraceability. J. Cryptol. 1(1), 65\u201375 (1988)","journal-title":"J. Cryptol."},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/0-387-34805-0_52","volume-title":"Advances in Cryptology \u2014 CRYPTO 1989 Proceedings","author":"D Chaum","year":"1990","unstructured":"Chaum, D.: The spymasters double-agent problem. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 591\u2013602. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_52"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: 20th ACM STOC, pp. 11\u201319. ACM Press, May 1988","DOI":"10.1145\/62212.62214"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Chor, B., Kushilevitz, E.: A zero-one law for Boolean privacy (extended abstract). In: 21st ACM STOC, pp. 62\u201372. ACM Press, May 1989","DOI":"10.1145\/73007.73013"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1137\/0404004","volume":"4","author":"B Chor","year":"1991","unstructured":"Chor, B., Kushilevitz, E.: A zero-one law for Boolean privacy. SIAM J. Discrete Math. 4, 36\u201347 (1991)","journal-title":"SIAM J. Discrete Math."},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-540-30576-7_19","volume-title":"Theory of Cryptography","author":"R Cramer","year":"2005","unstructured":"Cramer, R., Damg\u00e5rd, I., Ishai, Y.: Share conversion, pseudorandom secret-sharing and applications to secure computation. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 342\u2013362. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_19"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/3-540-39200-9_37","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"R Cramer","year":"2003","unstructured":"Cramer, R., Fehr, S., Ishai, Y., Kushilevitz, E.: Efficient multi-party computation over rings. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 596\u2013613. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_37"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/11535218_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"I Damg\u00e5rd","year":"2005","unstructured":"Damg\u00e5rd, I., Ishai, Y.: Constant-round multiparty computation using a black-box pseudorandom generator. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 378\u2013394. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_23"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/11818175_30","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"I Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I., Ishai, Y.: Scalable secure multiparty computation. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 501\u2013520. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_30"},{"issue":"5","key":"10_CR18","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/229459.229469","volume":"39","author":"R Fagin","year":"1996","unstructured":"Fagin, R., Naor, M., Winkler, P.: Comparing information without leaking it. Commun. ACM 39(5), 77\u201385 (1996). https:\/\/doi.org\/10.1145\/229459.229469","journal-title":"Commun. ACM"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Feige, U., Kilian, J., Naor, M.: A minimal model for secure computation (extended abstract). In: 26th ACM STOC, pp. 554\u2013563. ACM Press, May 1994","DOI":"10.1145\/195058.195408"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Franklin, M.K., Yung, M.: Communication complexity of secure computation (extended abstract). In: 24th ACM STOC, pp. 699\u2013710. ACM Press, May 1992","DOI":"10.1145\/129712.129780"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/3-540-48405-1_37","volume-title":"Advances in Cryptology \u2014 CRYPTO 1999","author":"N Gilboa","year":"1999","unstructured":"Gilboa, N., Ishai, Y.: Compressing cryptographic resources. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 591\u2013608. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_37"},{"key":"10_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography: Basic Applications","author":"O Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Applications. Cambridge University Press, New York (2004)"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-540-70936-7_11","volume-title":"Theory of Cryptography","author":"S Goldwasser","year":"2007","unstructured":"Goldwasser, S., Rothblum, G.N.: On best-possible obfuscation. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 194\u2013213. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_11"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-319-70700-6_7","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"S Halevi","year":"2017","unstructured":"Halevi, S., Ishai, Y., Jain, A., Komargodski, I., Sahai, A., Yogev, E.: Non-interactive multiparty computation without correlated randomness. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10626, pp. 181\u2013211. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70700-6_7"},{"key":"10_CR25","doi-asserted-by":"publisher","unstructured":"Halevi, S., Ishai, Y., Jain, A., Kushilevitz, E., Rabin, T.: Secure multiparty computation with general interaction patterns. In: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, Cambridge, MA, USA, 14\u201316 January 2016, pp. 157\u2013168 (2016). https:\/\/doi.org\/10.1145\/2840728.2840760","DOI":"10.1145\/2840728.2840760"},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-22792-9_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"S Halevi","year":"2011","unstructured":"Halevi, S., Lindell, Y., Pinkas, B.: Secure computation on the web: computing without simultaneous interaction. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 132\u2013150. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_8"},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-642-20728-0_15","volume-title":"Information Theoretic Security","author":"M Hirt","year":"2011","unstructured":"Hirt, M., Lucas, C., Maurer, U., Raub, D.: Graceful degradation in multi-party computation (extended abstract). In: Fehr, S. (ed.) ICITS 2011. LNCS, vol. 6673, pp. 163\u2013180. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20728-0_15"},{"issue":"1","key":"10_CR28","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s001459910003","volume":"13","author":"M Hirt","year":"2000","unstructured":"Hirt, M., Maurer, U.M.: Player simulation and general adversary structures in perfect multiparty computation. J. Cryptol. 13(1), 31\u201360 (2000)","journal-title":"J. Cryptol."},{"key":"10_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-45146-4_9","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y Ishai","year":"2003","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 145\u2013161. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_9"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E.: Randomizing polynomials: a new representation with applications to round-efficient secure computation. In: 41st FOCS, pp. 294\u2013304. IEEE Computer Society Press, November 2000","DOI":"10.1109\/SFCS.2000.892118"},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Lindell, Y., Petrank, E.: Black-box constructions for secure computation. In: Kleinberg, J.M. (ed.) 38th ACM STOC, pp. 99\u2013108. ACM Press, May 2006","DOI":"10.1145\/1132516.1132531"},{"key":"10_CR32","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E.: Privacy and communication complexity. In: 30th FOCS, pp. 416\u2013421. IEEE Computer Society Press, October\/November 1989","DOI":"10.1109\/SFCS.1989.63512"},{"key":"10_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-78372-7_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"B Pinkas","year":"2018","unstructured":"Pinkas, B., Schneider, T., Weinert, C., Wieder, U.: Efficient circuit-based PSI via cuckoo hashing. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 125\u2013157. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_5"},{"key":"10_CR34","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: 21st ACM STOC, pp. 73\u201385. ACM Press, May 1989","DOI":"10.1145\/73007.73014"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03810-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T00:20:50Z","timestamp":1775262050000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-03810-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030038090","9783030038106"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03810-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"8 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Panaji","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}