Lecture notes in computer science

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

Vipul Goyal, Junru Li, Rafail Ostrovsky, Yifan Song

Published Jan 1, 2025• 3 citations

Related papers

Efficient Scalable Constant-Round MPC via Garbled Circuits

Aner Ben-Efraim, Yehuda Lindell, Eran Omri

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

Mohammad Hajiabadi, Ratnakar Medepalli, Akshayaram Srinivasan

Two-Round MPC Without Round Collapsing Revisited – Towards Efficient Malicious Protocols

Huijia Lin, Tianren Liu

Constant-Round MPC with Fairness and Guarantee of Output Delivery

Steven Gordon, Feng-Hao Liu, Elaine Shi

Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability

Carsten Baum, Emmanuela Orsini, Peter Schöll +1 more

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

Huijia Lin, Tianren Liu, Hoeteck Wee