We also describe an implementation of the homomorphic evaluation of the full AES encryption circuit, and obtain significantly improved performance compared to previous implementations: about 23 seconds (resp. 3 minutes) per AES block at the 72-bit (resp. 80-bit) security level on a mid-range workstation.
Finally, we prove the equivalence between the (error-free) decisional Approximate-GCD problem introduced by Cheon et al. (Eurocrypt 2013) and the classical computational Approximate-GCD problem. This equivalence allows to get rid of the additional noise in all the integer-based FHE schemes described so far, and therefore to simplify their security proof.Category / Keywords: public-key cryptography / Fully Homomorphic Encryption, Approximage-GCD, Homomorphic AES Original Publication (with major differences): IACR-PKC-2014 Date: received 11 Jan 2014 Contact author: jean-sebastien coron at uni lu Available format(s): PDF | BibTeX Citation Version: 20140112:132648 (All versions of this report) Discussion forum: Show discussion | Start new discussion