Skip to Main content Skip to Navigation
Conference papers

Approximate Privacy-Preserving Data Mining on Vertically Partitioned Data

Abstract : In today’s ever-increasingly digital world, the concept of data privacy has become more and more important. Researchers have developed many privacy-preserving technologies, particularly in the area of data mining and data sharing. These technologies can compute exact data mining models from private data without revealing private data, but are generally slow. We therefore present a framework for implementing efficient privacy-preserving secure approximations of data mining tasks. In particular, we implement two sketching protocols for the scalar (dot) product of two vectors which can be used as sub-protocols in larger data mining tasks. These protocols can lead to approximations which have high accuracy, low data leakage, and one to two orders of magnitude improvement in efficiency. We show these accuracy and efficiency results through extensive experimentation. We also analyze the security properties of these approximations under a security definition which, in contrast to previous definitions, allows for very efficient approximation protocols.
Document type :
Conference papers
Complete list of metadata
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Thursday, June 8, 2017 - 11:06:26 AM
Last modification on : Monday, September 23, 2019 - 11:48:01 AM
Long-term archiving on: : Saturday, September 9, 2017 - 12:58:12 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Robert Nix, Murat Kantarcioglu, Keesook Han. Approximate Privacy-Preserving Data Mining on Vertically Partitioned Data. 26th Conference on Data and Applications Security and Privacy (DBSec), Jul 2012, Paris, France. pp.129-144, ⟨10.1007/978-3-642-31540-4_11⟩. ⟨hal-01534761⟩



Les métriques sont temporairement indisponibles