Cryptology ePrint Archive: Report 2021/1503

Interaction-Preserving Compilers for Secure Computation

Nico Döttling and Vipul Goyal and Giulio Malavolta and Justin Raizes

Abstract: In this work we consider the following question: What is the cost of security for multi-party protocols? Specifically, given an insecure protocol where parties exchange (in the worst case) $\Gamma$ bits in $N$ rounds, is it possible to design a secure protocol with communication complexity close to $\Gamma$ and $N$ rounds? We systematically study this problem in a variety of settings and we propose solutions based on the intractability of different cryptographic problems. For the case of two parties we design an interaction-preserving compiler where the number of bits exchanged in the secure protocol approaches $\Gamma$ and the number of rounds is exactly $N$, assuming the hardness of standard problems over lattices. For the more general multi-party case, we obtain the same result assuming either (i) an additional round of interaction or (ii) the existence of extractable witness encryption and succinct non-interactive arguments of knowledge. As a contribution of independent interest, we construct the first multi-key fully homomorphic encryption scheme with message-to-ciphertext ratio (i.e., rate) of $1 - o(1)$, assuming the hardness of the learning with errors (LWE) problem. We view our work as a support for the claim that, as far as interaction and communication are concerned, one does not need to pay a significant price for security in multi-party protocols.

Category / Keywords: cryptographic protocols / Multiparty Computation, Communication Complexity, Fully Homomorphic Encryption

Original Publication (with major differences): ITCS 2022

Date: received 12 Nov 2021

Contact author: nico doettling at gmail com, vipul at cmu edu, giulio malavolta at hotmail it, jraizes at andrew cmu edu

Available format(s): PDF | BibTeX Citation

Version: 20211115:125815 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]