{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:51Z","timestamp":1766281011218},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642400834"},{"type":"electronic","value":"9783642400841"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40084-1_11","type":"book-chapter","created":{"date-parts":[[2013,8,14]],"date-time":"2013-08-14T05:56:37Z","timestamp":1376459797000},"page":"185-202","source":"Crossref","is-referenced-by-count":19,"title":["Efficient Multiparty Protocols via Log-Depth Threshold Formulae"],"prefix":"10.1007","author":[{"given":"Gil","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan Bjerre","family":"Damg\u00e5rd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonas","family":"K\u00f6lker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter Bro","family":"Miltersen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ran","family":"Raz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ron D.","family":"Rothblum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Koml\u00f3s, J., Szemer\u00e9di, E.: An o(n log n) sorting network. In: STOC, pp. 1\u20139 (1983)","DOI":"10.1145\/800061.808726"},{"issue":"3","key":"11_CR2","first-page":"12","volume":"45","author":"S. Akers","year":"1963","unstructured":"Akers, S., Robbins, T.: Logical design with three-input majority gates. Computer Design\u00a045(3), 12\u201327 (1963)","journal-title":"Computer Design"},{"issue":"4","key":"11_CR3","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1007\/s00453-008-9272-1","volume":"58","author":"O. Barkol","year":"2010","unstructured":"Barkol, O., Ishai, Y., Weinreb, E.: On locally decodable codes, self-correctable codes, and t-private PIR. Algorithmica\u00a058(4), 831\u2013859 (2010)","journal-title":"Algorithmica"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: STOC, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"issue":"4","key":"11_CR5","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1145\/31846.42229","volume":"34","author":"G. Bracha","year":"1987","unstructured":"Bracha, G.: An O(log n) expected rounds randomized byzantine generals protocol. J. ACM\u00a034(4), 910\u2013920 (1987)","journal-title":"J. ACM"},{"key":"11_CR6","unstructured":"Bro Miltersen, P.: Lecutre notes. Available from author (1992)"},{"issue":"1","key":"11_CR7","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. Cryptology\u00a013(1), 143\u2013202 (2000)","journal-title":"J. Cryptology"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1007\/0-387-34805-0_52","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"D. Chaum","year":"1990","unstructured":"Chaum, D.: The spymasters double-agent problem: Multiparty computations secure unconditionally from minorities and cryptograhically from majorities. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 591\u2013602. Springer, Heidelberg (1990)"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: STOC, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"issue":"3","key":"11_CR11","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s00145-005-0308-x","volume":"18","author":"J. Considine","year":"2005","unstructured":"Considine, J., Fitzi, M., Franklin, M.K., Levin, L.A., Maurer, U.M., Metcalf, D.: Byzantine agreement given partial broadcast. J. Cryptology\u00a018(3), 191\u2013217 (2005)","journal-title":"J. Cryptology"},{"key":"11_CR12","unstructured":"Cramer, R., Damg\u00e5rd, I., Nielsen, J.B.: Secure Multiparty Computation and Secret Sharing - An Information Theoretic Appoach (2012), Book draft, available at \n                      \n                        http:\/\/www.daimi.au.dk\/~ivan\/MPCbook.pdf"},{"key":"11_CR13","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 \u2013 EUROCRPYT 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.\u00a02656, pp. 596\u2013613. Springer, Heidelberg (2003)"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-540-85174-5_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"I. Damg\u00e5rd","year":"2008","unstructured":"Damg\u00e5rd, I., Ishai, Y., Kr\u00f8igaard, M., Nielsen, J.B., Smith, A.: Scalable multiparty computation with nearly optimal work and resilience. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 241\u2013261. Springer, Heidelberg (2008)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/978-3-642-32928-9_28","volume-title":"Security and Cryptography for Networks","author":"Y. Desmedt","year":"2012","unstructured":"Desmedt, Y., Pieprzyk, J., Steinfeld, R.: Active security in multiparty computation over black-box groups. In: Visconti, I., De Prisco, R. (eds.) SCN 2012. LNCS, vol.\u00a07485, pp. 503\u2013521. Springer, Heidelberg (2012)"},{"issue":"4","key":"11_CR16","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/s00145-011-9104-3","volume":"25","author":"Y. Desmedt","year":"2012","unstructured":"Desmedt, Y., Pieprzyk, J., Steinfeld, R., Sun, X., Tartary, C., Wang, H., Yao, A.C.-C.: Graph coloring applied to secure computation in non-abelian groups. J. Cryptology\u00a025(4), 557\u2013600 (2012)","journal-title":"J. Cryptology"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/978-3-540-74143-5_33","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"Y.G. Desmedt","year":"2007","unstructured":"Desmedt, Y., Pieprzyk, J., Steinfeld, R., Wang, H.: On secure multi-party computation in black-box groups. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 591\u2013612. Springer, Heidelberg (2007)"},{"issue":"1","key":"11_CR18","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","volume":"3","author":"D. Dolev","year":"1982","unstructured":"Dolev, D.: The byzantine generals strike again. J. Algorithms\u00a03(1), 14\u201330 (1982)","journal-title":"J. Algorithms"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Feige, U., Kilian, J., Naor, M.: A minimal model for secure computation (extended abstract). In: STOC, pp. 554\u2013563 (1994)","DOI":"10.1145\/195058.195408"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/BFb0056479","volume-title":"Distributed Computing","author":"M. Fitzi","year":"1998","unstructured":"Fitzi, M., Maurer, U.M.: Efficient byzantine agreement secure against general adversaries. In: Kutten, S. (ed.) DISC 1998. LNCS, vol.\u00a01499, pp. 134\u2013148. Springer, Heidelberg (1998)"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Maurer, U.M.: From partial consistency to global broadcast. In: STOC, pp. 494\u2013503 (2000)","DOI":"10.1145\/335305.335363"},{"issue":"1","key":"11_CR22","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1137\/S0097539794265232","volume":"27","author":"J.A. Garay","year":"1998","unstructured":"Garay, J.A., Moses, Y.: Fully polynomial byzantine agreement for n\u2009>\u20093t processors in t\u2009+\u20091 rounds. SIAM J. Comput.\u00a027(1), 247\u2013290 (1998)","journal-title":"SIAM J. Comput."},{"key":"11_CR23","series-title":"Basic Applications","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography. Basic Applications, vol.\u00a02. Cambridge University Press, New York (2004)"},{"key":"11_CR24","unstructured":"Goldreich, O.: Valiant\u2019s polynomial-size monotone formula for majority (2011), \n                      \n                        http:\/\/www.wisdom.weizmann.ac.il\/~oded\/PDF\/mono-maj.pdf"},{"key":"11_CR25","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"},{"issue":"1","key":"11_CR26","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/BF01202041","volume":"6","author":"A. Gupta","year":"1996","unstructured":"Gupta, A., Mahajan, S.: Using amplification to compute majority with small majority gates. Computational Complexity\u00a06(1), 46\u201363 (1996)","journal-title":"Computational Complexity"},{"key":"11_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-540-78524-8_22","volume-title":"Theory of Cryptography","author":"D. Harnik","year":"2008","unstructured":"Harnik, D., Ishai, Y., Kushilevitz, E., Nielsen, J.B.: OT-combiners via secure computation. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 393\u2013411. Springer, Heidelberg (2008)"},{"issue":"1","key":"11_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. Cryptology\u00a013(1), 31\u201360 (2000)","journal-title":"J. Cryptology"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Hoory, S., Magen, A., Pitassi, T.: Monotone circuits for the majority function. In: APPROX-RANDOM, pp. 410\u2013425 (2006)","DOI":"10.1007\/11830924_38"},{"issue":"3","key":"11_CR30","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1137\/080725398","volume":"39","author":"Y. Ishai","year":"2009","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge proofs from secure multiparty computation. SIAM J. Comput.\u00a039(3), 1121\u20131152 (2009)","journal-title":"SIAM J. Comput."},{"key":"11_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-85174-5_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"Y. Ishai","year":"2008","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer \u2013 efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 572\u2013591. Springer, Heidelberg (2008), \n                      \n                        http:\/\/www.cs.illinois.edu\/~mmp\/research.html"},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: STOC, pp. 20\u201331 (1988)","DOI":"10.1145\/62212.62215"},{"issue":"5","key":"11_CR33","doi-asserted-by":"publisher","first-page":"2090","DOI":"10.1137\/090755886","volume":"39","author":"E. Kushilevitz","year":"2010","unstructured":"Kushilevitz, E., Lindell, Y., Rabin, T.: Information-theoretically secure protocols and security under composition. SIAM J. Comput.\u00a039(5), 2090\u20132112 (2010)","journal-title":"SIAM J. Comput."},{"key":"11_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-22792-9_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"Y. Lindell","year":"2011","unstructured":"Lindell, Y., Oxman, E., Pinkas, B.: The IPS compiler: Optimizations, variants and concrete efficiency. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 259\u2013276. Springer, Heidelberg (2011)"},{"key":"11_CR35","doi-asserted-by":"crossref","unstructured":"Lucas, C., Raub, D., Maurer, U.M.: Hybrid-secure mpc: trading information-theoretic robustness for computational privacy. In: PODC, pp. 219\u2013228 (2010)","DOI":"10.1145\/1835698.1835747"},{"issue":"2","key":"11_CR36","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1016\/j.dam.2005.03.020","volume":"154","author":"U.M. Maurer","year":"2006","unstructured":"Maurer, U.M.: Secure multi-party computation made simple. Discrete Applied Mathematics\u00a0154(2), 370\u2013381 (2006)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"11_CR37","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M.C. Pease","year":"1980","unstructured":"Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM\u00a027(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"11_CR38","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: Johnson, D.S. (ed.) STOC, pp. 73\u201385. ACM (1989)","DOI":"10.1145\/73007.73014"},{"key":"11_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-89255-7_3","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"X. Sun","year":"2008","unstructured":"Sun, X., Yao, A.C.-C., Tartary, C.: Graph design for secure multiparty computation over non-abelian groups. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol.\u00a05350, pp. 37\u201353. Springer, Heidelberg (2008)"},{"issue":"3","key":"11_CR40","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0196-6774(84)90016-6","volume":"5","author":"L.G. Valiant","year":"1984","unstructured":"Valiant, L.G.: Short monotone formulae for the majority function. J. Algorithms\u00a05(3), 363\u2013366 (1984)","journal-title":"J. Algorithms"},{"key":"11_CR41","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Protocols for secure computations (extended abstract). In: FOCS, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"11_CR42","unstructured":"Zwick, U.: Lecture notes (1996), \n                      \n                        http:\/\/www.cs.tau.ac.il\/~zwick\/circ-comp-new\/six.ps"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40084-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T11:29:53Z","timestamp":1558006193000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40084-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642400834","9783642400841"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40084-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}