@inproceedings{ef0c5cd476c8420db352b854a7ae0df3,
title = "Secure Decision Forest Evaluation",
abstract = "Decision forests are classical models to efficiently make decision on complex inputs with multiple features. While the global structure of the trees or forests is public, sensitive information have to be protected during the evaluation of some client inputs with respect to some server model. Indeed, the comparison thresholds on the server side may have economical value while the client inputs might be critical personal data. In addition, soundness is also important for the receiver. In our case, we will consider the server to be interested in the outcome of the model evaluation so that the client should not be able to bias it. In this paper, we propose a new offline/online protocol between a client and a server with a constant number of rounds in the online phase, with both privacy and soundness against malicious clients.",
keywords = "cryptography, decision tree, machine learning, secure evaluation",
author = "Slim Bettaieb and Loic Bidoux and Olivier Blazy and Baptiste Cottier and David Pointcheval",
note = "Publisher Copyright: {\textcopyright} 2021 ACM.; 16th International Conference on Availability, Reliability and Security, ARES 2021 ; Conference date: 17-08-2021 Through 20-08-2021",
year = "2021",
month = aug,
day = "17",
doi = "10.1145/3465481.3465763",
language = "English",
series = "ACM International Conference Proceeding Series",
publisher = "Association for Computing Machinery",
booktitle = "16th International Conference on Availability, Reliability and Security, ARES 2021",
}