A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals

DOI10.1007/978-3-030-57808-4_20MaRDI QIDQ2229288zbMATH OpenOpenAlexFDO

Authors Niek 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

zbMATH Keywords

Moore-Penrose pseudoinversesecure multiparty computationoblivious algorithmssecure linear algebra

Mathematics Subject Classification ID

Cryptography (94A60) Computer security (68M25)

Recommendations

• A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra
• Secure linear system computation in the presence of malicious adversaries
• scientific article; zbMATH DE number 6402149
• Secure Linear Algebra Using Linearly Recurrent Sequences
• Theory of Cryptography

Cites work

• scientific article; zbMATH DE number 3765126 (Why is no real title available?)
• scientific article; zbMATH DE number 177858 (Why is no real title available?)
• scientific article; zbMATH DE number 3465460 (Why is no real title available?)
• scientific article; zbMATH DE number 3484225 (Why is no real title available?)
• scientific article; zbMATH DE number 1253981 (Why is no real title available?)
• scientific article; zbMATH DE number 1254299 (Why is no real title available?)
• scientific article; zbMATH DE number 1842488 (Why is no real title available?)
• scientific article; zbMATH DE number 3353461 (Why is no real title available?)
• scientific article; zbMATH DE number 3373921 (Why is no real title available?)
• A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra
• A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
• A volume associated with \(m{\times}n\) matrices
• Die exakte Berechnung der Moore-Penrose-Inversen einer Matrix durch Residuenarithmetik
• Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
• Efficient matrix preconditioners for black box linear algebra
• Fast generalized Bruhat decomposition
• Fast parallel matrix and GCD computations
• Generalized Inverses of Partitioned Matrices
• Generalized inverses of matrices with entries taken from an arbitrary field
• Generalized inverses over integral domains
• Generalized inverses. Theory and applications.
• Linear Statistical Inference and its Applications
• Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
• Note on the Generalized Inverse of a Matrix Product
• Secure Linear Algebra Using Linearly Recurrent Sequences
• Secure multiparty computation and secret sharing
• Symmetric and Alternate Matrices in An Arbitrary Field, I
• The reverse order law revisited
• Theory of Cryptography
• Theory of Cryptography
• Theory of Cryptography

Cited in

(2)

• The \(k\)-ary Montgomery modular inverse over nonbinary computers
• Secure rational numbers equivalence test based on threshold cryptosystem with rational numbers

This page was built for publication: A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229288)