Name
Abstract | ||
|---|---|---|
Commercial organizations and government agencies that gather, store, share and disseminate data are facing increasing concerns over individual privacy and confidentiality. Confidential data is often masked in the database or prior to release to a third party, through methods such as data perturbation. In this study, re-identification risks of three major additive data perturbation techniques were compared using two different record linkage techniques. The results suggest that re-identification risk of Kim's multivariate noise addition method is similar to that of simple noise addition method. The general additive perturbation method (GADP) has the lowest re-identification risk and therefore provides the highest level of protection. The study also suggests that Fuller's method of assessing re-identification risk may be better suited than the probabilistic record-linkage method of Winkler, for numeric data. The results of this study should be help organizations and government agencies choose an appropriate additive perturbation technique. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.4018/jdm.2014040103 | Journal of Database Management |
Keywords | Field | DocType |
database security,re-identification risk,data confidentiality,record-linkage,data perturbation | Record linkage,Data mining,Confidentiality,Computer science,Multivariate statistics,Database security,Dissemination,Probabilistic logic,Perturbation (astronomy),Government | Journal |
Volume | Issue | ISSN |
25 | 2 | 1063-8016 |
Citations | PageRank | References |
1 | 0.37 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Han Li | 1 | 235 | 10.29 |
| Krishnamurty Muralidhar | 2 | 236 | 28.06 |
| Rathindra Sarathy | 3 | 493 | 35.29 |
| Xin (Robert) Luo | 4 | 413 | 28.53 |