{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T22:43:32Z","timestamp":1791153812574,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540725398","type":"print"},{"value":"9783540725404","type":"electronic"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72540-4_19","type":"book-chapter","created":{"date-parts":[[2007,6,22]],"date-time":"2007-06-22T15:59:46Z","timestamp":1182527986000},"page":"329-346","source":"Crossref","is-referenced-by-count":10,"title":["Atomic Secure Multi-party Multiplication with Low Communication"],"prefix":"10.1007","author":[{"given":"Ronald","family":"Cramer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ivan","family":"Damg\u00e5rd","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robbert","family":"de Haan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"19_CR1","first-page":"1","volume-title":"Proceedings of STOC 1988","author":"M. Ben-Or","year":"1988","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of STOC 1988, pp. 1\u201310. ACM Press, New York (1988)"},{"key":"19_CR2","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings Proceedings of National Computer Conference \u201979. AFIPS Proceedings, vol.\u00a048, pp. 313\u2013317 (1979)"},{"key":"19_CR3","first-page":"11","volume-title":"Proceedings of STOC 1988","author":"D. Chaum","year":"1988","unstructured":"Chaum, D., Cr\u00e9peau, C., Damgaard, I.: Multi-party unconditionally secure protocols. In: Proceedings of STOC 1988, pp. 11\u201319. ACM Press, New York (1988)"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/11818175_31","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"H. Chen","year":"2006","unstructured":"Chen, H., Cramer, R.J.F.: Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 521\u2013536. Springer, Heidelberg (2006)"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44647-8_7","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"R.J.F. Cramer","year":"2001","unstructured":"Cramer, R.J.F., Damg\u00e5rd, I.B.: Secure Distributed Linear Algebra in a Constant Number of Rounds. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 119\u2013136. Springer, Heidelberg (2001)"},{"key":"19_CR6","unstructured":"Cramer, R., Kiltz, E., Padr\u00f3, C.: A Note on Secure Computation of the Moore-Penrose and Its Application to Secure Linear Algebra. Manuscript (2006)"},{"key":"19_CR7","first-page":"699","volume-title":"Proceedings of STOC 1992","author":"M. Franklin","year":"1992","unstructured":"Franklin, M., Yung, M.: Communication complexity of secure computation. In: Proceedings of STOC 1992, pp. 699\u2013710. ACM Press, New York (1992)"},{"key":"19_CR8","first-page":"580","volume-title":"Proceedings of STOC 2001","author":"R. Gennaro","year":"2001","unstructured":"Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: The Round Complexity of Verifiable Secret Sharing and Secure Multicast. In: Proceedings of STOC 2001, pp. 580\u2013589. ACM Press, New York (2001)"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Rabin, M.O., Rabin, T.: Simplified VSS and fasttrack multiparty computations with applications to threshold cryptography. In: Proceedings of PODC 1997, pp. 101\u2013111 (1998)","DOI":"10.1145\/277697.277716"},{"key":"19_CR10","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.: Robustness for Free in Unconditional Multi-Party Computation. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 101\u2013118. Springer, Heidelberg (2001)"},{"issue":"1","key":"19_CR11","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(90)90192-K","volume":"71","author":"C.P. Kruskal","year":"1990","unstructured":"Kruskal, C.P., Rudolph, L., Snir, M.: A complexity theory of efficient parallel algorithms. Theoretical Computer Science\u00a071(1), 95\u2013132 (1990)","journal-title":"Theoretical Computer Science"},{"issue":"11","key":"19_CR12","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","Advances in Cryptology - EUROCRYPT 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72540-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:46:06Z","timestamp":1558259166000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72540-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540725398","9783540725404"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72540-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}