• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

Computer Engineering & Science

Previous Articles     Next Articles

A dynamic update algorithm on (p,k) anonymity

JIA Junjie,YAN Guolei,XING Licheng,CHEN Fei   

  1. (School of Computer Science and Engineering,Northwest Normal University,Lanzhou 730070,China)
  • Received:2016-11-18 Revised:2017-04-26 Online:2018-07-25 Published:2018-07-25

Abstract:

With the arrival of the era of big data, the number of data increases exponentially, onetime release of all data can no longer meet the needs of realtime data, so an incremental update algorithm on (p, k) anonymity is proposed to dynamically update anonymous publication data tables.In order to avoid privacy leakage when data is dynamically updated, the algorithm uses encryption technology to protect sensitive attributes. We create a temporary table and an interim table to aid the timely insertion of updated data. The incremental update algorithm on (p, k) anonymity improves the problem that traditional algorithms cannot update data in real time, ensures the realtime performance of data, and uses encryption technology to enhance data privacy protection. Experimental results show that the incremental update algorithm on (p, k) anonymity achieves the goal of realtime data update with less information loss and faster update rate.

 

Key words: (p, k) anonymity, dynamic update, privacy protection, sensitive attribute encryption