Secure Linear Algebra Using Linearly Recurrent Sequences
From MaRDI portal
Recommendations
- Theory of Cryptography
- Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
- scientific article; zbMATH DE number 1842488
- Perfectly-Secure MPC with Linear Communication Complexity
- A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra
Cited in
(14)- Verification protocols with sub-linear communication for polynomial matrix operations
- Multiparty cardinality testing for threshold private intersection
- Multi-party threshold private set intersection with sublinear communication
- A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals
- Secure linear system computation in the presence of malicious adversaries
- Криптографически слабые функции усложнения для трехчленных линейных рекуррентных последовательностей
- 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
- Communication-Efficient Private Protocols for Longest Common Subsequence
- Efficient set operations in the presence of malicious adversaries
- scientific article; zbMATH DE number 1842488 (Why is no real title available?)
- Theory of Cryptography
- Fast secure computations on shared polynomials and applications to private set operations
- Secure multi-party linear algebra with perfect correctness
This page was built for publication: Secure Linear Algebra Using Linearly Recurrent Sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596387)