{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T09:23:29Z","timestamp":1773912209274,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642004674","type":"print"},{"value":"9783642004681","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00468-1_10","type":"book-chapter","created":{"date-parts":[[2009,3,11]],"date-time":"2009-03-11T10:54:35Z","timestamp":1236768875000},"page":"160-179","source":"Crossref","is-referenced-by-count":128,"title":["Asynchronous Multiparty Computation: Theory and Implementation"],"prefix":"10.1007","author":[{"given":"Ivan","family":"Damg\u00e5rd","sequence":"first","affiliation":[]},{"given":"Martin","family":"Geisler","sequence":"additional","affiliation":[]},{"given":"Mikkel","family":"Kr\u00f8igaard","sequence":"additional","affiliation":[]},{"given":"Jesper Buus","family":"Nielsen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, USA. ACM (1988)"},{"key":"10_CR2","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":"10_CR3","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M., Nielsen, J.B.: Almost-asynchronous multi-party computation with faulty minority (manuscript, 2008)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: STOC [1], pp. 1\u201310","DOI":"10.1145\/62212.62213"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Bogetoft, P., Christensen, D.L., Damgard, I., Geisler, M., Jakobsen, T., Kr\u00f8igaard, M., Nielsen, J.D., Nielsen, J.B., Nielsen, K., Pagter, J., Schwartzbach, M., Toft, T.: Multiparty computation goes live. Cryptology ePrint Archive, Report 2008\/068 (2008), http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-642-03549-4_20"},{"key":"10_CR6","first-page":"136","volume-title":"FOCS","author":"R. Canetti","year":"2001","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS, pp. 136\u2013145. IEEE, Los Alamitos (2001)"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: STOC [1], pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"10_CR8","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.B., Ishai, Y.: Share conversion, pseudorandom secret-sharing and applications to secure computation. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 342\u2013362. Springer, Heidelberg (2005)"},{"key":"10_CR9","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.B., Ishai, Y.: Share conversion, pseudorandom secret-sharing and applications to secure computation. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 342\u2013362. Springer, Heidelberg (2005)"},{"key":"10_CR10","first-page":"218","volume-title":"STOC","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game \u2013 a completeness theorem for protocols with honest majority. In: STOC, pp. 218\u2013229. ACM, New York (1987)"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/3-540-44647-8_6","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"M. Hirt","year":"2001","unstructured":"Hirt, M., Maurer, U.M.: Robustness for free in unconditional multi-party computation. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 101\u2013118. Springer, Heidelberg (2001)"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-540-70583-3_39","volume-title":"Automata, Languages and Programming","author":"M. Hirt","year":"2008","unstructured":"Hirt, M., Nielsen, J.B., Przydatek, B.: Asynchronous multi-party computation with quadratic communication. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 473\u2013485. Springer, Heidelberg (2008)"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"issue":"11","key":"10_CR14","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. Communications of the ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2013 PKC 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00468-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T12:12:58Z","timestamp":1558181578000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00468-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642004674","9783642004681"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00468-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}