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

DOI10.1007/978-3-540-85174-5_27zbMath1183.68085OpenAlexW2124997757MaRDI QIDQ3600236

Payman Mohassel, Enav Weinreb

Publication date: 10 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85174-5_27

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (4)

Actively secure arithmetic computation and VOLE with constant computational overhead ⋮ Efficient set operations in the presence of malicious adversaries ⋮ 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

This page was built for publication: Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries