The following publications are possibly variants of this publication:
- Two-Thirds Honest-Majority MPC for Malicious Adversaries at Almost the Cost of Semi-HonestJun Furukawa 0001, Yehuda Lindell. iacr, 2019:658, 2019. [doi]
- Fast Large-Scale Honest-Majority MPC for Malicious AdversariesKoji Chida, Daniel Genkin, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Yehuda Lindell, Ariel Nof. crypto 2018: 34-64 [doi]
- Fast Large-Scale Honest-Majority MPC for Malicious AdversariesKoji Chida, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Daniel Genkin, Yehuda Lindell, Ariel Nof. joc, 36(3):15, July 2023. [doi]
- Fast Large-Scale Honest-Majority MPC for Malicious AdversariesKoji Chida, Daniel Genkin, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Yehuda Lindell, Ariel Nof. iacr, 2018:570, 2018. [doi]
- Optimized Honest-Majority MPC for Malicious Adversaries - Breaking the 1 Billion-Gate Per Second BarrierToshinori Araki, Assi Barak, Jun Furukawa, Tamar Lichter, Yehuda Lindell, Ariel Nof, Kazuma Ohara, Adi Watzman, Or Weinstein. sp 2017: 843-862 [doi]
- A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-MajorityYehuda Lindell, Ariel Nof. ccs 2017: 259-276 [doi]
- A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-MajorityYehuda Lindell, Ariel Nof. iacr, 2017:816, 2017. [doi]
- High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest MajorityJun Furukawa, Yehuda Lindell, Ariel Nof, Or Weinstein. eurocrypt 2017: 225-255 [doi]
- High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest MajorityJun Furukawa, Yehuda Lindell, Ariel Nof, Or Weinstein. iacr, 2016:944, 2016. [doi]