A Scalable and Efficient Privacy Preserving Global Itemset Support Approximation Using Bloom Filters - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

A Scalable and Efficient Privacy Preserving Global Itemset Support Approximation Using Bloom Filters

Vikas G. Ashok
  • Fonction : Auteur
  • PersonId : 978095
Ravi Mukkamala
  • Fonction : Auteur
  • PersonId : 978096

Résumé

Several secure distributed data mining methods have been proposed in the literature that are based on privacy preserving set operation mechanisms. However, they are limited in the scalability of both the size and the number of data owners (sources). Most of these techniques are primarily designed to work with two data owners and extensions to handle multiple owners are either expensive or infeasible. In addition, for large datasets, they incur substantial communication/computation overhead due to the use of cryptographic techniques. In this paper, we propose a scalable privacy-preserving protocol that approximates global itemset support, without employing any cryptographic mechanism. We also present some emperical results to demonstrate the effectiveness of our approach.
Fichier principal
Vignette du fichier
978-3-662-43936-4_26_Chapter.pdf (4 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01284874 , version 1 (08-03-2016)

Licence

Paternité

Identifiants

Citer

Vikas G. Ashok, Ravi Mukkamala. A Scalable and Efficient Privacy Preserving Global Itemset Support Approximation Using Bloom Filters. 28th IFIP Annual Conference on Data and Applications Security and Privacy (DBSec), Jul 2014, Vienna, Austria. pp.382-389, ⟨10.1007/978-3-662-43936-4_26⟩. ⟨hal-01284874⟩
297 Consultations
223 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More