The Exact Round Complexity of Secure Computation

Abstract. We revisit the exact round complexity of secure computation in the multi-party and twoparty settings. For the special case of two-parties without a simultaneous message exchange channel, this question has been extensively studied and resolved. In particular, Katz and Ostrovsky (CRYPTO ’04) proved that five rounds are necessary and su cient for securely realizing every two-party functionality where both parties receive the output. However, the exact round complexity of general multi-party computation, as well as two-party computation with a simultaneous message exchange channel, is not very well understood. These questions are intimately connected to the round complexity of non-malleable commitments. Indeed, the exact relationship between the round complexities of non-malleable commitments and secure multi-party computation has also not been explored. In this work, we revisit these questions and obtain several new results. First, we establish the following main results. Sup...

• Type: Journal
• Year: 2016
• Where: IACR
• Authors: Sanjam Garg, Pratyay Mukherjee, Omkant Pandey, Antigoni Polychroniadou
• Keywords: Biometrics, IACR 2016