Advertisement
Published in:
2006 | OriginalPaper | Chapter
Why Swap When You Can Shuffle? A Comparison of the Proximity Swap and Data Shuffle for Numeric Data
Authors : Krish Muralidhar, Rathindra Sarathy, Ramesh Dandekar
Published in: Privacy in Statistical Databases
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.