https://hal.inria.fr/hal-01534312Ganesh, ChayaChayaGaneshIIT Madras - Indian Institute of Technology MadrasPandu Rangan, C.C.Pandu RanganIIT Madras - Indian Institute of Technology MadrasOptimal Parameters for Efficient Two-Party Computation ProtocolsHAL CCSD2012secure computationmalicious adversariescheating probabilitycommunication complexity[INFO] Computer Science [cs]Ifip, HalIoannis AskoxylakisHenrich C. PĂ¶hlsJoachim Posegga2017-06-07 15:03:442018-07-21 17:22:022017-06-07 15:05:24enConference papershttps://hal.inria.fr/hal-01534312/document10.1007/978-3-642-30955-7_12application/pdf1We study the optimal parameters to minimize the cheating probability and communication complexity in protocols for two party computation secure against malicious adversaries. In cut-and-choose protocols for two party computation, we analyze 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 constant bandwidth. More generally, the communication cost of opening a circuit is different from retaining the circuit for evaluation and we analyze the optimal parameters in this case, by fixing the total bits of communication. In the second part of our analysis, we minimize the communication complexity for a given probability of undetected cheating. We study, what should be the parameters to achieve a given cheating probability in minimum amount of communication in a given cut-and-choose protocol. 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.