The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Privately Evaluating Decision Trees and Random Forests
Open accessAbstract
Decision trees and random forests are common classifiers with widespread use. In this paper, we develop two protocols for privately evaluating decision trees and random forests. We operate in the standard two-party setting where the server holds a model (either a tree or a forest), and the client holds an input (a feature vector). At the conclusion of the protocol, the client learns only the model’s output on its input and a few generic parameters concerning the model; the server learns nothing. The first protocol we develop provides security against semi-honest adversaries. We then give an extension of the semi-honest protocol that is robust against malicious adversaries. We implement both protocols and show that both variants are able to process trees with several hundred decision nodes in just a few seconds and a modest amount of bandwidth. Compared to previous semi-honest protocols for private decision tree evaluation, we demonstrate a tenfold improvement in computation and bandwidth.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Paillier, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_16 · Cited by 7,250
Privacy Preserving Data Mining
Lindell, Y., & Pinkas, B. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6_3 · Cited by 1,077
Private predictive analysis on encrypted medical data
Bos, J. W., Lauter, K., & Naehrig, M. (2014) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2014.04.003 · Cited by 283 · cited 1×
“While these methods have been successfully applied to several problems in privacypreserving data mining [16, 39], the methods are limited to simple functionalities.”
MethodDecision tree classifiers for automated medical diagnosis
Azar, A. T., & El-Metwally, S. M. (2013) · Neural Computing and Applications · doi:10.1007/s00521-012-1196-7 · Cited by 242
Cited by
Oblivious Neural Network Predictions via MiniONN Transformations
Liu, J., Juuti, M., Lu, Y., & Asokan, N. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3134056 · Cited by 691
SecureNN: 3-Party Secure Computation for Neural Network Training
Wagh, S., Gupta, D., & Chandran, N. (2019) · Proceedings on Privacy Enhancing Technologies · doi:10.2478/popets-2019-0035 · Cited by 413
Demystifying Membership Inference Attacks in Machine Learning as a Service
Truex, S., Liu, L., Gursoy, M. E., Yu, L., & Wei, W. (2021) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2019.2897554 · Cited by 282
Homomorphic Encryption for Machine Learning in Medicine and Bioinformatics
Wood, A., Najarian, K., & Kahrobaei, D. (2021) · ACM Computing Surveys · doi:10.1145/3394658 · Cited by 179
Metadata
- Authors
- Wu, D. J., Feng, T., Naehrig, M., & Lauter, K.
- Venue
- Proceedings on Privacy Enhancing Technologies
- Published
- 2016-07-14
- Volume
- 2016
- Issue
- 4
- Pages
- 335-355
- ISSN
- 2299-0984 (ISSN-L)
- OpenAlex
- W2398935881
- Cited by
- 183
- References
- 5
- FWCI
- 14.94
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Privately Evaluating Decision Trees and Random Forests. https://app.cochat.ai/papers/10.1515/popets-2016-0043
- The paper
- Wu, D. J., Feng, T., Naehrig, M., & Lauter, K. (2016). Privately Evaluating Decision Trees and Random Forests. Proceedings on Privacy Enhancing Technologies. https://doi.org/10.1515/popets-2016-0043
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.