Lecture notes in computer science

Round-Optimal Black-Box MPC in the Plain Model from Minimal Assumptions

Mohammad Hajiabadi, Ratnakar Medepalli, Akshayaram Srinivasan

Published Jan 1, 2026• 0 citations

Related papers

Round-Optimal Black-Box MPC in the Plain Model

Yuval Ishai, Dakshita Khurana, Amit Sahai +1 more

On the Round Complexity of Black-Box Secure MPC

Yuval Ishai, Dakshita Khurana, Amit Sahai +1 more

Two-Round MPC: Information-Theoretic and Black-Box

Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan

Towards Building Scalable Constant-Round MPC from Minimal Assumptions via Round Collapsing

Vipul Goyal, Junru Li, Rafail Ostrovsky +1 more

Round-Optimal Black-Box Multiparty Computation from Polynomial-Time Assumptions

Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi +1 more

Broadcast-Optimal Four-Round MPC in the Plain Model

Michele Ciampi, Ivan Damgård, Divya Ravi +3 more