Data Shuffling—A New Masking Approach for Numerical Data

This study discusses a new procedure for masking confidential numerical data—a procedure called data shuffling—in which the values of the confidential variables are “shuffled” among observations. The shuffled data provides a high level of data utility and minimizes the risk of disclosure. From a practical perspective, data shuffling overcomes reservations about using perturbed or modified confidential data because it retains all the desirable properties of perturbation methods and performs better than other masking techniques in both data utility and disclosure risk. In addition, data shuffling can be implemented using only rank-order data, and thus provides a nonparametric method for masking. We illustrate the applicability of data shuffling for small and large data sets.

• 저널Management Science · 52(5) · 658–670
• 토픽Data Quality and Management · Management Science and Operations Research
• DOI10.1287/mnsc.1050.0503
• 저자Krishnamurty Muralidhar, Rathindra Sarathy