Analysis of Lattice Reduction Attack against the Somewhat Homomorphic Encryption Based on Ideal Lattices

Autor:	Jun Yajima, Jun Kogure, Takeshi Shimoyama, Masaya Yasuda
Rok vydání:	2013
Předmět:	Theoretical computer science Computer science business.industry Lattice problem Lattice (order) Homomorphic encryption Lattice reduction Encryption business Computer Science::Cryptography and Security
Zdroj:	Public Key Infrastructures, Services and Applications ISBN: 9783642400117 EuroPKI
DOI:	10.1007/978-3-642-40012-4_1
Popis:	In 2009, Gentry first proposed a concrete method for constructing a fully homomorphic encryption FHE scheme, which supports arbitrary operations on encrypted data. The construction of the FHE scheme starts from a somewhat homomorphic encryption SHE scheme, which only supports limited operations but can be much faster than the FHE scheme. The Gentry's scheme is based on ideal lattices, and Chen and Nguyen estimated that it needs at least 10,000 lattice dimension to make the FHE scheme secure. In contrast, the security of the SHE scheme can be guaranteed for lower lattice dimensions, depending on the possible operations which are determined by key parameters. The aim of this paper is to classify which key parameters are feasible to be solved. We attack the lattice problem of lower dimensions by practical lattice reduction algorithms, and estimate the key parameters which can be solved in practice.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::91ce7355eb70d584988605ef018b03c7 https://doi.org/10.1007/978-3-642-40012-4_1 Zobrazit plný text záznamu