Cryptology ePrint Archive: Report 2020/091

Enabling Faster Operations for Deeper Circuits in Full RNS Variants of FV-like Somewhat Homomorphic Encryption

Jonathan Takeshita and Matthew Schoenbauer and Ryan Karl and Taeho Jung

Abstract: Though Fully Homomorphic Encryption (FHE) has been realized, most practical implementations utilize leveled Somewhat Homomorphic Encryption (SHE) schemes, which have limits on the multiplicative depth of the circuits they can evaluate and avoid computationally intensive bootstrapping. Many SHE schemes exist, among which those based on Ring Learning With Error (RLWE) with operations on large polynomial rings are popular. Of these, variants allowing operations to occur fully in Residue Number Systems (RNS) have been constructed. This optimization allows homomorphic operations directly on RNS components without needing to reconstruct numbers from their RNS representation, making SHE implementations faster and highly parallel. In this paper, we present a set of optimizations to a popular RNS variant of the B/FV encryption scheme that allow for the use of significantly larger ciphertext moduli (e.g., thousands of bits) without increased overhead due to excessive numbers of RNS components or computational overhead, as well as computational optimizations. This allows for the use of larger ciphertext moduli, which leads to a higher multiplicative depth with the same computational overhead. Our experiments show that our optimizations yield runtime improvements of up to 4.48 for decryption and 14.68 for homomorphic multiplication for large ciphertext moduli.

Category / Keywords: public-key cryptography / Fully Homomorphic Encryption, B/FV Scheme, RNS Variant, Performance Optimization

Date: received 29 Jan 2020

Contact author: jtakeshi at nd edu,mschoenb@nd edu,rkarl@nd edu,tjung@nd edu

Available format(s): PDF | BibTeX Citation

Version: 20200204:124457 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]