The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency

On the Round Complexity of Black-Box Secure MPC

Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience

On the Round Complexity of Fully Secure Solitary MPC with Honest Majority

Perfectly-Secure MPC with Linear Communication Complexity

Constant-Round Asynchronous MPC with Optimal Resilience and Linear Communication

Information-Theoretic 2-Round MPC Without Round Collapsing: Adaptive Security, and More