Cryptology ePrint Archive: Report 2016/736

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

Martine De Cock and Rafael Dowsley and Caleb Horst and Raj Katti and Anderson C. A. Nascimento and Stacey C. Newman and Wing-Sea Poon

Abstract: 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 are composed out of building blocks, namely a secure comparison protocol, a protocol for obliviously selecting inputs, and a protocol for evaluating polynomials. 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 7 classification benchmark datasets from the UCI repository.

Category / Keywords: cryptographic protocols /

Date: received 26 Jul 2016, last revised 5 Mar 2017

Contact author: rafael dowsley at kit edu

Available format(s): PDF | BibTeX Citation

Version: 20170305:144620 (All versions of this report)

Short URL: ia.cr/2016/736

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]