Approximate Privacy-Preserving Data Mining on Vertically Partitioned Data - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Approximate Privacy-Preserving Data Mining on Vertically Partitioned Data

(1) , (1) , (2)


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.
Fichier principal
Vignette du fichier
978-3-642-31540-4_11_Chapter.pdf (415.5 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01534761 , version 1 (08-06-2017)


Attribution - CC BY 4.0



Robert Nix, Murat Kantarcioglu, Keesook J. 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⟩
57 View
125 Download



Gmail Facebook Twitter LinkedIn More