Towards value disclosure analysis in modeling general databases

ABSTRACT

The issue of confidentiality and privacy in general databases has become increasingly prominent in recent years. A key element in preserving privacy and confidentiality of sensitive data is the ability to evaluate the extent of all potential disclosure for such data. This is one major challenge for all existing perturbation or transformation based approaches as they conduct disclosure analysis on the perturbed or transformed data, which is too large, considering many organizational databases typically contain a huge amount of data with a large number of categorical and numerical attributes. Instead of conducting disclosure analysis on perturbed or transformed data, our approach is to build an approximate statistical model first and analyze various potential disclosure in terms of parameters of the model built. As the model learned is the only means to generate data for release, all confidential information which snoopers can derive is contained in those parameters.

REFERENCES

• 1: Nabil R. Adam , John C. Worthmann, Security-control methods for statistical databases: a comparative study, ACM Computing Surveys (CSUR), v.21 n.4, p.515-556, Dec. 1989 [doi>10.1145/76894.76895]
• 2: Rakesh Agrawal , Ramakrishnan Srikant, Privacy-preserving data mining, Proceedings of the 2000 ACM SIGMOD international conference on Management of data, p.439-450, May 15-18, 2000, Dallas, Texas, United States
• 3: M. Grotschel, L. Lovasz, and A. Schrijver. Geometric algorithms and combinatorial optimization. Springer, New York, 1988.
• 4: Songtao Guo , Xintao Wu, On the use of spectral filtering for privacy preserving data mining, Proceedings of the 2006 ACM symposium on Applied computing, April 23-27, 2006, Dijon, France [doi>10.1145/1141277.1141418]
• 5: D. Henrion , S. Tarbouriech , D. Arzelier, LMI approximation for the Radius of the intersection of ellipsoids: survey, Journal of Optimization Theory and Applications, v.108 n.1, p.1-28, Jan. 2001 [doi>10.1023/A:1026454804250]
• 6: R. A. Johnson , D. W. Wichern, Applied multivariate statistical analysis, Prentice-Hall, Inc., Upper Saddle River, NJ, 1988
• 7: Hillol Kargupta , Souptik Datta , Qi Wang , Krishnamoorthy Sivakumar, On the Privacy Preserving Properties of Random Data Perturbation Techniques, Proceedings of the Third IEEE International Conference on Data Mining, p.99, November 19-22, 2003
• 8: Michael A. Palley , Jeffrey S. Simonoff, The use of regression methodology for the compromise of confidential information in statistical databases, ACM Transactions on Database Systems (TODS), v.12 n.4, p.593-608, Dec. 1987 [doi>10.1145/32204.42174]
• 9: Rathindra Sarathy , Krishnamurty Muralidhar, The Security of Confidential Numerical Data in Databases, Information Systems Research, v.13 n.4, p.389-403, December 2002 [doi>10.1287/isre.13.4.389.74]
• 10: X. Wu, Y. Wang, and Y. Zheng. Statistical database modeling for privacy preserving database generation. In Proc. of the 15th International Symposium on Methodologies for Intelligent Systems, pages 382--390, May 2005.

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.1 Logical Design

Additional Classification:
  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.7 Database Administration
          Subjects: Security, integrity, and protection

General Terms:
Design, Management, Security

Keywords:
disclosure analysis, general location model, privacy