Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries

Additional Metadata
Publisher	Springer
Series	Lecture Notes in Computer Science
Project	Algebraic Geometric Foundations of Cryptology: The Case of Practical and Unconditionally Secure Computation , Discrete, interactive & algorithmic mathematics, algebra and number theory
Conference	IACR Crypto
Organisation	Cryptology
Citation APA APA Style APA-ALL Style AAA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Mohassel, P.& Weinreb, E. (2008, August). Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries. Lecture Notes in Computer Science.

Publication