Name
Title | ||
|---|---|---|
An improvement of key generation algorithm for Gentry's homomorphic encryption scheme |
Abstract | ||
|---|---|---|
One way of improving efficiency of Gentry's fully homomorphic encryption is controlling the number of operations, but our recollection is that any scheme which controls the bound has not proposed. In this paper, we propose a key generation algorithm for Gentry's homomorphic encryption scheme that controls the bound of the circuit depth by using the relation between the circuit depth and the eigenvalues of a basis of a lattice. We present experimental results that show that the proposed algorithm is practical. We discuss security of the basis of the lattices generated by the algorithm for practical use. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-16825-3_6 | IWSEC |
Keywords | Field | DocType |
homomorphic encryption,homomorphic encryption scheme,circuit depth,practical use,key generation algorithm,proposed algorithm,generic algorithm | Multiple encryption,Homomorphic encryption,Key generation,Lattice (order),Computer science,Computer security,Algorithm,Theoretical computer science,Circulant matrix,Probabilistic encryption,Homomorphic secret sharing,Eigenvalues and eigenvectors | Conference |
Volume | ISSN | Citations |
6434 | 0302-9743 | 6 |
PageRank | References | Authors |
1.01 | 13 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Naoki Ogura | 1 | 12 | 4.05 |
| Go Yamamoto | 2 | 23 | 3.50 |
| Tetsutaro Kobayashi | 3 | 150 | 14.85 |
| Shigenori Uchiyama | 4 | 371 | 40.90 |