{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T12:00:29Z","timestamp":1793102429204,"version":"4.5.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540741428","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74143-5_34","type":"book-chapter","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T09:51:33Z","timestamp":1186653093000},"page":"613-630","source":"Crossref","is-referenced-by-count":15,"title":["A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra"],"prefix":"10.1007","author":[{"given":"Ronald","family":"Cramer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eike","family":"Kiltz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carles","family":"Padr\u00f3","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Bar-Ilan, J., Beaver, D.: Non-cryptographic fault-tolerant computing in a constant number of rounds interaction. In: 8th ACM PODC, Edmonton, Alberta, Canada, August 14\u201316, 1989, pp. 201\u2013209 (1989)","DOI":"10.1145\/72981.72995"},{"key":"34_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/3-540-45539-6_23","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"D. Beaver","year":"2000","unstructured":"Beaver, D.: Minimal latency secure function evaluation. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 335\u2013350. Springer, Heidelberg (2000)"},{"key":"34_CR3","first-page":"503","volume-title":"22nd ACM STOC","author":"D. Beaver","year":"1990","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: 22nd ACM STOC, Baltimore, Maryland, USA, May 14\u201316, 1990, pp. 503\u2013513. ACM Press, New York (1990)"},{"issue":"1","key":"34_CR4","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1137\/0221006","volume":"21","author":"M. Ben-Or","year":"1992","unstructured":"Ben-Or, M., Cleve, R.: Computing algebraic formulas using a constant number of registers. SIAM J. Comput.\u00a021(1), 54\u201358 (1992)","journal-title":"SIAM J. Comput."},{"key":"34_CR5","first-page":"1","volume-title":"20th ACM STOC","author":"M. Ben-Or","year":"1988","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computations. In: 20th ACM STOC, Chicago, Illinois, USA, May\u00a02\u20134, 1988, pp. 1\u201310. ACM Press, New York (1988)"},{"key":"34_CR6","first-page":"11","volume-title":"20th ACM STOC","author":"D. Chaum","year":"1988","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: 20th ACM STOC, Chicago, Illinois, USA, May\u00a02\u20134, 1988, pp. 11\u201319. ACM Press, New York (1988)"},{"key":"34_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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., Damg\u00e5rd, 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":"34_CR8","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. Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, 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":"34_CR9","first-page":"554","volume-title":"26th ACM STOC","author":"U. Feige","year":"1994","unstructured":"Feige, U., Kilian, J., Naor, M.: A minimal model for secure computation. In: 26th ACM STOC, Montr\u00e9al, Qu\u00e9bec, Canada, May\u00a023\u201325, 1994, pp. 554\u2013563. ACM Press, New York (1994)"},{"key":"34_CR10","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1137\/S0895479802418860","volume":"27","author":"H. Lombardi","year":"2005","unstructured":"Lombardi, H., Diaz-Toca, G.M., Gonzalez-Vega, L.: Generalizing cramer\u2019s rule: Solving uniformly linear systems of equations. SIAM J. Matrix Anal. Appl.\u00a027, 621\u2013637 (2005)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"34_CR11","first-page":"218","volume-title":"19th ACM STOC","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game, or a completeness theorem for protocols with honest majority. In: 19th ACM STOC, May\u00a025\u201327, 1987, pp. 218\u2013229. ACM Press, New York (1987)"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E.: Private simultaneous messages protocols with applications. In: ISTCS. Proc. 5th Israel Symposium on Theoretical Comp. Sc., pp. 174\u2013183 (1997)","DOI":"10.1109\/ISTCS.1997.595170"},{"key":"34_CR13","volume-title":"41st FOCS","author":"Y. Ishai","year":"2000","unstructured":"Ishai, Y., Kushilevitz, E.: Randomizing polynomials: A new paradigm for round-efficient secure computation. In: 41st FOCS, Las Vegas, Nevada, USA, November\u00a012\u201314, 2000, IEEE Computer Society Press, Los Alamitos (2000)"},{"key":"34_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, Reading (1992)"},{"key":"34_CR15","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":"34_CR16","doi-asserted-by":"publisher","first-page":"185","DOI":"10.2307\/2004888","volume":"24","author":"F.T. Krogh","year":"1970","unstructured":"Krogh, F.T.: Efficient algorithms for polynomial interpolation and numerical differentiationi. Math. Comput.\u00a024, 185\u2013190 (1970)","journal-title":"Math. Comput."},{"key":"34_CR17","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF02579205","volume":"7","author":"K. Mulmuley","year":"1987","unstructured":"Mulmuley, K.: A fast parallel algorithm to compute the rank of a matrix over an arbitrary field. Combinatorica\u00a07, 101\u2013104 (1987)","journal-title":"Combinatorica"},{"key":"34_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-540-71677-8_23","volume-title":"PKC 2007","author":"T. Nishide","year":"2007","unstructured":"Nishide, T., Ohta, K.: Multiparty Computation for Interval, Equality, and Comparison without Bit-Decomposition Protocol. In: PKC 2007. LNCS, vol.\u00a04450, pp. 343\u2013360. Springer, Heidelberg (2007)"},{"key":"34_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Springer, Heidelberg (2006)"},{"key":"34_CR20","volume-title":"Combinatorial Optimization - Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization - Polyhedra and Efficiency. Springer, Heidelberg (2003)"},{"key":"34_CR21","first-page":"160","volume-title":"23rd FOCS","author":"A. Yao","year":"1982","unstructured":"Yao, A.: Protocols for secure computation. In: 23rd FOCS, Chicago, Illinois, November\u00a03\u20135, 1982, pp. 160\u2013164. IEEE Computer Society Press, Los Alamitos (1982)"},{"key":"34_CR22","first-page":"162","volume-title":"27th FOCS","author":"A. Yao","year":"1986","unstructured":"Yao, A.: How to generate and exchange secrets. In: 27th FOCS, Toronto, Ontario, Canada, October\u00a027\u201329, 1986, pp. 162\u2013167. IEEE Computer Society Press, Los Alamitos (1986)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74143-5_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:18:11Z","timestamp":1605745091000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74143-5_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540741428"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74143-5_34","relation":{},"subject":[]}}