K-VARP: K-anonymity for varied data streams via partitioning

Abstract

The Internet-of-Things (IoT) produces and transmits enormous amounts of data. Extracting valuable information from this enormous volume of data has become an important consideration for businesses and research. However, extracting information from this data without providing privacy protection puts individuals at risk. Data has to be sanitized before use, and anonymization provides solution to this problem. Since, IoT is a collection of numerous different devices, data streams from these devices tend to vary over time thus creating varied data streams. However, implementing traditional data stream anonymization approaches only provide privacy protection for data streams that have predefined and fixed attributes. Therefore, conventional methods cannot directly work on varied data streams. In this work, we propose K-VARP (K-anonymity for VARied data stream via Partitioning) to publish varied data streams. K-VARP reads the tuple and assigns them to partitions based on description, and all tuples must be anonymized before expiring. It tries to anonymize expiring tuple within a partition if its partition is eligible to produce a K-anonymous cluster. Otherwise, partition merging is applied. In K-VARP we propose a new merging criterion called R-likeness to measure similarity distance between tuple and partitions. Moreover, flexible re-using and imputation free-publication is implied in K-VARP to achieve better anonymization quality and performance. Our experiments on a real datasets show that K-VARP is efficient and effective compared to existing algorithms. K-VARP demonstrated approximately three to nine and ten to twenty percent less information loss on two real datasets, while forming a similar number of clusters within a comparable computation time.