Which Ring Based Somewhat Homomorphic Encryption Scheme is Best?

Ana Costache, Nigel P Smart

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

30 Citations (Scopus)

Abstract

The purpose of this paper is to compare side-by-side the NTRU and BGV schemes in their non-scale invariant (messages in the lower bits), and their scale invariant (message in the upper bits) forms. The scale invariant versions are often called the YASHE and FV schemes. As an additional optimization, we also investigate the ffect of modulus reduction on the scale-invariant schemes. We compare the schemes using the “average case” noise analysis presented by Gentry et al. In addition we unify notation and techniques so as to show commonalities between the schemes. We find that the BGV scheme appears to be more efficient for large plaintext moduli, whilst YASHE seems more efficient for small plaintext moduli (although the benefit is not as great as one would have expected).
Original languageEnglish
Title of host publicationTopics in Cryptology - CT-RSA 2016
Subtitle of host publicationThe Cryptographers' Track at the RSA Conference 2016, San Francisco, CA, USA, February 29 - March 4, 2016, Proceedings
PublisherSpringer
Pages325-340
Number of pages16
ISBN (Electronic)9783319294858
ISBN (Print)9783319294841
DOIs
Publication statusPublished - 29 Feb 2016

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume9610
ISSN (Print)0302-9743

Keywords

  • public-key cryptography

Fingerprint Dive into the research topics of 'Which Ring Based Somewhat Homomorphic Encryption Scheme is Best?'. Together they form a unique fingerprint.

Cite this