Paper 2023/258
Privacy-Preserving Tree-Based Inference with Fully Homomorphic Encryption
Abstract
Privacy enhancing technologies (PETs) have been proposed as a way to protect the privacy of data while still allowing for data analysis. In this work, we focus on Fully Homomorphic Encryption (FHE), a powerful tool that allows for arbitrary computations to be performed on encrypted data. FHE has received lots of attention in the past few years and has reached realistic execution times and correctness. More precisely, we explain in this paper how we apply FHE to tree-based models and get state-of-the-art solutions over encrypted tabular data. We show that our method is applicable to a wide range of tree-based models, including decision trees, random forests, and gradient boosted trees, and has been implemented within the Concrete-ML library, which is open-source at https://github.com/zama-ai/concrete-ml. With a selected set of use-cases, we demonstrate that our FHE version is very close to the unprotected version in terms of accuracy.
Metadata
- Available format(s)
-
PDF
- Category
- Applications
- Publication info
- Preprint.
- Keywords
- FHEMachine LearningTree-Based ModelsTFHEPrivacy
- Contact author(s)
- jordan frery @ zama ai
- History
- 2023-03-13: revised
- 2023-02-22: received
- See all versions
- Short URL
- https://ia.cr/2023/258
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/258,
author = {Jordan Frery and Andrei Stoian and Roman Bredehoft and Luis Montero and Celia Kherfallah and Benoit Chevallier-Mames and Arthur Meyre},
title = {Privacy-Preserving Tree-Based Inference with Fully Homomorphic Encryption},
howpublished = {Cryptology ePrint Archive, Paper 2023/258},
year = {2023},
note = {\url{https://eprint.iacr.org/2023/258}},
url = {https://eprint.iacr.org/2023/258}
}
