On the Exact Round Complexity of Multi-Party Computation in the Plain Model

The talk provides an overview of the optimal round complexity of secure multi-party computation with unanimous abort security in the plain model in settings where the adversary may corrupt a majority of the parties. The focus will be on the main challenges and key techniques involved in constructing such protocols using cryptographic primitives in a black-box way.outlining