Efficient and Private Scoring of Decision Trees, Support Vector Machines and Logistic Regression Models based on Pre-Computation

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  • M. De Cock, University of Washington Tacoma
  • ,
  • R. Dowsley
  • ,
  • C. Horst, University of Washington Tacoma
  • ,
  • R. Katti
  • ,
  • A. Nascimento, University of Washington Tacoma
  • ,
  • W. S. Poon, University of Washington Tacoma
  • ,
  • S. Truex, Georgia Institute of Technology

Many data-driven personalized services require that private data of users is scored against a trained machine learning model. In this paper we propose a novel protocol for privacy-preserving classification of decision trees, a popular machine learning model in these scenarios. Our solutions is composed out of building blocks, namely a secure comparison protocol, a protocol for obliviously selecting inputs, and a protocol for multiplication. By combining some of the building blocks for our decision tree classification protocol, we also improve previously proposed solutions for classification of support vector machines and logistic regression models. Our protocols are information theoretically secure and, unlike previously proposed solutions, do not require modular exponentiations. We show that our protocols for privacy-preserving classification lead to more efficient results from the point of view of computational and communication complexities. We present accuracy and runtime results for seven classification benchmark datasets from the UCI repository.

Original languageEnglish
Article number7873244
JournalIEEE Transactions on Dependable and Secure Computing
Pages (from-to)217-230
Number of pages14
Publication statusPublished - Mar 2019

See relations at Aarhus University Citationformats

ID: 120115813