Universally-Composable Two-Party Computation in Two Rounds

On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions

On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions

(Efficient) Universally Composable Two-Party Computation Using a Minimal Number of Stateless Tokens.

Round-Efficient Composable Two-Party Quantum Computation

Round-Efficient Black-Box Construction of Composable Multi-Party Computation

Round-Efficient Black-Box Construction of Composable Multi-Party Computation