In this paper, we construct subring homomorphic encryption scheme that is a homomorphic encryption scheme built on the decomposition ring, which is a subring of cyclotomic ring. In the scheme, each plaintext slot contains an integer in Z p l , rather than an element of GF(p d ) as in conventional homomorphic encryption schemes on cyclotomic rings. Our benchmark results indicate that the subring homomorphic encryption scheme is several times faster than HElib for mod-p l integer plaintexts, due to its high parallelism of mod-p l integer slot structure. We believe in that such plaintext structure composed of mod-p l integer slots will be more natural, easy to handle, and significantly more efficient for many applications such as outsourced data mining, than conventional GF(p d ) slots.
CITATION STYLE
Arita, S., & Handa, S. (2018). Subring homomorphic encryption. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10779 LNCS, pp. 112–136). Springer Verlag. https://doi.org/10.1007/978-3-319-78556-1_7
Mendeley helps you to discover research relevant for your work.