Our techniques also reduce the size of the large public evaluation key, often using 33%-50% less space than the previous HElib implementation. We also implemented a new tradeoff that enables a drastic reduction in size, maybe a 25x factor or more for some parameters, paying only a 2-4x factor in runtime (and giving up some parallelization opportunities).
Category / Keywords: public-key cryptography / Homomorphic encryption, Implementation, Linear transformations, bootstrapping Original Publication (in the same form): IACR-CRYPTO-2018 Date: received 4 Mar 2018, last revised 11 May 2019 Contact author: shaih at alum mit edu Available format(s): PDF | BibTeX Citation Version: 20190511:130501 (All versions of this report) Short URL: ia.cr/2018/244