Journal of Cryptology

Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ

Yehuda Lindell, Benny Pinkas B, Nigel Paul Smart, Avishay Yanai

Published Apr 26, 2019• 32 citations

Related papers

Efficient Constant Round Multi-party Computation Combining BMR and SPDZ

Yehuda Lindell, Benny Pinkas B, Nigel Paul Smart +1 more

More Efficient Constant-Round Multi-party Computation from BMR and SHE

Yehuda Lindell, Nigel Paul Smart, Eduardo Soria-Vázquez

Low Cost Constant Round MPC Combining BMR and Oblivious Transfer

Carmit Hazay, Peter Schöll, Eduardo Soria-Vázquez

Round Efficiency of Multi-party Computation with a Dishonest Majority

Jonathan I. Katz, Rafail Ostrovsky, Adam Smith

Round and Computational Efficiency of Multi-party Protocols

Michele Ciampi, Luisa Siniscalchi

Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions

Sandro Coretti, Juan A. Garay, Martin Hirt +1 more