Trading Privacy for Information Loss in the Blink of an Eye

  • Alexandra Pilalidou
  • Panos Vassiliadis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7338)

Abstract

The publishing of data with privacy guarantees is a task typically performed by a data curator who is expected to provide guarantees for the data he publishes in quantitative fashion, via a privacy criterion (e.g., k-anonymity, l-diversity). The anonymization of data is typically performed off-line. In this paper, we provide algorithmic tools that facilitate the negotiation for the anonymization scheme of a data set in user time. Our method takes as input a set of user constraints for (i) suppression, (ii) generalization and (iii) a privacy criterion (k-anonymity, l-diversity) and returns (a) either an anonymization scheme that fulfils these constraints or, (b) three approximations to the user request based on the idea of keeping the two of the three values of the user input fixed and finding the closest possible approximation for the third parameter. The proposed algorithm involves precomputing suitable histograms for all the different anonymization schemes that a global recoding method can follow. This allows computing exact answers extremely fast (in the order of few milliseconds).

Keywords

User Request Exact Answer Generalization Level Generalization Scheme Very Large Data Base 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Samarati, P.: Protecting respondents’ identities in microdata release. IEEE Trans. Knowl. Data Eng. 13(6), 1010–1027 (2001)CrossRefGoogle Scholar
  2. 2.
    LeFevre, K., DeWitt, D.J., Ramakrishnan, R.: Incognito: Efficient full-domain k-anonymity. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Baltimore, Maryland, USA, June 14-16, pp. 49–60 (2005)Google Scholar
  3. 3.
    Fung, B.C.M., Wang, K., Chen, R., Yu, P.S.: Privacy-preserving data publishing: A survey of recent developments. ACM Comput. Surv. 42(4) (2010)Google Scholar
  4. 4.
    Park, H., Shim, K.: Approximate algorithms for k-anonymity. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Beijing, China, June 12-14, pp. 67–78 (2007)Google Scholar
  5. 5.
    Aggarwal, C.C.: On k-anonymity and the curse of dimensionality. In: Proceedings of the 31st International Conference on Very Large Data Bases (VLDB), Trondheim, Norway, August 30-September 2, pp. 901–909 (2005)Google Scholar
  6. 6.
    U.C. Irvine Repository of Machine Learning Databases: Adult data set (1998), http://www.ics.uci.edu/~mlearn
  7. 7.
    Pilalidou, A.: On-line negotiation for privacy preserving data publishing. MSc Thesis. MT 2010-15, Dept. of Computer Science, Univ. of Ioannina (2010), http://www.cs.uoi.gr/~pvassil/publications/2012_SSDBM/

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Alexandra Pilalidou
    • 1
  • Panos Vassiliadis
    • 2
  1. 1.FMT WorldwideLimassolCyprus
  2. 2.Dept. of Computer ScienceUniv. of IoanninaHellas

Personalised recommendations