A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals
From MaRDI portal
Publication:2229288
DOI10.1007/978-3-030-57808-4_20OpenAlexW2947937601MaRDI QIDQ2229288
Niek J. Bouman, Niels de Vreede
Publication date: 23 February 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-57808-4_20
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized inverses over integral domains
- The reverse order law revisited
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
- A volume associated with \(m{\times}n\) matrices
- Efficient matrix preconditioners for black box linear algebra
- Generalized inverses. Theory and applications.
- Generalized inverses of matrices with entries taken from an arbitrary field
- Die exakte Berechnung der Moore-Penrose-Inversen einer Matrix durch Residuenarithmetik
- Fast Generalized Bruhat Decomposition
- Secure Linear Algebra Using Linearly Recurrent Sequences
- Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
- A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra
- Fast parallel matrix and GCD computations
- Secure Multiparty Computation and Secret Sharing
- Note on the Generalized Inverse of a Matrix Product
- Generalized Inverses of Partitioned Matrices
- Linear Statistical Inference and its Applications
- Theory of Cryptography
- Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
- Symmetric and Alternate Matrices in An Arbitrary Field, I
- Theory of Cryptography
- Theory of Cryptography
This page was built for publication: A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals
