A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra

DOI10.1007/978-3-540-74143-5_34zbMath1215.68034OpenAlexW1601879746WikidataQ59163754 ScholiaQ59163754MaRDI QIDQ3612573

Carles Padró, Ronald Cramer, Eike Kiltz

Publication date: 10 March 2009

Published in: Advances in Cryptology - CRYPTO 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74143-5_34

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of matrix inversion and generalized inverses (15A09) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (4)

A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals ⋮ Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages ⋮ Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes ⋮ Secure linear system computation in the presence of malicious adversaries

This page was built for publication: A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra