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

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

研究成果: Article査読

1 被引用数 (Scopus)

抄録

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.

本文言語English
ページ(範囲)305-329
ページ数25
ジャーナルJournal of Mathematical Cryptology
8
3
DOI
出版ステータスPublished - 2014 9月 1
外部発表はい

ASJC Scopus subject areas

  • コンピュータ サイエンスの応用
  • 計算数学
  • 応用数学

フィンガープリント

「On the exact decryption range for Gentry-Halevi's implementation of fully homomorphic encryption」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル