Prior works either supported only an a-priori bounded number of parties (Lopez-Alt, Tromer and Vaikuntanthan, STOC '12), or only supported single-hop evaluation where all inputs need to be known before the computation starts (Clear and McGoldrick, Crypto '15, Mukherjee and Wichs, Eurocrypt '16). In all aforementioned works, the ciphertext length grew at least quadratically with the number of parties.
Technically, our starting point is the LWE-based approach of previous works. Our result is achieved via a careful use of Gentry's bootstrapping technique, tailored to the specific scheme. Our hardness assumption is that the scheme of Mukherjee and Wichs is circular secure (and thus bootstrappable). A leveled scheme can be achieved under standard LWE.Category / Keywords: public-key cryptography / fully homomorphic encryption Original Publication (with minor differences): IACR-CRYPTO-2016 Date: received 28 Mar 2016, last revised 18 Nov 2016 Contact author: renenp at gmail com Available format(s): PDF | BibTeX Citation Version: 20161118:093848 (All versions of this report) Short URL: ia.cr/2016/339 Discussion forum: Show discussion | Start new discussion