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

Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority

Eli Ben‐Sasson, Serge Fehr, Rafail Ostrovsky

Published Jan 1, 2012• 108 citations
Publisher
DOI
10.1007/978-3-642-32009-5_39

Related papers

Optimizing secure multiparty computation protocols for dishonest majority

Dragos Rotaru

•Jan 1, 2020•0 citations

Improved Secure Multiparty Computation with a Dishonest Majority via Quantum Means

Yanbing Li, Qiaoyan Wen, Su‐Juan Qin

International Journal of Theoretical Physics•Aug 28, 2012•10 citations

Proactive Secure Multiparty Computation with a Dishonest Majority

Karim Eldefrawy, Rafail Ostrovsky, Sunoo Park +1 more

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

Scalable and Unconditionally Secure Multiparty Computation

Ivan Damgård, Jesper Buus Nielsen

Springer eBooks•Aug 9, 2007•274 citations

Unconditionally Secure Multiparty Computation from Noisy Resources

Stefan Wolf, Jürg Wullschleger

Springer eBooks•Jan 1, 2007•1 citation

Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost

Ivan Damgård, Claudio Orlandi

Lecture notes in computer science•Jan 1, 2010•73 citations