Secure multi-party linear algebra with perfect correctness
From MaRDI portal
Cites work
- A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra
- An Application of the Cayley-Hamilton Theorem to Generalized Matrix Inversion
- An improved parallel processor bound in fast matrix inversion
- Efficient generation of random nonsingular matrices
- Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
- Fast parallel computation of characteristic polynomials by Leverrier's power sum method adapted to fields of finite characteristic
- General secure multi-party computation from any linear secret-sharing scheme
- Generalizing Cramer's Rule: Solving Uniformly Linear Systems of Equations
- scientific article; zbMATH DE number 1842488 (Why is no real title available?)
- scientific article; zbMATH DE number 3111121 (Why is no real title available?)
- Information-theoretically secure protocols and security under composition
- MAYO: practical post-quantum signatures from oil-and-vinegar maps
- Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- Scalable and Unconditionally Secure Multiparty Computation
- Secure Linear Algebra Using Linearly Recurrent Sequences
- Theory of Cryptography
- Theory of Cryptography
- Unbalanced Oil and Vinegar Signature Schemes
- Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
This page was built for publication: Secure multi-party linear algebra with perfect correctness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7318581)
