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

Unconditional Byzantine Agreement and Multi-party Computation Secure against Dishonest Minorities from Scratch

Matthias Fitzi, Nicolas Gisin, Ueli M. Maurer, Oliver von Rotz

Published Jan 1, 2002• 41 citations
Publisher
DOI
10.1007/3-540-46035-7_32

Related papers

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

Eli Ben‐Sasson, Serge Fehr, Rafail Ostrovsky

Lecture notes in computer science•Jan 1, 2012•112 citations

General Adversary Structures in Byzantine Agreement and Multi-party Computation with Active and Omission Corruption

Konstantinos Brazitikos, Vassilis Zikas

Lecture notes in computer science•Dec 2, 2024•2 citations

Round-Efficient Byzantine Agreement and Multi-party Computation with Asynchronous Fallback

Giovanni Deligios, Martin Hirt, Chen-Da Liu-Zhang

Lecture notes in computer science•Jan 1, 2021•31 citations

Adaptively Secure Multi-Party Computation with Dishonest Majority

Sanjam Garg, Amit Sahai

Lecture notes in computer science•Jan 1, 2012•31 citations

Secure Multi-Party Computation without Agreement

Shafi Goldwasser, Yehuda Lindell

Journal of Cryptology•May 20, 2005•109 citations

Secure Multi-party Quantum Computation with a Dishonest Majority

Yfke Dulek, Alex B. Grilo, Stacey Jeffery +2 more

arXiv:1909.13770•Lecture notes in computer science•Jan 1, 2020•58 citations