Yet Another Compiler for Active Security or : Efficient MPC Over Arbitrary Rings

This is the scientific report for the paper entitled “Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings”. This research produces a powerful idea for transforming any semi-honestly secure multiparty computation (MPC) into an actively secure protocol while taking into consideration reducing the threshold of tolerance corruption for real parties by semi-honest adversaries. An efficient compiler has introduced a new multiparty computation protocol for the important case of secure evaluation of arithmetic circuits over arbitrary rings (we show three parties). The first protocol for secure computation over arbitrary rings that achieves active security with constant overhead is produced in this research.