Towards Efficiency-Preserving Round Compression in MPC: Do fewer rounds mean more computation?

Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, Abhishek Jain

Published Jan 1, 2020• 0 citations

Related papers

Towards Efficiency-Preserving Round Compression in MPC

Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel +1 more

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

Huijia Lin, Tianren Liu

Efficient Scalable Constant-Round MPC via Garbled Circuits

Aner Ben-Efraim, Yehuda Lindell, Eran Omri

Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability

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

Direct Product via Round-Preserving Compression

Mark Braverman, Anup Rao, Omri Weinstein +1 more

Round-Optimal Oblivious Transfer and MPC from Computational CSIDH

Saikrishna Badrinarayanan, Daniel Masny, Pratyay Mukherjee +3 more