Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

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

Payman Mohassel, Enav Weinreb

Published Aug 20, 2008• 24 citations
Publisher
DOI
10.1007/978-3-540-85174-5_27

Related papers

Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries

Yonatan Aumann, Yehuda Lindell

Springer eBooks•May 16, 2007•212 citations

Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries

Yonatan Aumann, Yehuda Lindell

Journal of Cryptology•Apr 6, 2009•206 citations

The Round Complexity of Secure Computation Against Covert Adversaries

Arka Rai Choudhuri, Vipul Goyal, Abhishek Jain

Lecture notes in computer science•Jan 1, 2020•0 citations

Secure linear system computation in the presence of malicious adversaries

Bo Zhang, Fangguo Zhang

Science China Information Sciences•Aug 16, 2014•0 citations

An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries

Yehuda Lindell, Benny Pinkas B

Lecture notes in computer science•Jan 1, 2007•431 citations

An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries

Yehuda Lindell, Benny Pinkas B

Journal of Cryptology•Apr 9, 2014•51 citations