%0 Conference Proceedings
%T A Scalable and Efficient Privacy Preserving Global Itemset Support Approximation Using Bloom Filters
%+ State University of New York (SUNY)
%+ Old Dominion University [Norfolk] (ODU)
%A Ashok, Vikas, G.
%A Mukkamala, Ravi
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 28th IFIP Annual Conference on Data and Applications Security and Privacy (DBSec)
%C Vienna, Austria
%Y David Hutchison
%Y Takeo Kanade
%Y Bernhard Steffen
%Y Demetri Terzopoulos
%Y Doug Tygar
%Y Gerhard Weikum
%Y Vijay Atluri
%Y Günther Pernul
%Y Josef Kittler
%Y Jon M. Kleinberg
%Y Alfred Kobsa
%Y Friedemann Mattern
%Y John C. Mitchell
%Y Moni Naor
%Y Oscar Nierstrasz
%Y C. Pandu Rangan
%I Springer
%3 Data and Applications Security and Privacy XXVIII
%V LNCS-8566
%P 382-389
%8 2014-07-14
%D 2014
%R 10.1007/978-3-662-43936-4_26
%K Privacy Preserving Set Union Protocol
%K Privacy Preserving Data Mining
%K Secure Multiparty Computation
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 11
%Z WG 11.3
%2 https://inria.hal.science/hal-01284874/document
%2 https://inria.hal.science/hal-01284874/file/978-3-662-43936-4_26_Chapter.pdf
%L hal-01284874
%U https://inria.hal.science/hal-01284874
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC11
%~ IFIP-LNCS-8566
%~ IFIP-WG11-3