On the Round Complexity of Dishonest-Majority MPC
- 31 October 2026
- book chapter
- Published by Springer Nature
- p. 36-62
Abstract
No abstract availableKeywords
This publication has 50 references indexed in Scilit:
- An Unstoppable Ideal Functionality for Signatures and a Modular Analysis of the Dolev-Strong Broadcast2025
- Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited2023
- Completeness Theorems for Adaptively Secure Broadcast2023
- Broadcast-Optimal Two-Round MPC2020
- Sublinear-Round Byzantine Agreement Under Corrupt Majority2020
- Two Round Information-Theoretic MPC with Malicious Security2019
- k-Round Multiparty Computation from k-Round Oblivious Transfer via Garbled Interactive Circuits2018
- Two-Round Multiparty Secure Computation from Minimal Assumptions2018
- On Expected Constant-Round Protocols for Byzantine Agreement2006
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator2005