An Improved RNS Variant of the BFV Homomorphic Encryption Scheme

Document Type

Conference Proceeding

Publication Date

1-1-2019

Abstract

We present an optimized variant of the Brakerski/Fan-Vercauteren (BFV) homomorphic encryption scheme and its efficient implementation in PALISADE. Our algorithmic improvements focus on optimizing decryption and homomorphic multiplication in the Residue Number System (RNS), using the Chinese Remainder Theorem (CRT) to represent and manipulate the large coefficients in the ciphertext polynomials. These improvements are based on our original general-purpose techniques for CRT basis extension and scaling that can be applied to many other lattice-based cryptographic primitives. Our variant is simpler and significantly more efficient than the RNS variant proposed by Bajard et al. both in terms of noise growth and the computational complexity of the underlying CRT basis extension and scaling procedures.

Identifier

85062782801 (Scopus)

ISBN

[9783030126117]

Publication Title

Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics

External Full Text Location

https://doi.org/10.1007/978-3-030-12612-4_5

e-ISSN

16113349

ISSN

03029743

First Page

83

Last Page

105

Volume

11405 LNCS

Fund Ref

Army Research Office

This document is currently not available here.

Share

COinS