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

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

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

Published Jan 1, 2021• 25 citations
Publisher
DOI
10.1007/978-3-030-90459-3_21

Related papers

Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions

Sandro Coretti, Juan A. Garay, Martin Hirt +1 more

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

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

Matthias Fitzi, Nicolas Gisin, Ueli M. Maurer +1 more

Lecture notes in computer science•Jan 1, 2002•40 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•1 citation

Round and Computational Efficiency of Multi-party Protocols

Michele Ciampi, Luisa Siniscalchi

Information security and cryptography•Aug 21, 2025•0 citations

Cryptographic Asynchronous Multi-party Computation with Optimal Resilience

Martin Hirt, Jesper Buus Nielsen, Bartosz Przydatek

Lecture notes in computer science•Jan 1, 2005•42 citations

Improving the Efficiency of Optimally-Resilient Statistically-Secure Asynchronous Multi-party Computation

Ashish Choudhury

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