Skip to main content

2016 | OriginalPaper | Buchkapitel

3. Data Publishing: Trading Off Privacy with Utility Through the k-Jump Strategy

verfasst von : Wen Ming Liu, Lingyu Wang

Erschienen in: Preserving Privacy Against Side-Channel Leaks

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this chapter, we study the side channel leak of sensitive micro-data in which adversaries combine the published data with their knowledge about the generalization algorithms used to produce such data, in order to refine their mental image about the sensitive data. Today, data owners are usually expected to disclose micro-data for research, analysis, and various other purposes. In disclosing micro-data with sensitive attributes, the goal is usually twofold. First, the data utility of disclosed data should be preserved to a certain level for analysis purposes. Second, the private information contained in such data must be sufficiently hidden. Typically, a disclosure algorithm would first sort potential generalization functions into a predetermined order (e.g., with decreasing utility), and then discloses data using the first generalization function that satisfies the desired privacy property. Knowledge about how such disclosure algorithms work can usually render the algorithm unsafe, because adversaries may refine their guesses of the sensitive data by “simulating” the algorithms and comparing with the disclosed data. In this chapter, we show that an existing unsafe algorithm can be transformed into a large family of safe algorithms, namely, k-jump algorithms. We then prove that the data utility of different k-jump algorithms is generally incomparable, which is independent of utility measures and privacy models. Finally, we analyze the computational complexity of k-jump algorithms, and confirm the necessity of safe algorithms even when a secret choice is made among algorithms.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat B. C. M. Fung, K. Wang, R. Chen, and P. S. Yu. Privacy-preserving data publishing: A survey of recent developments. ACM Computing Surveys, 42(4):14:1–14:53, June 2010. B. C. M. Fung, K. Wang, R. Chen, and P. S. Yu. Privacy-preserving data publishing: A survey of recent developments. ACM Computing Surveys, 42(4):14:1–14:53, June 2010.
2.
Zurück zum Zitat X. Jin, N. Zhang, and G. Das. Asap: Eliminating algorithm-based disclosure in privacy-preserving data publishing. Inf. Syst., 36:859–880, July 2011. X. Jin, N. Zhang, and G. Das. Asap: Eliminating algorithm-based disclosure in privacy-preserving data publishing. Inf. Syst., 36:859–880, July 2011.
3.
Zurück zum Zitat K. LeFevre, D. DeWitt, and R. Ramakrishnan. Incognito: Efficient fulldomain k-anonymity. In SIGMOD, pages 49–60, 2005. K. LeFevre, D. DeWitt, and R. Ramakrishnan. Incognito: Efficient fulldomain k-anonymity. In SIGMOD, pages 49–60, 2005.
4.
Zurück zum Zitat W. M. Liu, L. Wang, L. Zhang, and S. Zhu. k-jump: a strategy to design publicly-known algorithms for privacy preserving micro-data disclosure. Journal of Computer Security, 23(2):131–165, 2015. W. M. Liu, L. Wang, L. Zhang, and S. Zhu. k-jump: a strategy to design publicly-known algorithms for privacy preserving micro-data disclosure. Journal of Computer Security, 23(2):131–165, 2015.
5.
Zurück zum Zitat A. Machanavajjhala, D. Kifer, J. Gehrke, and M. Venkitasubramaniam. L-diversity: Privacy beyond k-anonymity. ACM Trans. Knowl. Discov. Data, 1(1):3, 2007. A. Machanavajjhala, D. Kifer, J. Gehrke, and M. Venkitasubramaniam. L-diversity: Privacy beyond k-anonymity. ACM Trans. Knowl. Discov. Data, 1(1):3, 2007.
6.
Zurück zum Zitat P. Samarati. Protecting respondents’ identities in microdata release. IEEE Trans. on Knowl. and Data Eng., 13(6):1010–1027, 2001.CrossRef P. Samarati. Protecting respondents’ identities in microdata release. IEEE Trans. on Knowl. and Data Eng., 13(6):1010–1027, 2001.CrossRef
7.
Zurück zum Zitat L. Sweeney. k-anonymity: a model for protecting privacy. International Journal on Uncertainty, Fuzziness and Knowledge-based Systems, 10(5):557–570, 2002. L. Sweeney. k-anonymity: a model for protecting privacy. International Journal on Uncertainty, Fuzziness and Knowledge-based Systems, 10(5):557–570, 2002.
8.
Zurück zum Zitat R.C. Wong, A.W. Fu, K. Wang, and J. Pei. Minimality attack in privacy preserving data publishing. In VLDB, pages 543–554, 2007. R.C. Wong, A.W. Fu, K. Wang, and J. Pei. Minimality attack in privacy preserving data publishing. In VLDB, pages 543–554, 2007.
9.
Zurück zum Zitat X. Xiao, Y. Tao, and N. Koudas. Transparent anonymization: Thwarting adversaries who know the algorithm. ACM Trans. Database Syst., 35(2):1–48, 2010.CrossRef X. Xiao, Y. Tao, and N. Koudas. Transparent anonymization: Thwarting adversaries who know the algorithm. ACM Trans. Database Syst., 35(2):1–48, 2010.CrossRef
10.
Zurück zum Zitat L. Zhang, S. Jajodia, and A. Brodsky. Information disclosure under realistic assumptions: privacy versus optimality. In CCS, pages 573–583, 2007. L. Zhang, S. Jajodia, and A. Brodsky. Information disclosure under realistic assumptions: privacy versus optimality. In CCS, pages 573–583, 2007.
Metadaten
Titel
Data Publishing: Trading Off Privacy with Utility Through the k-Jump Strategy
verfasst von
Wen Ming Liu
Lingyu Wang
Copyright-Jahr
2016
DOI
https://doi.org/10.1007/978-3-319-42644-0_3