An efficient privacy-preservation algorithm for incremental data publishing Online publication date: Tue, 05-Dec-2023
by Torsak Soontornphand; Mizuho Iwaihara; Juggapong Natwichai
International Journal of Grid and Utility Computing (IJGUC), Vol. 14, No. 6, 2023
Abstract: Data can be continuously collected and grown all the time. Privacy protection designed for static data might not be able to cope with this situation effectively. In this paper, we present an efficient privacy preservation approach based on (k, l)-anonymity for incremental data publishing. We first illustrate the three privacy attacks, i.e., similarity, difference and joint attacks. Then, the three characteristics of incremental data publishing are analysed and exploited to efficiently detect privacy violations. With the studied characteristics, the similarity and join attack detection can be skipped for stable releases. In addition, only a subtype of the similarity attack and the latest previously released data set need to be detected. From experimental results, the proposed method is highly efficient, with an average execution time eleven times less than a compared static algorithm. In addition, the proposed method can also maintain better data quality than the compared methods at every setting.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Grid and Utility Computing (IJGUC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook