Skip to Main content Skip to Navigation
Conference papers

Scalable Privacy-Preserving Data Mining with Asynchronously Partitioned Datasets

Abstract : In the Naïve Bayes classification problem using a vertically partitioned dataset, the conventional scheme to preserve privacy of each partition uses a secure scalar product and is based on the assumption that the data is synchronised amongst common unique identities. In this paper, we attempt to discard this assumption in order to develop a more efficient and secure scheme to perform classification with minimal disclosure of private data. Our proposed scheme is based on the work by Vaidya and Clifton[1], which uses commutative encryption to perform secure set intersection so that the parties with access to the individual partitions have no knowledge of the intersection. The evaluations presented in this paper are based on experimental results, which show that our proposed protocol scales well with large sparse datasets.
Document type :
Conference papers
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Monday, July 24, 2017 - 10:40:16 AM
Last modification on : Monday, December 3, 2018 - 3:44:13 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Hiroaki Kikuchi, Daisuke Kagawa, Anirban Basu, Kazuhiko Ishii, Masayuki Terada, et al.. Scalable Privacy-Preserving Data Mining with Asynchronously Partitioned Datasets. 26th International Information Security Conference (SEC), Jun 2011, Lucerne, Switzerland. pp.223-234, ⟨10.1007/978-3-642-21424-0_18⟩. ⟨hal-01567594⟩



Record views


Files downloads