GSSK: A Generalization Step Safe Algorithm in Anonymizing Data

It is necessary to reduce the steps of generalization in order to minimize information loss in privacy preserving data publishing, but sometimes the anonymous table on basis of the method could still be attacked. To solve the problem, the condition of attack is analyzed, and a m-threshold model is p...

Full description

Saved in:
Bibliographic Details
Published in2010 International Conference on Communications and Mobile Computing Vol. 1; pp. 183 - 187
Main Authors Pin Lv, Yu Wen-bing, Chen Nian-sheng
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.04.2010
Subjects
Computer science
Data privacy
Educational institutions
Generalization
Intelligent robots
k-anonymity
Laboratories
Mobile communication
Mobile computing
Protection
Publishing
Online AccessGet full text
ISBN9781424463275
1424463270
DOI10.1109/CMC.2010.191

Cover

More Information
Summary:It is necessary to reduce the steps of generalization in order to minimize information loss in privacy preserving data publishing, but sometimes the anonymous table on basis of the method could still be attacked. To solve the problem, the condition of attack is analyzed, and a m-threshold model is presented to decide whether the value of quasi-identifier attribute would be continuously generalized, making use of algorithm of SSGK dealing with the model. Computer experiments show that the GSSK algorithm can prevent the attack with little information loss.
ISBN:9781424463275
1424463270
DOI:10.1109/CMC.2010.191