On the exact decryption range for Gentry-Halevi's implementation of fully homomorphic encryption

Masaya Yasuda, Kazuhiro Yokoyama, Takeshi Shimoyama, Jun Kogure, Takeshi Koshiba

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In this paper, we revisit the fully homomorphic encryption (FHE) scheme implemented by Gentry and Halevi, which is just an instantiation of Gentry's original scheme based on ideal lattices. Their FHE scheme starts from a somewhat homomorphic encryption (SHE) scheme, and its decryption range is deeply related with the FHE construction. Gentry and Halevi gave an experimental evaluation of the decryption range, but theoretical evaluations have not been given so far. Moreover, we give a theoretical upper bound, and reconsider suitable parameters for theoretically obtaining an FHE scheme. In particular, while Gentry and Halevi use the Euclidean norm evaluation in the noise management of ciphertexts, our theoretical bound enables us to use the ∞-norm evaluation, and hence it helps to lower the difficulty of controlling the noise density of ciphertexts.

Original languageEnglish
Pages (from-to)305-329
Number of pages25
JournalJournal of Mathematical Cryptology
Volume8
Issue number3
DOIs
Publication statusPublished - 2014 Sep 1
Externally publishedYes

Fingerprint

Homomorphic Encryption
Cryptography
Range of data
Evaluation
Lattice Ideal
Euclidean norm
Experimental Evaluation
Upper bound
Norm

Keywords

  • bootstrapping method
  • Fully homomorphic encryption
  • ideal lattices
  • re-encryption process

ASJC Scopus subject areas

  • Computer Science Applications
  • Computational Mathematics
  • Applied Mathematics

Cite this

On the exact decryption range for Gentry-Halevi's implementation of fully homomorphic encryption. / Yasuda, Masaya; Yokoyama, Kazuhiro; Shimoyama, Takeshi; Kogure, Jun; Koshiba, Takeshi.

In: Journal of Mathematical Cryptology, Vol. 8, No. 3, 01.09.2014, p. 305-329.

Research output: Contribution to journalArticle

Yasuda, Masaya ; Yokoyama, Kazuhiro ; Shimoyama, Takeshi ; Kogure, Jun ; Koshiba, Takeshi. / On the exact decryption range for Gentry-Halevi's implementation of fully homomorphic encryption. In: Journal of Mathematical Cryptology. 2014 ; Vol. 8, No. 3. pp. 305-329.
@article{31d0691327d242f28aa68c6a801a44d3,
title = "On the exact decryption range for Gentry-Halevi's implementation of fully homomorphic encryption",
abstract = "In this paper, we revisit the fully homomorphic encryption (FHE) scheme implemented by Gentry and Halevi, which is just an instantiation of Gentry's original scheme based on ideal lattices. Their FHE scheme starts from a somewhat homomorphic encryption (SHE) scheme, and its decryption range is deeply related with the FHE construction. Gentry and Halevi gave an experimental evaluation of the decryption range, but theoretical evaluations have not been given so far. Moreover, we give a theoretical upper bound, and reconsider suitable parameters for theoretically obtaining an FHE scheme. In particular, while Gentry and Halevi use the Euclidean norm evaluation in the noise management of ciphertexts, our theoretical bound enables us to use the ∞-norm evaluation, and hence it helps to lower the difficulty of controlling the noise density of ciphertexts.",
keywords = "bootstrapping method, Fully homomorphic encryption, ideal lattices, re-encryption process",
author = "Masaya Yasuda and Kazuhiro Yokoyama and Takeshi Shimoyama and Jun Kogure and Takeshi Koshiba",
year = "2014",
month = "9",
day = "1",
doi = "10.1515/jmc-2013-0024",
language = "English",
volume = "8",
pages = "305--329",
journal = "Journal of Mathematical Cryptology",
issn = "1862-2976",
publisher = "Walter de Gruyter GmbH & Co. KG",
number = "3",

}

TY - JOUR

T1 - On the exact decryption range for Gentry-Halevi's implementation of fully homomorphic encryption

AU - Yasuda, Masaya

AU - Yokoyama, Kazuhiro

AU - Shimoyama, Takeshi

AU - Kogure, Jun

AU - Koshiba, Takeshi

PY - 2014/9/1

Y1 - 2014/9/1

N2 - In this paper, we revisit the fully homomorphic encryption (FHE) scheme implemented by Gentry and Halevi, which is just an instantiation of Gentry's original scheme based on ideal lattices. Their FHE scheme starts from a somewhat homomorphic encryption (SHE) scheme, and its decryption range is deeply related with the FHE construction. Gentry and Halevi gave an experimental evaluation of the decryption range, but theoretical evaluations have not been given so far. Moreover, we give a theoretical upper bound, and reconsider suitable parameters for theoretically obtaining an FHE scheme. In particular, while Gentry and Halevi use the Euclidean norm evaluation in the noise management of ciphertexts, our theoretical bound enables us to use the ∞-norm evaluation, and hence it helps to lower the difficulty of controlling the noise density of ciphertexts.

AB - In this paper, we revisit the fully homomorphic encryption (FHE) scheme implemented by Gentry and Halevi, which is just an instantiation of Gentry's original scheme based on ideal lattices. Their FHE scheme starts from a somewhat homomorphic encryption (SHE) scheme, and its decryption range is deeply related with the FHE construction. Gentry and Halevi gave an experimental evaluation of the decryption range, but theoretical evaluations have not been given so far. Moreover, we give a theoretical upper bound, and reconsider suitable parameters for theoretically obtaining an FHE scheme. In particular, while Gentry and Halevi use the Euclidean norm evaluation in the noise management of ciphertexts, our theoretical bound enables us to use the ∞-norm evaluation, and hence it helps to lower the difficulty of controlling the noise density of ciphertexts.

KW - bootstrapping method

KW - Fully homomorphic encryption

KW - ideal lattices

KW - re-encryption process

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

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

U2 - 10.1515/jmc-2013-0024

DO - 10.1515/jmc-2013-0024

M3 - Article

AN - SCOPUS:84928810656

VL - 8

SP - 305

EP - 329

JO - Journal of Mathematical Cryptology

JF - Journal of Mathematical Cryptology

SN - 1862-2976

IS - 3

ER -