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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4302, Issue , 2006, Pages 164-176

  Muralidhar, Krish ^a   Sarathy, Rathindra ^b   Dandekar, Ramesh ^c  

^a UNIVERSITY OF KENTUCKY   (United States)

^b OKLAHOMA STATE UNIVERSITY   (United States)

^c Energy Information Administration   (United States)

Author keywords

Confidentiality; Data masking; Privacy; Shuffling; Swapping

Indexed keywords

COMPUTER SCIENCE; COMPUTERS; DATA PRIVACY;

CONFIDENTIALITY; DATA MASKING; DATA SWAPPING; DATA UTILITIES; DISCLOSURE RISK; NUMERICAL DATA; SHUFFLING; SWAPPING;

ARTIFICIAL INTELLIGENCE;

EID: 84958976912     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11930242_15     Document Type: Conference Paper

References (18)

1. Burridge, J. 2003. Information Preserving Statistical Obfuscation, Statistics and Computing, 13 321-327.
2. Carlson, M. and M. Salabasis. 2002. A data swapping technique for generating synthetic samples: A method for disclosure control. Research in Official Statistics. 6 35-64.
3. Dalenius, T. and Reiss, S. P. 1982. Data-swapping: A Technique for Disclosure Control. Journal of Statistical Planning and Inference 6 73-85.
4. Dandekar, R.A., M. Cohen, and N. Kirkendall 2002. Sensitive Microdata Protection Using Latin Hypercube Sampling Technique. In Inference Control in Statistical Databases (J. Domingo-Ferrer, Editor), Springer-Verlag, New York.
5. Domingo-Ferrer, J., and V. Torra. 2001 Disclosure control methods and information loss for microdata, in: P. Doyle, J. Lane, J. Theeuwes, L. Zayatz (Eds.), Confidentiality, Disclosure and Data Access, North-Holland, Amsterdam, 91-110.
6. Fienberg, S.E. and J. McIntyre. 2005. Data swapping: Variations on a theme by Dalenius and Reiss. Journal of Official Statistics, 21 309-323.
7. Fuller, W.A. 1993. Masking procedures for microdata disclosure limitation. Journal of Official Statistics 9 383-406.
8. Iman, R.L. and W.J. Conover. 1982. A distribution free approach to inducing rank correlation among input variables. Communication in Statistics B11 311-334.
9. McKay, M.D., W.J. Conover, and R.J. Beckman. 1979. A comparison of three methods for selecting values of input variables in the analysis of output from a computer code. Technometrics 21 239-245.
10. Moore, R.A. 1996. Controlled data swapping for masking public use microdatasets. U.S. Census Bureau Research Report 96-04.
11. Muralidhar, K. and R. Sarathy, 2002. “Application of the Two-step Data Shuffle to the 1993 AHS Data: A Report on the Feasibility of Applying Data Shuffling for Microdata Release,” research report prepared for the Census Bureau (http://gatton.uky.edu/faculty/muralidhar/maskingpapers/).
12. Muralidhar, K. and R. Sarathy. 2003. A theoretical basis for perturbation methods. Statistics and Computing 13 329-335.
13. Muralidhar, K. and R. Sarathy. 2006. Data Shuffling - A New Masking Approach for Numerical Data. Management Science 52 658-670.
14. Reiss, S.P., M.J. Post, and T. Dalenius. 1982. Non-reversible privacy transformations. Proceedings of the ACM Symposium on Principles of Database Systems, Los Angeles, CA 139-146.
15. Sarathy R., K. Muralidhar, R. Parsa. 2002. Perturbing non-normal confidential variables: The copula approach. Management Science 48 1613-1627.
16. Sarathy, R. and K. Muralidhar. 2002. The Security of Confidential Numerical Data in Databases. Information Systems Research 389-403.
17. Wall Street Journal 2001. Bureau Blurs Data to Keep Names Confidential. February 14 2001. B1-B2.
18. Winkler W. E. 1995. Advanced methods for record linkage. In: Proceedings of the American Statistical Association Section on Survey Research Methods. 467-472.