Why swap when you can shuffle? A comparison of the proximity swap and data shuffle for numeric data

被引：6

作者：

Muralidhar, Krish ^{[1
]}

Sarathy, Rathindra ^{[2
]}

Dandekar, Ramesh ^{[3
]}

机构：

[1] Univ Kentucky, Lexington, KY 40506 USA

[2] Oklahoma State Univ, Stillwater, OK 74078 USA

[3] Energy Informat Adm, Dept Energy, Washington, DC USA

来源：

PRIVACY IN STATISTICAL DATABASES, PROCEEDINGS | 2006年 / 4302卷

关键词：

confidentiality; data masking; privacy; shuffling; swapping;

D O I：

10.1007/11930242_15

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The rank based proximity swap has been suggested as a data masking mechanism for numerical data. Recently, more sophisticated procedures for masking numerical data that are based on the concept of "shuffling" the data have been proposed. In this study, we compare and contrast the performance of the swapping and shuffling procedures. The results indicate that the shuffling procedures perform better than data swapping both in terms of data utility and disclosure risk.

引用

页码：164 / +

页数：3

共 18 条

[1] Information preserving statistical obfuscation [J].