Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.5555/1325851.1325939dlproceedingsArticle/Chapter ViewAbstractPublication PagesvldbConference Proceedingsconference-collections
research-article

Privacy skyline: privacy with multidimensional adversarial knowledge

Published: 23 September 2007 Publication History

Abstract

Privacy is an important issue in data publishing. Many organizations distribute non-aggregate personal data for research, and they must take steps to ensure that an adversary cannot predict sensitive information pertaining to individuals with high confidence. This problem is further complicated by the fact that, in addition to the published data, the adversary may also have access to other resources (e.g., public records and social networks relating individuals), which we call external knowledge. A robust privacy criterion should take this external knowledge into consideration.
In this paper, we first describe a general framework for reasoning about privacy in the presence of external knowledge. Within this framework, we propose a novel multidimensional approach to quantifying an adversary's external knowledge. This approach allows the publishing organization to investigate privacy threats and enforce privacy requirements in the presence of various types and amounts of external knowledge. Our main technical contributions include a multidimensional privacy criterion that is more intuitive and flexible than previous approaches to modeling background knowledge. In addition, we provide algorithms for measuring disclosure and sanitizing data that improve computational efficiency several orders of magnitude over the best known techniques.

References

[1]
Agrawal, R., Ghosh, S., Imielinski, T., and Swami, A. Database mining: A performance perspective. TKDE, 1993.
[2]
Bacchus, F., Grove, A. J., Halpern, J., and Koller, D. From statistical knowledge bases to degrees of belief. A.I., 87(1--2), 1996.
[3]
Chen, B.-C., LeFevre, K., Ramakrishnan, R. Privacy skyline. Technical Report 1596, Computer Sciences, UW -- Madison, 2007.
[4]
Dalvi, N., Miklau, G., and Suciu, D. Asymptotic conditional probabilities for conjunctive query. ICDT, 2005.
[5]
Deutsch, A., Papakonstantinou, Y. Privacy in database publishing. ICDT, 2005.
[6]
Kifer, D., and Gehrke, J. Injecting utility into anonymized datasets. SIGMOD, 2006.
[7]
LeFevre, K., DeWitt, D., Ramakrishnan, R. Incognito: Efficient full-domain k-anonymity. SIGMOD, 2005.
[8]
LeFevre, K., DeWitt, D., Ramakrishnan, R. Mondrian: Multidimensional k-anonymity. ICDE, 2006.
[9]
LeFevre, K., DeWitt, D., Ramakrishnan, R. Workload-aware anonymization. SIGKDD, 2006.
[10]
LeFevre, K., DeWitt, D. Scalable anonymization algorithms for large data sets. University of Wisconsin Technical Report 1590, 2007.
[11]
Li, N, Li, T., Venkatasubramanian, S. t-Closeness: Privacy beyond k-anonymity and l-diversity. ICDE, 2007.
[12]
Machanavajjhala, A., Gehrke, J., Kifer, D., Venkitasubramaniam, M. l-diversity: Privacy beyond k-anonymity. ICDE, 2006.
[13]
Machanavajjhala, A., and Gehrke, J. On the efficiency of checking perfect privacy. PODS, 2006.
[14]
Martin, D., Kifer, D., Machanavajjhala, A., Gehrke, J., Halpern J. Worst-case background knowledge in privacy. ICDE, 2007.
[15]
Miklau, G., and Suciu, D. A formal analysis of information disclosure in data exchange. SIGMOD, 2004.
[16]
Sweeney, L. K-anonymity: A model for protecting privacy. Int. J. on Uncertainty, Fuzziness and Knowledge-based Systems, 2002.
[17]
Xiao, X., and Tao, Y. Anatomy: Simple and effective privacy preservation. VLDB, 2006.
[18]
Xiao, X., and Tao, Y. Personalized privacy preservation. SIGMOD, 2006.
[19]
Yao, C., Wang, X. S., Jajodia, S. Checking for k-anonymity violation by views. VLDB, 2005.

Cited By

View all
  • (2018)NRFProceedings of the 2018 Workshop on Privacy in the Electronic Society10.1145/3267323.3268948(121-132)Online publication date: 15-Oct-2018
  • (2017)Fast Algorithms for Pareto Optimal Group-based SkylineProceedings of the 2017 ACM on Conference on Information and Knowledge Management10.1145/3132847.3132950(417-426)Online publication date: 6-Nov-2017
  • (2016)K-AMOAProceedings of the Second International Conference on Information and Communication Technology for Competitive Strategies10.1145/2905055.2905142(1-6)Online publication date: 4-Mar-2016
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image DL Hosted proceedings
VLDB '07: Proceedings of the 33rd international conference on Very large data bases
September 2007
1443 pages
ISBN:9781595936493

Sponsors

  • Yahoo! Research
  • Google Inc.
  • SAP
  • Intel: Intel
  • Microsoft Research: Microsoft Research
  • ORACLE: ORACLE
  • Connex.cc
  • HP invent
  • WKO
  • IBM: IBM

Publisher

VLDB Endowment

Publication History

Published: 23 September 2007

Qualifiers

  • Research-article

Funding Sources

Conference

VLDB '07
Sponsor:
  • Intel
  • Microsoft Research
  • ORACLE
  • IBM

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 25 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2018)NRFProceedings of the 2018 Workshop on Privacy in the Electronic Society10.1145/3267323.3268948(121-132)Online publication date: 15-Oct-2018
  • (2017)Fast Algorithms for Pareto Optimal Group-based SkylineProceedings of the 2017 ACM on Conference on Information and Knowledge Management10.1145/3132847.3132950(417-426)Online publication date: 6-Nov-2017
  • (2016)K-AMOAProceedings of the Second International Conference on Information and Communication Technology for Competitive Strategies10.1145/2905055.2905142(1-6)Online publication date: 4-Mar-2016
  • (2013)I/O-efficient planar range skyline and attrition priority queuesProceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems10.1145/2463664.2465225(103-114)Online publication date: 22-Jun-2013
  • (2012)A Knowledge Model Sharing Based Approach to Privacy-Preserving Data MiningTransactions on Data Privacy10.5555/2423651.24236545:2(433-467)Online publication date: 1-Aug-2012
  • (2012)An information theoretic privacy and utility measure for data sanitization mechanismsProceedings of the second ACM conference on Data and Application Security and Privacy10.1145/2133601.2133637(283-294)Online publication date: 7-Feb-2012
  • (2011)Protecting privacy in data releaseFoundations of security analysis and design VI10.5555/2028200.2028202(1-34)Online publication date: 1-Jan-2011
  • (2011)Cloning for privacy protection in multiple independent data publicationsProceedings of the 20th ACM international conference on Information and knowledge management10.1145/2063576.2063705(885-894)Online publication date: 24-Oct-2011
  • (2011)Asymptotically efficient algorithms for skyline probabilities of uncertain dataACM Transactions on Database Systems10.1145/1966385.196639036:2(1-28)Online publication date: 2-Jun-2011
  • (2011)Instant anonymizationACM Transactions on Database Systems10.1145/1929934.192993636:1(1-33)Online publication date: 18-Mar-2011
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media