Incremental processing and indexing for (k, e)-anonymisation

Natwichai, Juggapong, Li, Xue and Kawtrkul, Asanee (2013) Incremental processing and indexing for (k, e)-anonymisation. International Journal of Information and Computer Security, 5 3: 151-170. doi:10.1504/IJICS.2013.055836

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads

Author Natwichai, Juggapong
Li, Xue
Kawtrkul, Asanee
Title Incremental processing and indexing for (k, e)-anonymisation
Journal name International Journal of Information and Computer Security   Check publisher's open access policy
ISSN 1744-1765
Publication date 2013
Sub-type Article (original research)
DOI 10.1504/IJICS.2013.055836
Open Access Status
Volume 5
Issue 3
Start page 151
End page 170
Total pages 20
Place of publication Bucks, United Kingdom
Publisher Inderscience Publishers
Collection year 2014
Language eng
Subject 1705 Computer Networks and Communications
1712 Software
2213 Safety, Risk, Reliability and Quality
1708 Hardware and Architecture
Abstract The emerging of the internet-based services poses a privacy threat to the individuals. Data transformation to meet a privacy standard becomes a requirement for typical data processing for the services. (k, e)-anonymisation is one of the most promising data transformation approaches, since it can provide high-accuracy aggregate query results. Though, the computational cost of the algorithm providing optimal solutions for such approach is not very high, i.e., O(n2). In certain environments, the data to be processed can be appended at any time. In this paper, we address an efficiency issue of the incremental privacy preservation using (k, e)-anonymisation approach. The impact of the increment is observed theoretically. We propose an incremental algorithm based on such observation. The algorithm can replace the quadratic-complexity processing by a linear function on some part of the dataset, while the optimal results are guaranteed. Additionally, a few indexes are proposed to further improve the efficiency of the proposed algorithm. The experiments have been conducted to validate our work. From the results, it can be seen that the proposed work is highly efficient comparing with the non-incremental algorithm and an approximation algorithm.
Keyword Anonymisation
Incremental processing
Q-Index Code CX
Q-Index Status Confirmed Code
Institutional Status UQ

Document type: Journal Article
Sub-type: Article (original research)
Collections: Non HERDC
School of Information Technology and Electrical Engineering Publications
Version Filter Type
Citation counts: Scopus Citation Count Cited 1 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Thu, 28 Nov 2013, 18:49:11 EST by System User on behalf of School of Information Technol and Elec Engineering