Skip to main content

Can Attackers Learn from Samples?

  • Conference paper
Secure Data Management (SDM 2005)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3674))

Included in the following conference series:

Abstract

Sampling is often used to achieve disclosure limitation for categorical and microarray datasets. The motivation is that while the public gets a snapshot of what is in the data, the entire data is not revealed and hence complete disclosure is prevented. However, the presence of prior knowledge is often overlooked in risk assessment. A sample plays an important role in risk analysis and can be used by a malicious user to construct prior knowledge of the domain. In this paper, we focus on formalizing the various kinds of prior knowledge an attacker can develop using samples and make the following contributions. We abstract various types of prior knowledge and define measures of quality which enables us to quantify how good the prior knowledge is with respect to the true knowledge given by the database. We propose a lightweight general purpose sampling framework with which a data owner can assess the impact of various sampling methods on the quality of prior knowledge. Finally, through a systematic set of experiments using real benchmark datasets, we study the effect of various sampling parameters on the quality of prior knowledge that is obtained from these samples. Such an analysis can help the data owner in making informed decisions about releasing samples to achieve disclosure limitation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adam, N.R., Wortmann, J.C.: Security-Control Methods for Statistical Databases: A Comparative Study. ACM Computing Surveys 21(4) (1989)

    Google Scholar 

  2. Aggarwal, C.C., Yu, P.S.: A Condensation Approach to Privacy Preserving Data Mining. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Böhm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol. 2992. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  3. Aggarwal., G., et al.: Anonymizing tables. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol. 3363, pp. 246–258. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Agrawal, R., Srikant, R.: Privacy Preserving Data Mining. In: ACM SIGMOD Conference (2000)

    Google Scholar 

  5. Agrawal, D., Aggarwal, C.C.: On the Design and Quantification of Privacy Preserving Data Mining Algorithms. In: ACM PODS Conference (2001)

    Google Scholar 

  6. Agrawal, R., Imielinksi, T., Swami, A.: Mining Association Rules between Sets of Items in Large Databases. In: ACM SIGMOD Conference (1993)

    Google Scholar 

  7. Clifton, C.: Using Sample Size to Limit Exposure to Data Mining. Journal of Computer Security 8(4) (2000)

    Google Scholar 

  8. Dinur, I., Nissim, K.: Revealing Information while Preserving Privacy. In: ACM PODS Conference (2003)

    Google Scholar 

  9. Evfimievski, A., et al.: Privacy Preserving Mining of Association Rules. Information Systems 29(4) (2004)

    Google Scholar 

  10. Domingo-Ferrer, J., et al.: Information-Theoretic Disclosure Risk Measures in Statistical Disclosure Control of Tabular Data. In: IEEE SSDBM Conference (2002)

    Google Scholar 

  11. Fienberg, S.E., et al.: Disclosure Limitation using perturbation and related methods for Categorical Data. Journal of Office Statistics 14 (1998)

    Google Scholar 

  12. Iyengar, V.S.: Transforming Data to Satisfy Privacy Constraints. In: ACM KDD Conference (2002)

    Google Scholar 

  13. Lindell, Y., Pinkas, B.: Privacy preserving data mining. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, p. 36. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  14. Lakshmanan, L.V.S., Ng, R.T., Ramesh, G.: To Do or Not To Do: The Dilemma of Disclosing Anonymized Data. In: ACM SIGMOD Conference (2005)

    Google Scholar 

  15. Moore Jr., R.A.: Controlled Data-Swapping Techniques for Masking Public Use Microdata Sets. Statistical Research Division Report Series, RR 96-04, US Bureau of Census, Washington D.C (1996)

    Google Scholar 

  16. Meyerson, A., Williams, R.: On the Complexity of Optimal k-Anonymity. In: ACM PODS Conference (2004)

    Google Scholar 

  17. Samarati, P., Sweeney, L.: Protecting Privacy when Disclosing Information: k-anonymity and its Enforcement through Generalization and Suppression. In: IEEE Symposium on Research in Security and Privacy (1998)

    Google Scholar 

  18. Sweeney, L.: k-anonymity: a model for protecting privacy. International Journal on Uncertainty, Fuzziness and Knowledge-based Systems 10(5) (2002)

    Google Scholar 

  19. Verykios, V., et al.: Association Rule Hiding. IEEE TKDE 16(4) (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ramesh, G. (2005). Can Attackers Learn from Samples?. In: Jonker, W., Petković, M. (eds) Secure Data Management. SDM 2005. Lecture Notes in Computer Science, vol 3674. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11552338_8

Download citation

  • DOI: https://doi.org/10.1007/11552338_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28798-8

  • Online ISBN: 978-3-540-31974-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics