Billion-Gate Secure Computation with Malicious Adversaries
The goal of this paper is to assess the feasibility of two-party secure computation in the presence of a malicious adversary. Prior work has shown the feasibility of billion-gate circuits in the semi-honest model, but only the 35k-gate AES circuit in the malicious model, in part because security in the malicious model is much harder to achieve. The authors show that by incorporating the best known techniques and parallelizing almost all steps of the resulting protocol, evaluating billion-gate circuits is feasible in the malicious model. Their results are in the standard model (i.e., no common reference strings or PKIs) and, in contrast to prior work, they do not use the random oracle model which has well-established theoretical shortcomings.