{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T05:43:18Z","timestamp":1749620598918},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319108780"},{"type":"electronic","value":"9783319108797"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10879-7_12","type":"book-chapter","created":{"date-parts":[[2014,8,20]],"date-time":"2014-08-20T21:19:04Z","timestamp":1408569544000},"page":"197-217","source":"Crossref","is-referenced-by-count":3,"title":["Reducing the Overhead of MPC over a Large Population"],"prefix":"10.1007","author":[{"given":"Ashish","family":"Choudhury","sequence":"first","affiliation":[]},{"given":"Arpita","family":"Patra","sequence":"additional","affiliation":[]},{"given":"Nigel P.","family":"Smart","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-540-28628-8_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"M. Abe","year":"2004","unstructured":"Abe, M., Fehr, S.: Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 317\u2013334. Springer, Heidelberg (2004)"},{"key":"12_CR2","first-page":"136","volume":"2011","author":"G. Asharov","year":"2011","unstructured":"Asharov, G., Lindell, Y.: A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation. IACR Cryptology ePrint Archive\u00a02011, 136 (2011)","journal-title":"IACR Cryptology ePrint Archive"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Beaver, D.: Efficient Multiparty Protocols Using Circuit Randomization. In: Feigenbaum, J. (ed.) Advances in Cryptology - CRYPT0 1991. LNCS, vol.\u00a0576, pp. 420\u2013432. Springer, Heidelberg (1992)","DOI":"10.1007\/3-540-46766-1_34"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-540-78524-8_13","volume-title":"Theory of Cryptography","author":"Z. Beerliov\u00e1-Trub\u00edniov\u00e1","year":"2008","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Perfectly-Secure MPC with Linear Communication Complexity. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 213\u2013230. Springer, Heidelberg (2008)"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/978-3-642-32009-5_39","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"E. Ben-Sasson","year":"2012","unstructured":"Ben-Sasson, E., Fehr, S., Ostrovsky, R.: Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol.\u00a07417, pp. 663\u2013680. Springer, Heidelberg (2012)"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-642-36594-2_21","volume-title":"Theory of Cryptography","author":"E. Boyle","year":"2013","unstructured":"Boyle, E., Goldwasser, S., Tessaro, S.: Communication locality in secure multi-party computation how to run sublinear algorithms in a distributed setting. In: Sahai, A. (ed.) TCC 2013. LNCS, vol.\u00a07785, pp. 356\u2013376. Springer, Heidelberg (2013)"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-44647-8_2","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"R. Canetti","year":"2001","unstructured":"Canetti, R., Fischlin, M.: Universally Composable Commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 19\u201340. Springer, Heidelberg (2001)"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-540-24676-3_9","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"J. Canny","year":"2004","unstructured":"Canny, J., Sorkin, S.: Practical large-scale distributed key generation. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 138\u2013152. Springer, Heidelberg (2004)"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Choudhury, A.: Breaking the \n                    \n                      \n                    \n                    $\\mathcal{O}(n|c|)$\n                   barrier for unconditionally secure asynchronous multiparty computation - (extended abstract). In: Paul, G., Vaudenay, S. (eds.) INDOCRYPT 2013. LNCS, vol.\u00a08250, pp. 19\u201337. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-319-03515-4_2"},{"key":"12_CR10","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":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1007\/978-3-642-14623-7_30","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"I. Damg\u00e5rd","year":"2010","unstructured":"Damg\u00e5rd, I., Orlandi, C.: Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 558\u2013576. Springer, Heidelberg (2010)"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Dani, V., King, V., Movahedi, M., Saia, J.: Brief Announcement: Breaking the O(nm) Bit Barrier, Secure Multiparty Computation with a Static Adversary. In: Principles of Distributed Computing, PODC 2012, pp. 227\u2013228 (2012)","DOI":"10.1145\/2332432.2332473"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-45249-9_16","volume-title":"Distributed Computing and Networking","author":"V. Dani","year":"2014","unstructured":"Dani, V., King, V., Movahedi, M., Saia, J.: Quorums quicken queries: Efficient asynchronous secure multiparty computation. In: Chatterjee, M., Cao, J.-N., Kothapalli, K., Rajsbaum, S. (eds.) ICDCN 2014. LNCS, vol.\u00a08314, pp. 242\u2013256. Springer, Heidelberg (2014)"},{"key":"12_CR14","unstructured":"Feige, U.: Noncryptographic selection protocols. In: FOCS, pp. 142\u2013153 (1999)"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Hirt, M.: Optimally Efficient Multi-valued Byzantine Agreement. In: Principles of Distributed Computing, PODC 2006, pp. 163\u2013168. ACM (2006)","DOI":"10.1145\/1146381.1146407"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Franklin, M.K., Yung, M.: Communication Complexity of Secure Computation (Extended Abstract). In: Symposium on Theory of Computing, STOC 1992, pp. 699\u2013710. ACM (1992)","DOI":"10.1145\/129712.129780"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Kapron, B.M., Kempe, D., King, V., Saia, J., Sanwalani, V.: Fast Asynchronous Byzantine Agreement and Leader Election with Full Information. ACM Transactions on Algorithms\u00a06(4) (2010)","DOI":"10.1145\/1824777.1824788"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-642-17679-1_18","volume-title":"Distributed Computing and Networking","author":"V. King","year":"2011","unstructured":"King, V., Lonargan, S., Saia, J., Trehan, A.: Load Balanced Scalable Byzantine Agreement through Quorum Building, with Information. In: Aguilera, M.K., Yu, H., Vaidya, N.H., Srinivasan, V., Choudhury, R.R. (eds.) ICDCN 2011. LNCS, vol.\u00a06522, pp. 203\u2013214. Springer, Heidelberg (2011)"},{"issue":"4","key":"12_CR19","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/1989727.1989732","volume":"58","author":"V. King","year":"2011","unstructured":"King, V., Saia, J.: Breaking the O(n\n                  2) Bit Barrier: Scalable Byzantine Agreement with an Adaptive Adversary. J. ACM\u00a058(4), 18 (2011)","journal-title":"J. ACM"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"King, V., Saia, J., Sanwalani, V., Vee, E.: Scalable Leader Election. In: SODA, pp. 990\u2013999 (2006)","DOI":"10.1145\/1109557.1109667"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Pedersen, T.P.: Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In: Feigenbaum, J. (ed.) Advances in Cryptology - CRYPT0 1991. LNCS, vol.\u00a0576, pp. 129\u2013140. Springer, Heidelberg (1992)","DOI":"10.1007\/3-540-46766-1_9"},{"issue":"11","key":"12_CR22","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to Share a Secret. Commun. ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Security and Cryptography for Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10879-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T12:35:43Z","timestamp":1558960543000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10879-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319108780","9783319108797"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10879-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}