{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T06:31:35Z","timestamp":1772346695085,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540424567","type":"print"},{"value":"9783540446477","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44647-8_7","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T19:28:14Z","timestamp":1194982094000},"page":"119-136","source":"Crossref","is-referenced-by-count":50,"title":["Secure Distributed Linear Algebra in a Constant Number of Rounds"],"prefix":"10.1007","author":[{"given":"Ronald","family":"Cramer","sequence":"first","affiliation":[]},{"given":"Ivan","family":"Damg\u00e5rd","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"J. Bar-Ilan, D. Beaver: Non-cryptographic fault-tolerant computing in constant number of rounds of interaction, Proc. ACM PODC\u2019 89, pp. 201\u2013209, 1989.","DOI":"10.1145\/72981.72995"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"D. Beaver, S. Micali, P. Rogaway: The Round Complexity of Secure Protocols, Proc. 22nd ACM STOC, pp. 503\u2013513, 1990.","DOI":"10.1145\/100216.100287"},{"key":"7_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/3-540-45539-6_23","volume-title":"Proc. EUROCRYPT\u2019 00","author":"D. Beaver","year":"2000","unstructured":"D. Beaver: Minimal Latency Secure Function Evaluation, Proc. EUROCRYPT\u2019 00, Springer Verlag LNCS, vol. 1807, pp. 335\u2013350."},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1006\/jcss.1999.1648","volume":"59","author":"A. Beimel","year":"1999","unstructured":"A. Beimel, A. G\u00e1l: On Arithmetic Branching Programs, J. Comp. & Syst. Se, 59, pp. 195\u2013220, 1999.","journal-title":"J. Comp. & Syst. Se"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, A. Wigderson: Completeness theorems for non-cryptographic fault-tolerant distributed computation, Proc. ACM STOC\u2019 88, pp. 1\u201310, 1988.","DOI":"10.1145\/62212.62213"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"R. Canetti, U. Feige, O. Goldreich, M. Naor: Adaptively secure multi-party computation, Proc. ACM STOC\u2019 96, pp. 639\u2013648, 1996.","DOI":"10.1145\/237814.238015"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, I. Damg\u00e5rd: Multi-party unconditionally secure protocols, Proc. ACM STOC\u2019 88, pp. 11\u201319, 1988.","DOI":"10.1145\/62212.62214"},{"key":"7_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/3-540-44987-6_18","volume-title":"Proc. EUROCRYPT\u2019 01","author":"R. Cramer","year":"2001","unstructured":"R. Cramer, I. Damg\u00e5rd, J. Buus Nielsen: Multiparty Computation from Threshold Homomorphic Encryption, Proc. EUROCRYPT\u2019 01, Springer Verlag LNCS, vol. 2045, pp. 280\u2013300., 2001."},{"key":"7_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"Proc. EUROCRYPT\u2019 00","author":"R. Cramer","year":"2000","unstructured":"R. Cramer, I. Damg\u00e5rd, U. Maurer: General Secure Multi-Party Computation from any Linear Secret-Sharing Scheme, Proc. EUROCRYPT\u2019 00, Springer Verlag LNCS, vol 1807, pp. 316\u2013334. Full version available from IACR eprint archive, 2000."},{"key":"7_CR10","first-page":"311","volume":"LNCS","author":"R. Cramer","year":"1999","unstructured":"R. Cramer, I. Damg\u00e5rd, S. Dziembowski, M. Hirt and T. Rabin: Efficient multiparty computations secure against an adaptive adversary, Proc. EUROCRYPT\u2019 99, Springer Verlag LNCS, vol. 1592, pp. 311\u2013326, 1999.","journal-title":"Proc. EUROCRYPT\u2019 99"},{"key":"7_CR11","unstructured":"R. Cramer, I. Damg\u00e5rd, V. Daza: work in progress, 2001."},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"U. Feige, J. Kilian, M. Naor: A Minimal Model for Secure Computation, Proc. ACM STOC\u2019 94, pp. 554\u2013563, 1994.","DOI":"10.1145\/195058.195408"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"R. Gennaro, M. Rabin, T. Rabin: Simplified VSS and fast-track multi-party computations with applications to threshold cryptography, Proc. ACM PODC\u201998, pp. 101\u2013111, 1998.","DOI":"10.1145\/277697.277716"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali and A. Wigderson: How to play any mental game or a completeness theorem for protocols with honest majority, Proc. ACM STOC\u2019 87, pp. 218\u2013229, 1987.","DOI":"10.1145\/28395.28420"},{"issue":"1","key":"7_CR15","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s001459910003","volume":"13","author":"M. Hirt","year":"2000","unstructured":"M. Hirt, U. Maurer: Player simulation and general adversary structures in perfect multi-party computation, Journal of Cryptology, vol. 13, no. 1, pp. 31\u201360, 2000. (Preliminary version in Proc. ACM PODC\u201997, pp. 25\u201334, 1997)","journal-title":"Journal of Cryptology"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Y. Ishai, E. Kushilevitz: Private Simultaneous Messages Protocols with Applications, Proc. 5th Israel Symposium on Theoretical Comp. Sc. (ISTCS\u2019 97), pp. 174\u2013183, 1997.","DOI":"10.1109\/ISTCS.1997.595170"},{"key":"7_CR17","unstructured":"Y. Ishai, E. Kushilevitz: Randomizing Polynomials: A New Paradigm for Round-Efficient Secure Computation, Proc. of FOCS\u2019 00, 2000."},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"M. Karchmer, A. Wigderson: On span programs, Proc. of Structure in Complexity\u2019 93, pp. 102\u2013111, 1993.","DOI":"10.1109\/SCT.1993.336536"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"J. Kilian: Founding Cryptography on Oblivious Transfer, Proc. ACM STOC\u2019 88, pp. 20\u201331, 1988.","DOI":"10.1145\/62212.62215"},{"key":"7_CR20","unstructured":"F. T. Leighton: Introduction to Parallel Algorithms and Architectures: Arrays-Trees-Hypercubes, Morgan Kaufmann Publishers, 1992."},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"M. Mahajan and V. Vinay: Determinant: combinatorics, algorithms and complexity, Chicago J. Theoret. Comput. Sci., Article 5, 1997.","DOI":"10.4086\/cjtcs.1997.005"},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF02579205","volume":"7","author":"K. Mulmuley","year":"1987","unstructured":"K. Mulmuley: A Fast Parallel Algorithm to Compute the Rank of a Matrix over an Arbitrary Field, Combinatorica, vol. 7, pp. 101\u2013104, 1987.","journal-title":"Combinatorica"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"T. Rabin, M. Ben-Or: Verifiable secret sharing and multi-party protocols with honest majority, Proc. ACM STOC\u2019 89, pp. 73\u201385, 1989.","DOI":"10.1145\/73007.73014"},{"issue":"6","key":"7_CR24","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1145\/195613.195621","volume":"41","author":"T. Rabin","year":"1994","unstructured":"T. Rabin: Robust sharing of secrets when the dealer is honest or cheating, J. ACM, 41(6):1089\u20131109, November 1994.","journal-title":"J. ACM"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"A. Yao: Protocols for Secure Computation, Proc. IEEE FOCS\u2019 82, pp. 160\u2013164, 1982.","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44647-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T10:22:17Z","timestamp":1556965337000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44647-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424567","9783540446477"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-44647-8_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}