Reducer achieves optimal-complexity asynchronous MVBA with t < n/4 resilience using collision-resistant hashes and a new SMBA primitive; Reducer++ extends to near-optimal resilience via random-oracle hashes.
Cryptology ePrint Archive, Paper 2023/1549 (2023),https://eprint
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Toward Optimal-Complexity Hash-Based Asynchronous MVBA with Optimal Resilience
Reducer achieves optimal-complexity asynchronous MVBA with t < n/4 resilience using collision-resistant hashes and a new SMBA primitive; Reducer++ extends to near-optimal resilience via random-oracle hashes.