Privacy-preserving incremental data dissemination
Author(s) -
Ji-Won Byun,
Tiancheng Li,
Elisa Bertino,
Ninghui Li,
Yonglak Sohn
Publication year - 2009
Publication title -
journal of computer security
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.201
H-Index - 56
eISSN - 1875-8924
pISSN - 0926-227X
DOI - 10.3233/jcs-2009-0316
Subject(s) - computer science , inference , data anonymization , process (computing) , anonymity , key (lock) , data mining , dissemination , k anonymity , information privacy , data science , computer security , artificial intelligence , telecommunications , operating system
Although the k-anonymity and ℓ-diversity models have led to a number of valuable privacy-protecting techniques and algorithms, the existing solutions are currently limited to static data release. That is, it is assumed that a complete dataset is available at the time of data release. This assumption implies a significant shortcoming, as in many applications data collection is rather a continual process. Moreover, the assumption entails “one-time” data dissemination; thus, it does not adequately address today\u27s strong demand for immediate and up-to-date information. In this paper, we consider incremental data dissemination, where a dataset is continuously incremented with new data. The key issue here is that the same data may be anonymized and published multiple times, each of the time in a different form. Thus, static anonymization (i.e., anonymization which does not consider previously released data) may enable various types of inference. In this paper, we identify such inference issues and discuss some prevention methods
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom