An Improved RNS Variant of the BFV Homomorphic Encryption Scheme

Shai Halevi, Yuriy Polyakov, Victor Shoup

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationTopics in Cryptology – CT-RSA 2019 - The Cryptographers’ Track at the RSA Conference 2019, Proceedings
EditorsMitsuru Matsui
PublisherSpringer-Verlag
Pages83-105
Number of pages23
ISBN (Print)9783030126117
DOIs
StatePublished - Jan 1 2019
EventCryptographers Track at the RSA Conference 2019, CT-RSA 2019 - San Francisco, United States
Duration: Mar 4 2019Mar 8 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11405 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceCryptographers Track at the RSA Conference 2019, CT-RSA 2019
CountryUnited States
CitySan Francisco
Period3/4/193/8/19

Fingerprint

Residue number System
Chinese remainder theorem
Homomorphic Encryption
Numbering systems
Fans
Cryptography
Scaling
Computational complexity
Homomorphic
Polynomials
Efficient Implementation
Multiplication
Computational Complexity
Polynomial
Coefficient

Keywords

  • Homomorphic encryption
  • Lattice-based cryptography
  • Post-quantum cryptography
  • Residue number systems
  • Software implementation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Halevi, S., Polyakov, Y., & Shoup, V. (2019). An Improved RNS Variant of the BFV Homomorphic Encryption Scheme. In M. Matsui (Ed.), Topics in Cryptology – CT-RSA 2019 - The Cryptographers’ Track at the RSA Conference 2019, Proceedings (pp. 83-105). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11405 LNCS). Springer-Verlag. https://doi.org/10.1007/978-3-030-12612-4_5

An Improved RNS Variant of the BFV Homomorphic Encryption Scheme. / Halevi, Shai; Polyakov, Yuriy; Shoup, Victor.

Topics in Cryptology – CT-RSA 2019 - The Cryptographers’ Track at the RSA Conference 2019, Proceedings. ed. / Mitsuru Matsui. Springer-Verlag, 2019. p. 83-105 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11405 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Halevi, S, Polyakov, Y & Shoup, V 2019, An Improved RNS Variant of the BFV Homomorphic Encryption Scheme. in M Matsui (ed.), Topics in Cryptology – CT-RSA 2019 - The Cryptographers’ Track at the RSA Conference 2019, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11405 LNCS, Springer-Verlag, pp. 83-105, Cryptographers Track at the RSA Conference 2019, CT-RSA 2019, San Francisco, United States, 3/4/19. https://doi.org/10.1007/978-3-030-12612-4_5
Halevi S, Polyakov Y, Shoup V. An Improved RNS Variant of the BFV Homomorphic Encryption Scheme. In Matsui M, editor, Topics in Cryptology – CT-RSA 2019 - The Cryptographers’ Track at the RSA Conference 2019, Proceedings. Springer-Verlag. 2019. p. 83-105. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-12612-4_5
Halevi, Shai ; Polyakov, Yuriy ; Shoup, Victor. / An Improved RNS Variant of the BFV Homomorphic Encryption Scheme. Topics in Cryptology – CT-RSA 2019 - The Cryptographers’ Track at the RSA Conference 2019, Proceedings. editor / Mitsuru Matsui. Springer-Verlag, 2019. pp. 83-105 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{d54fea495b1d451eb982444bdca72c0b,
title = "An Improved RNS Variant of the BFV Homomorphic Encryption Scheme",
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.",
keywords = "Homomorphic encryption, Lattice-based cryptography, Post-quantum cryptography, Residue number systems, Software implementation",
author = "Shai Halevi and Yuriy Polyakov and Victor Shoup",
year = "2019",
month = "1",
day = "1",
doi = "10.1007/978-3-030-12612-4_5",
language = "English (US)",
isbn = "9783030126117",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag",
pages = "83--105",
editor = "Mitsuru Matsui",
booktitle = "Topics in Cryptology – CT-RSA 2019 - The Cryptographers’ Track at the RSA Conference 2019, Proceedings",

}

TY - GEN

T1 - An Improved RNS Variant of the BFV Homomorphic Encryption Scheme

AU - Halevi, Shai

AU - Polyakov, Yuriy

AU - Shoup, Victor

PY - 2019/1/1

Y1 - 2019/1/1

N2 - 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.

AB - 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.

KW - Homomorphic encryption

KW - Lattice-based cryptography

KW - Post-quantum cryptography

KW - Residue number systems

KW - Software implementation

UR - http://www.scopus.com/inward/record.url?scp=85062782801&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85062782801&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-12612-4_5

DO - 10.1007/978-3-030-12612-4_5

M3 - Conference contribution

AN - SCOPUS:85062782801

SN - 9783030126117

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 83

EP - 105

BT - Topics in Cryptology – CT-RSA 2019 - The Cryptographers’ Track at the RSA Conference 2019, Proceedings

A2 - Matsui, Mitsuru

PB - Springer-Verlag

ER -