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 Multiparty Computations Secure Against an Adaptive Adversary

Ronald Cramer, Ivan Damgård, Stefan Dziembowski, Martin Hirt, Tal Rabin

Published Jan 1, 1999• 215 citations
Publisher
DOI
10.1007/3-540-48910-x_22

Related papers

Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions

Fabrice Benhamouda, Huijia Lin, Antigoni Polychroniadou +1 more

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

Tolerating Generalized Mobile Adversaries in Secure Multiparty Computation

Kannan Srinathan, Chandrasekharan Pandu Rangan

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

Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds

Dana Dachman-Soled, Jonathan I. Katz, Vanishree Rao

Lecture notes in computer science•Jan 1, 2015•44 citations

On Adaptively Secure Multiparty Computation with a Short CRS

Ran Cohen, Chris Peikert

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

Efficient Multiparty Computations with Dishonest Minority

Ronald Cramer, Ivan Damgård, Stefan Dziembowski +2 more

We consider verifiable secret sharing (VSS) and multiparty computation (MPC) in the secure channels model, where a broadcast channel is given and a non-zero error probability is allowed. In this model Rabin and Ben-Or proposed VSS and MPC protocols, secure against an adversary that can corrupt any minority of the players. In this paper, we rst observe that a subprotocol of theirs, known as weak secret sharing (WSS), is not secure against an adaptive adversary, contrary to what was believed earlier. We then propose new and adaptively secure protocols for WSS, VSS and MPC that are substantially more efficient than the original ones. Our protocols generalize easily to provide security against general Q2 adversaries.

BRICS Report Series•Jun 6, 1998•35 citations

Two-party Secure Computation for an Active Adversary

Himanshu Tyagi, Shun Watanabe

Cambridge University Press eBooks•Mar 23, 2023•0 citations
We consider verifiable secret sharing (VSS) and multiparty computation (MPC) in the secure channels model, where a broadcast channel is given and a non-zero error probability is allowed. In this model Rabin and Ben-Or proposed VSS and MPC protocols, secure against an adversary that can corrupt any minority of the players. In this paper, we rst observe that a subprotocol of theirs, known as weak secret sharing (WSS), is not secure against an adaptive adversary, contrary to what was believed earlier. We then propose new and adaptively secure protocols for WSS, VSS and MPC that are substantially more efficient than the original ones. Our protocols generalize easily to provide security against general Q2 adversaries.