Full Text Views
80
In this paper, we propose the decomposition ring homomorphic encryption scheme, that is a homomorphic encryption scheme built on the decomposition ring, which is a subring of cyclotomic ring. By using the decomposition ring the structure of plaintext slot becomes ℤ_{pl}, instead of GF(p^{d}) in conventional schemes on the cyclotomic ring. For homomorphic multiplication of integers, one can use the full of ℤ_{pl} slots using the proposed scheme, although in conventional schemes one can use only one-dimensional subspace GF(p) in each GF(p^{d}) slot. This allows us to realize fast and compact homomorphic encryption for integer plaintexts. In fact, our benchmark results indicate that our decomposition ring homomorphic encryption schemes are several times faster than HElib for integer plaintexts due to its higher parallel computation.
Seiko ARITA
Institute of Information Security
Sari HANDA
Institute of Information Security
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Seiko ARITA, Sari HANDA, "Fully Homomorphic Encryption Scheme Based on Decomposition Ring" in IEICE TRANSACTIONS on Fundamentals,
vol. E103-A, no. 1, pp. 195-211, January 2020, doi: 10.1587/transfun.2019CIP0027.
Abstract: In this paper, we propose the decomposition ring homomorphic encryption scheme, that is a homomorphic encryption scheme built on the decomposition ring, which is a subring of cyclotomic ring. By using the decomposition ring the structure of plaintext slot becomes ℤ_{pl}, instead of GF(p^{d}) in conventional schemes on the cyclotomic ring. For homomorphic multiplication of integers, one can use the full of ℤ_{pl} slots using the proposed scheme, although in conventional schemes one can use only one-dimensional subspace GF(p) in each GF(p^{d}) slot. This allows us to realize fast and compact homomorphic encryption for integer plaintexts. In fact, our benchmark results indicate that our decomposition ring homomorphic encryption schemes are several times faster than HElib for integer plaintexts due to its higher parallel computation.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2019CIP0027/_p
Copy
@ARTICLE{e103-a_1_195,
author={Seiko ARITA, Sari HANDA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Fully Homomorphic Encryption Scheme Based on Decomposition Ring},
year={2020},
volume={E103-A},
number={1},
pages={195-211},
abstract={In this paper, we propose the decomposition ring homomorphic encryption scheme, that is a homomorphic encryption scheme built on the decomposition ring, which is a subring of cyclotomic ring. By using the decomposition ring the structure of plaintext slot becomes ℤ_{pl}, instead of GF(p^{d}) in conventional schemes on the cyclotomic ring. For homomorphic multiplication of integers, one can use the full of ℤ_{pl} slots using the proposed scheme, although in conventional schemes one can use only one-dimensional subspace GF(p) in each GF(p^{d}) slot. This allows us to realize fast and compact homomorphic encryption for integer plaintexts. In fact, our benchmark results indicate that our decomposition ring homomorphic encryption schemes are several times faster than HElib for integer plaintexts due to its higher parallel computation.},
keywords={},
doi={10.1587/transfun.2019CIP0027},
ISSN={1745-1337},
month={January},}
Copy
TY - JOUR
TI - Fully Homomorphic Encryption Scheme Based on Decomposition Ring
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 195
EP - 211
AU - Seiko ARITA
AU - Sari HANDA
PY - 2020
DO - 10.1587/transfun.2019CIP0027
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E103-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2020
AB - In this paper, we propose the decomposition ring homomorphic encryption scheme, that is a homomorphic encryption scheme built on the decomposition ring, which is a subring of cyclotomic ring. By using the decomposition ring the structure of plaintext slot becomes ℤ_{pl}, instead of GF(p^{d}) in conventional schemes on the cyclotomic ring. For homomorphic multiplication of integers, one can use the full of ℤ_{pl} slots using the proposed scheme, although in conventional schemes one can use only one-dimensional subspace GF(p) in each GF(p^{d}) slot. This allows us to realize fast and compact homomorphic encryption for integer plaintexts. In fact, our benchmark results indicate that our decomposition ring homomorphic encryption schemes are several times faster than HElib for integer plaintexts due to its higher parallel computation.
ER -