Communication Complexity of Efficient Two-party Computation Protocols:

  Analyzed Cut-and-choose constructions for secure two party computation in the presence of malicious adversaries. Gave an analysis of the optimal parameters to keep the probability of undetected cheating minimum. We first study this for a constant number of circuits, and then generalize it to the case of a constant bandwidth. We then minimize the communication complexity while still keeping the security guarantees, that is, the cheating probability negligible. We achieve a concrete improvement in communication complexity by using optimal parameters in existing cut-and-choose protocols. [Manuscript].