This paper presents an approach to privacy-preserving data mining that relies upon a relatively simple secret sharing scheme. Its main feature is that users, sensitive data owners, are engaged in the secret sharing operations that protect their privacy. They are grouped in independent clouds connected to a central unit, the data miner, that only manages the aggregated data of each cloud, therefore avoiding the disclosure of information belonging to single nodes. We propose two privacy preserving schemes, with different privacy levels and communication costs. When designing them, we assume that some users' data might become inaccessible during the operation of the privacy preserving protocols, due to intermittent network connectivity or sudden user departures, and therefore introduce a new performance metric, the failure probability, defined as the probability that the mining output cannot guarantee the desired level of accuracy. We then discuss the attractive tradeoffs between privacy, accuracy and communication overhead that each scheme exhibits.

Merani, M., Barcellona, C., Tinnirello, I. (2015). Multi-cloud privacy preserving schemes for linear data mining. In 2015 IEEE International Conference on Communications (ICC) (pp.7095-7101). Institute of Electrical and Electronics Engineers Inc. [10.1109/ICC.2015.7249458].

Multi-cloud privacy preserving schemes for linear data mining

BARCELLONA, Cettina;TINNIRELLO, Ilenia
2015-01-01

Abstract

This paper presents an approach to privacy-preserving data mining that relies upon a relatively simple secret sharing scheme. Its main feature is that users, sensitive data owners, are engaged in the secret sharing operations that protect their privacy. They are grouped in independent clouds connected to a central unit, the data miner, that only manages the aggregated data of each cloud, therefore avoiding the disclosure of information belonging to single nodes. We propose two privacy preserving schemes, with different privacy levels and communication costs. When designing them, we assume that some users' data might become inaccessible during the operation of the privacy preserving protocols, due to intermittent network connectivity or sudden user departures, and therefore introduce a new performance metric, the failure probability, defined as the probability that the mining output cannot guarantee the desired level of accuracy. We then discuss the attractive tradeoffs between privacy, accuracy and communication overhead that each scheme exhibits.
giu-2015
IEEE International Conference on Communications, ICC 2015
London; United Kingdom
8 - 12 June 2015
2015
7
Online
https://ieeexplore.ieee.org/document/7249458
Merani, M., Barcellona, C., Tinnirello, I. (2015). Multi-cloud privacy preserving schemes for linear data mining. In 2015 IEEE International Conference on Communications (ICC) (pp.7095-7101). Institute of Electrical and Electronics Engineers Inc. [10.1109/ICC.2015.7249458].
Proceedings (atti dei congressi)
Merani, M.; Barcellona, C.; Tinnirello, I.
File in questo prodotto:
File Dimensione Formato  
07249458.pdf

Solo gestori archvio

Dimensione 368.8 kB
Formato Adobe PDF
368.8 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10447/223755
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 4
  • ???jsp.display-item.citation.isi??? 2
social impact