Castle:: A delay-constrained scheme for ks-anonymizing data streams

被引:17
作者
Cao, Jianneng [1 ]
Carminati, Barbara [2 ]
Ferrari, Elena [2 ]
Tan, Kian Lee
机构
[1] Natl Univ Singapore, Sch Comp, Singapore 117548, Singapore
[2] Univ Insubria, DICOM, I-22100 Varese, Italy
来源
2008 IEEE 24TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, VOLS 1-3 | 2008年
关键词
D O I
10.1109/ICDE.2008.4497561
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Most of existing privacy preserving techniques, such as k-anonymity methods, are designed for static data sets. As such, they cannot be applied to streaming data which are continuous, transient and usually unbounded. Moreover, in streaming applications, there is a need to offer strong guarantees on the maximum allowed delay between an incoming data and its anonymized output. To cope with these requirements, in this paper, we present CASTLE (Continuously Anonymizing STreaming data via adaptive cLustEring), a cluster-based scheme that anonymizes data streams on-the-fly and, at the same time, ensures the freshness of the anonymized data by satisfying specified delay constraints. We further show how CASTLE can be easily extended to handle l-diversity [1]. Our extensive performance study shows that CASTLE is efficient and effective.
引用
收藏
页码:1376 / +
页数:2
相关论文
共 2 条
[1]  
CAO J, 2007, CASTLE DELAY CONSTRA
[2]  
Iyengar VS., 2002, P 8 ACM SIGKDD INT C, P279, DOI DOI 10.1145/775047.775089