IEICE TRANSACTIONS on Fundamentals
Hardware-Accelerated Secured Naïve Bayesian Filter Based on Partially Homomorphic Encryption
Summary :
In this work, we provide the first practical secure email filtering scheme based on homomorphic encryption. Specifically, we construct a secure naïve Bayesian filter (SNBF) using the Paillier scheme, a partially homomorphic encryption (PHE) scheme. We first show that SNBF can be implemented with only the additive homomorphism, thus eliminating the need to employ expensive fully homomorphic schemes. In addition, the design space for specialized hardware architecture realizing SNBF is explored. We utilize a recursive Karatsuba Montgomery structure to accelerate the homomorphic operations, where multiplication of 2048-bit integers are carried out. Through the experiment, both software and hardware versions of the SNBF are implemented. On software, 104-105x runtime and 103x storage reduction are achieved by SNBF, when compared to existing fully homomorphic approaches. By instantiating the designed hardware for SNBF, a further 33x runtime and 1919x power reduction are achieved. The proposed hardware implementation classifies an average-length email in under 0.5s, which is much more practical than existing solutions.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E102-A No.2 pp.430-439
- Publication Date
- 2019/02/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E102.A.430
- Type of Manuscript
- PAPER
- Category
- Cryptography and Information Security
Authors
Song BIAN
Kyoto University
Masayuki HIROMOTO
Kyoto University
Takashi SATO
Kyoto University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Song BIAN, Masayuki HIROMOTO, Takashi SATO, "Hardware-Accelerated Secured Naïve Bayesian Filter Based on Partially Homomorphic Encryption" in IEICE TRANSACTIONS on Fundamentals,
vol. E102-A, no. 2, pp. 430-439, February 2019, doi: 10.1587/transfun.E102.A.430.
Abstract: In this work, we provide the first practical secure email filtering scheme based on homomorphic encryption. Specifically, we construct a secure naïve Bayesian filter (SNBF) using the Paillier scheme, a partially homomorphic encryption (PHE) scheme. We first show that SNBF can be implemented with only the additive homomorphism, thus eliminating the need to employ expensive fully homomorphic schemes. In addition, the design space for specialized hardware architecture realizing SNBF is explored. We utilize a recursive Karatsuba Montgomery structure to accelerate the homomorphic operations, where multiplication of 2048-bit integers are carried out. Through the experiment, both software and hardware versions of the SNBF are implemented. On software, 104-105x runtime and 103x storage reduction are achieved by SNBF, when compared to existing fully homomorphic approaches. By instantiating the designed hardware for SNBF, a further 33x runtime and 1919x power reduction are achieved. The proposed hardware implementation classifies an average-length email in under 0.5s, which is much more practical than existing solutions.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E102.A.430/_p
Copy
@ARTICLE{e102-a_2_430,
author={Song BIAN, Masayuki HIROMOTO, Takashi SATO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Hardware-Accelerated Secured Naïve Bayesian Filter Based on Partially Homomorphic Encryption},
year={2019},
volume={E102-A},
number={2},
pages={430-439},
abstract={In this work, we provide the first practical secure email filtering scheme based on homomorphic encryption. Specifically, we construct a secure naïve Bayesian filter (SNBF) using the Paillier scheme, a partially homomorphic encryption (PHE) scheme. We first show that SNBF can be implemented with only the additive homomorphism, thus eliminating the need to employ expensive fully homomorphic schemes. In addition, the design space for specialized hardware architecture realizing SNBF is explored. We utilize a recursive Karatsuba Montgomery structure to accelerate the homomorphic operations, where multiplication of 2048-bit integers are carried out. Through the experiment, both software and hardware versions of the SNBF are implemented. On software, 104-105x runtime and 103x storage reduction are achieved by SNBF, when compared to existing fully homomorphic approaches. By instantiating the designed hardware for SNBF, a further 33x runtime and 1919x power reduction are achieved. The proposed hardware implementation classifies an average-length email in under 0.5s, which is much more practical than existing solutions.},
keywords={},
doi={10.1587/transfun.E102.A.430},
ISSN={1745-1337},
month={February},}
Copy
TY - JOUR
TI - Hardware-Accelerated Secured Naïve Bayesian Filter Based on Partially Homomorphic Encryption
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 430
EP - 439
AU - Song BIAN
AU - Masayuki HIROMOTO
AU - Takashi SATO
PY - 2019
DO - 10.1587/transfun.E102.A.430
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E102-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2019
AB - In this work, we provide the first practical secure email filtering scheme based on homomorphic encryption. Specifically, we construct a secure naïve Bayesian filter (SNBF) using the Paillier scheme, a partially homomorphic encryption (PHE) scheme. We first show that SNBF can be implemented with only the additive homomorphism, thus eliminating the need to employ expensive fully homomorphic schemes. In addition, the design space for specialized hardware architecture realizing SNBF is explored. We utilize a recursive Karatsuba Montgomery structure to accelerate the homomorphic operations, where multiplication of 2048-bit integers are carried out. Through the experiment, both software and hardware versions of the SNBF are implemented. On software, 104-105x runtime and 103x storage reduction are achieved by SNBF, when compared to existing fully homomorphic approaches. By instantiating the designed hardware for SNBF, a further 33x runtime and 1919x power reduction are achieved. The proposed hardware implementation classifies an average-length email in under 0.5s, which is much more practical than existing solutions.
ER -
English
