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

DOI10.1007/978-3-030-57808-4_20OpenAlexW2947937601MaRDI QIDQ2229288FDOQ2229288

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

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

zbMATH Keywords

Moore-Penrose pseudoinversesecure multiparty computationoblivious algorithmssecure linear algebra

Mathematics Subject Classification ID

Cryptography (94A60) Computer security (68M25)

Cites Work

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

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)