{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T22:21:35Z","timestamp":1744755695139},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540851738"},{"type":"electronic","value":"9783540851745"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85174-5_27","type":"book-chapter","created":{"date-parts":[[2008,8,20]],"date-time":"2008-08-20T08:32:02Z","timestamp":1219221122000},"page":"481-496","source":"Crossref","is-referenced-by-count":14,"title":["Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries"],"prefix":"10.1007","author":[{"given":"Payman","family":"Mohassel","sequence":"first","affiliation":[]},{"given":"Enav","family":"Weinreb","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-540-70936-7_8","volume-title":"Theory of Cryptography","author":"Y. Aumann","year":"2007","unstructured":"Aumann, Y., Lindell, Y.: Security against covert adversaries: Efficient protocols for realistic adversaries. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 137\u2013156. Springer, Heidelberg (2007)"},{"key":"27_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03338-8","volume-title":"Algebraic complexity theory","author":"P. B\u00fcrgisser","year":"1997","unstructured":"B\u00fcrgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic complexity theory. Springer, Berlin (1997)"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computations. In: STOC, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Brent, R.P., Gustavson, F.G., Yun, D.Y.Y.: Fast solution of Toeplitz systems of equations and computation of pade approximants. J. Algorithms, 259\u2013295 (1980)","DOI":"10.1016\/0196-6774(80)90013-9"},{"key":"27_CR5","first-page":"201","volume-title":"PODC","author":"J. Bar-Ilan","year":"1989","unstructured":"Bar-Ilan, J., Beaver, D.: Non-cryptographic fault-tolerant computing in constant number of rounds of interaction. In: PODC, pp. 201\u2013209. ACM Press, New York (1989)"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: STOC, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"27_CR7","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. Cramer","year":"2001","unstructured":"Cramer, R., Damgaard, I.: 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":"27_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"R. Cramer","year":"2000","unstructured":"Cramer, R., Damg\u00e5rd, I., Maurer, U.: General secure multi-party computation from any linear secret-sharing scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 316\u2013334. Springer, Heidelberg (2000)"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-3-540-74143-5_34","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"R. Cramer","year":"2007","unstructured":"Cramer, R., Kiltz, E., Padr\u00f3, C.: A note on secure computation of the Moore-Penrose pseudo-inverse and its application to secure linear algebra. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, p. 613. Springer, Heidelberg (2007)"},{"key":"27_CR10","first-page":"1","volume-title":"STOC","author":"D. Coppersmith","year":"1987","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. In: STOC, pp. 1\u20136. ACM Press, New York (1987)"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0024-3795(79)90030-2","volume":"27","author":"B. Friedlander","year":"1979","unstructured":"Friedlander, B., Morf, M., Kailath, T., Ljung, L.: New inversion formulas for matrices classified in terms of their distance from Toeplitz matrices. Linear Algebra and Appl.\u00a027, 31\u201360 (1979)","journal-title":"Linear Algebra and Appl."},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: STOC, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"27_CR13","unstructured":"Gohberg, I., Semencul, A.: On the inversion of finite Toeplitz matrices and their continuous analogs. Math. Issl., 201\u2013233 (1972)"},{"key":"27_CR14","volume-title":"An introduction to parallel algorithms","author":"J. J\u00e1J\u00e1","year":"1992","unstructured":"J\u00e1J\u00e1, J.: An introduction to parallel algorithms. Addison Wesley Longman Publishing Co., Inc., Redwood City (1992)"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Lindell, Y., Rabin, T.: Information-theoretically secure protocols and security under composition. In: STOC, pp. 109\u2013118 (2006)","DOI":"10.1145\/1132516.1132532"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-540-70936-7_16","volume-title":"Theory of Cryptography","author":"E. Kiltz","year":"2007","unstructured":"Kiltz, E., Mohassel, P., Weinreb, E., Franklin, M.: Secure linear algebra using linearly recurrent sequences. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 291\u2013310. Springer, Heidelberg (2007)"},{"key":"27_CR17","first-page":"180","volume-title":"SPAA","author":"E. Kaltofen","year":"1991","unstructured":"Kaltofen, E., Pan, V.: Processor efficient parallel solution of linear systems over an abstract field. In: SPAA, pp. 180\u2013191. ACM Press, New York (1991)"},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"Kaltofen, E., Saunders, D.: On Wiedemann\u2019s method of solving sparse linear systems. In: AAECC-9, London, UK, pp. 29\u201338 (1991)","DOI":"10.1007\/3-540-54522-0_93"},{"key":"27_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/11681878_15","volume-title":"Theory of Cryptography","author":"I. Damgaard","year":"2006","unstructured":"Damgaard, I., Fitzi, M., Kiltz, E., Nielsen, J.B., Toft, T.: Unconditionally Secure Constant-Rounds Multi-Party Computation for Equality, Comparison, Bits and Exponentiation. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 285\u2013304. Springer, Heidelberg (2006)"},{"key":"27_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/3-540-44647-8_10","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"Y. Lindell","year":"2001","unstructured":"Lindell, Y.: Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 171\u2013189. Springer, Heidelberg (2001)"},{"key":"27_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/11745853_4","volume-title":"Public Key Cryptography - PKC 2006","author":"P. Mohassel","year":"2006","unstructured":"Mohassel, P., Franklin, M.: Efficient Polynomial Operations in the Shared-Coefficient Setting. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol.\u00a03958, pp. 44\u201357. Springer, Heidelberg (2006)"},{"key":"27_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1007\/11681878_27","volume-title":"Theory of Cryptography","author":"K. Nissim","year":"2006","unstructured":"Nissim, K., Weinreb, E.: Communication efficient secure linear algebra. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 522\u2013541. Springer, Heidelberg (2006)"},{"key":"27_CR23","series-title":"Lecture Notes in Computer Science","first-page":"223","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Pallier","year":"1999","unstructured":"Pallier, 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":"1","key":"27_CR24","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/TIT.1986.1057137","volume":"32","author":"D.H. Wiedemann","year":"1986","unstructured":"Wiedemann, D.H.: Solving sparse linear equations over finite fields. IEEE Trans. Inf. Theor.\u00a032(1), 54\u201362 (1986)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"27_CR25","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: FOCS, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"27_CR26","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: FOCS, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85174-5_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:22:29Z","timestamp":1606166549000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85174-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540851738","9783540851745"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85174-5_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}