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

Springer eBooks

Efficient Two Party and Multi Party Computation Against Covert Adversaries

Vipul Goyal, Payman Mohassel, Adam Smith

Published Apr 4, 2008• 104 citations
Publisher
DOI
10.1007/978-3-540-78967-3_17

Related papers

Efficient Covert Two-Party Computation

Stanisław Jarecki

Lecture notes in computer science•Jan 1, 2018•13 citations

Efficient General-Adversary Multi-Party Computation

Martin Hirt, Daniel Tschudi

Lecture notes in computer science•Jan 1, 2013•26 citations

Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries

Yehuda Lindell, Benny Pinkas B, Nigel Paul Smart

Lecture notes in computer science•Jan 1, 2008•142 citations

Multi-Party Computation with Omnipresent Adversary

Hossein Ghodosi, Josef Pieprzyk

Lecture notes in computer science•Jan 1, 2009•6 citations

General Adversaries in Unconditional Multi-party Computation

Matthias Fitzi, Martin Hirt, Ueli M. Maurer

Lecture notes in computer science•Jan 1, 1999•49 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•429 citations