Sciweavers

CRYPTO
2008
Springer
165views Cryptology» more  CRYPTO 2008»
13 years 5 months ago
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
Payman Mohassel, Enav Weinreb