Theory of Cryptography
From MaRDI portal
Publication:5898372
DOI10.1007/11681878zbMATH Open1112.94031OpenAlexW3149533473MaRDI QIDQ5898372FDOQ5898372
Authors: Kobbi Nissim, Enav Weinreb 
Publication date: 12 February 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11681878
Recommendations
- Secure Linear Algebra Using Linearly Recurrent Sequences
- Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
- scientific article; zbMATH DE number 1842488
- Secure arithmetic computation with constant computational overhead
- A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra
Cited In (11)
- Efficient protocols for oblivious linear function evaluation from ring-LWE
- Secure linear system computation in the presence of malicious adversaries
- Efficient set operations in the presence of malicious adversaries
- Efficient Secure Matrix Multiplication Over LWE-Based Homomorphic Encryption
- A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra
- Title not available (Why is that?)
- Multiparty cardinality testing for threshold private intersection
- Secure Multiparty Matrix Multiplication Based on Strassen-Winograd Algorithm
- A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals
- Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
- Secure Linear Algebra Using Linearly Recurrent Sequences
This page was built for publication: Theory of Cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5898372)
