Feasibility of Random Forest with Fully Homomorphic Encryption Applied to Network Data

Shusaku Uemura; Kazuhide Fukushima

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

Feasibility of Random Forest with Fully Homomorphic Encryption Applied to Network Data

Topics: Data and Software Security; Privacy and Security Models; Privacy Enhancing Technologies

In Proceedings of the 10th International Conference on Information Systems Security and Privacy ICISSP - Volume 1, 534-545, 2024 , Rome, Italy

Authors: Shusaku Uemura and Kazuhide Fukushima

Affiliation: KDDI Research, Inc., Saitama, Japan

Keyword(s): Fully Homomorphic Encryption, Privacy-Preserving Machine Learning, Random Forest, TFHE, Network Data.

Abstract: Random forests are powerful and interpretable machine learning models. Such models are used for analyzing data in various fields. To protect privacy, many methods have been proposed to evaluate random forests with fully homomorphic encryption (FHE), which enables operations such as addition and multiplication under the encryption. In this paper, we focus on the feasibility of random forests with FHE applied to network data. We conducted experiments with random forests with FHE on IoT device classification for three types of bits and nine types of depths. By exponential regressions on the results, we obtained the relations between computation time and depths. This result enables us to estimate the computation time for deeper models.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 18.220.27.93

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

Uemura, S. and Fukushima, K. (2024). Feasibility of Random Forest with Fully Homomorphic Encryption Applied to Network Data. In Proceedings of the 10th International Conference on Information Systems Security and Privacy - ICISSP; ISBN 978-989-758-683-5; ISSN 2184-4356, SciTePress, pages 534-545. DOI: 10.5220/0012394600003648

@conference{icissp24,
author={Shusaku Uemura. and Kazuhide Fukushima.},
title={Feasibility of Random Forest with Fully Homomorphic Encryption Applied to Network Data},
booktitle={Proceedings of the 10th International Conference on Information Systems Security and Privacy - ICISSP},
year={2024},
pages={534-545},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0012394600003648},
isbn={978-989-758-683-5},
issn={2184-4356},
}

TY - CONF

JO - Proceedings of the 10th International Conference on Information Systems Security and Privacy - ICISSP
TI - Feasibility of Random Forest with Fully Homomorphic Encryption Applied to Network Data
SN - 978-989-758-683-5
IS - 2184-4356
AU - Uemura, S.
AU - Fukushima, K.
PY - 2024
SP - 534
EP - 545
DO - 10.5220/0012394600003648
PB - SciTePress