tutorial

Privacy-aware data management in information networks

Authors:

Evimaria TerziAuthors Info & Claims

SIGMOD '11: Proceedings of the 2011 ACM SIGMOD International Conference on Management of data

Pages 1201 - 1204

https://doi.org/10.1145/1989323.1989453

Published: 12 June 2011 Publication History

Abstract

The proliferation of information networks, as a means of sharing information, has raised privacy concerns for enterprises who manage such networks and for individual users that participate in such networks. For enterprises, the main challenge is to satisfy two competing goals: releasing network data for useful data analysis and also preserving the identities or sensitive relationships of the individuals participating in the network. Individual users, on the other hand, require personalized methods that increase their awareness of the visibility of their private information.

This tutorial provides a systematic survey of the problems and state-of-the-art methods related to both enterprise and personalized privacy in information networks. The tutorial discusses privacy threats, privacy attacks, and privacy-preserving mechanisms tailored specifically to network data.

Supplementary Material

JPG File (wednesday15-athensview-tutorial4.jpg)

Download
14.73 KB

WMV File (wednesday15-athensview-tutorial4.wmv)

Download
222.31 MB

References

[1]

L. Backstrom, C. Dwork, and J. Kleinberg. Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. In WWW, pages 181--190, Banff, Alberta, Canada, May 2007.

Digital Library

[2]

J. Becker and H. Chen. Measuring privacy risk in online social networks. In Proceedings of Web 2.0 Security and Privacy Workshop (W2SP'09), Oakland, CA, 2009.

[3]

S. Bhagat, G. Cormode, B. Krishnamurthy, and D. Srivastava. Prediction promotes privacy in dynamic social networks. In Workshop on Online Social Networks (WOSN), 2010.

Digital Library

[4]

S. Bhagat, G. Cormode, B. Krishnamurthy, and D. Srivastava. Privacy in dynamic social networks. In WWW, 2010.

Digital Library

[5]

A. Campan and T. M. Truta. A clustering approach for data and structural anonymity in social networks. In PinKDD, 2008.

[6]

J. Cheng, A. W.-C. Fu, and J. Liu. k-isomorphism: Privacy preserving network publication against structural attacks. In SIGMOD, 2010.

Digital Library

[7]

G. Cormode, D. Srivastava, S. Bhagat, and B. Krishnamurthy. Class-based graph anonymization for social network data. In VLDB, 2009.

[8]

G. Cormode, D. Srivastava, T. Yu, and Q. Zhang. Anonymizing bipartite graph data using safe groupings. Proceedings of the VLDB Endowment, 1(1):833--844, 2008.

Digital Library

[9]

C. Dwork. A firm foundation for private data analysis. Communications of the ACM, 54(1):86--95, 2011.

Digital Library

[10]

C. Dwork, F. McSherry, K. Nissim, and A. Smith. Calibrating noise to sensitivity in private data analysis. In Third Theory of Cryptography Conference, 2006.

Digital Library

[11]

L. Fang and K. LeFevre. Privacy wizards for social networking sites. In WWW, Raleigh, NC, April 2010.

Digital Library

[12]

M. Hay, C. Li, G. Miklau, and D. Jensen. Accurate estimation of the degree distribution of private networks. In Proceedings of the 2009 IEEE International Conference on Data Mining (ICDM'09), pages 169--178, Miami, FL, December 2009.

Digital Library

[13]

M. Hay, G. Miklau, and D. Jensen. Privacy-Aware Knowledge Discovery: Novel Applications and New Techniques, chapter Enabling Accurate Analysis of Private Network Data. Chapman & Hall/CRC Press, 2010.

[14]

M. Hay, G. Miklau, D. Jensen, D. Towsley, and C. Li. Resisting structural re-identification in anonymized social networks. VLDB Journal, 2010.

Digital Library

[15]

M. Hay, G. Miklau, D. Jensen, P. Weis, and S. Srivastava. Anonymizing social networks. Technical report, University of Massachusetts Amherst, 2007.

[16]

M. Hay, V. Rastogi, G. Miklau, and D. Suciu. Boosting the accuracy of differentially-private queries through consistency. Proceedings of the VLDB Endowment, 2010.

Digital Library

[17]

D. Kifer and A. Machanavajjhala. No free lunch in data privacy. In SIGMOD, 2011.

Digital Library

[18]

A. Korolova. Privacy violations using microtargeted ads: A case study. In IEEE International Workshop on Privacy Aspects of Data Mining (PADM'2010), pages 474--482, 2010.

Digital Library

[19]

J. Lindamood, R. Heatherly, M. Kantarcioglu, and B. Thuraisingham. Inferring private information using social network data. In WWW, pages 1145--1146, Madrid, Spain, 2009.

Digital Library

[20]

K. Liu and E. Terzi. Towards identity anonymization on graphs. In SIGMOD, pages 93--106, Vancouver, Canada, June 2008.

Digital Library

[21]

K. Liu and E. Terzi. A framework for computing the privacy score of users in online social networks. In Proceedings of the 2009 IEEE International Conference on Data Mining (ICDM'09), pages 288--297, Miami, FL, December 2009.

Digital Library

[22]

L. Liu, J. Wang, J. Liu, and J. Zhang. Privacy preservation in social networks with sensitive edge weights. In Proceedings of 2009 SIAM International Conference on Data Mining (SDM'09), pages 954--965, Sparks, NV, April 2009.

[23]

A. Machanavajjhala, A. Korolova, and A. D. Sarma. Personalized social recommendations - accurate or private? In VLDB, 2011.

Digital Library

[24]

S. Nabar, K. Kenthapadi, N. Mishra, and R. Motwani. A survey of query auditing techniques for data privacy. Privacy-Preserving Data Mining, pages 415--431, 2008.

[25]

A. Narayanan and V. Shmatikov. De-anonymizing social networks. In Proceedings of the 30th IEEE Symposium on Security and Privacy, pages 173--187, Oakland, CA, May 2009.

Digital Library

[26]

K. Nissim, S. Raskhodnikova, and A. Smith. Smooth sensitivity and sampling in private data analysis. In STOC, pages 75--84, New York, NY, USA, 2007. ACM.

Digital Library

[27]

J. Pei and B. Zhou. Preserving privacy in social networks against neighborhood attacks. In Proceedings of the 2008 IEEE 24th International Conference on Data Engineering (ICDE'08), pages 506--515, Cancun, Mexico, April 2008.

Digital Library

[28]

V. Rastogi, M. Hay, G. Miklau, and D. Suciu. Relationship privacy: output perturbation for queries with joins. In Symposium on Principles of Database Systems (PODS), pages 107--116, Providence, RI, June 2009.

Digital Library

[29]

J.-M. Seigneur and C. D. Jensen. Trading privacy for trust. In Trust Management, volume 2995/2004 of Lecture Notes in Computer Science, pages 93--107. Springer, 2004.

[30]

A. C. Squicciarini, M. Shehab, and F. Paci. Collective privacy management in social networks. In WWW, pages 521--530, Madrid, Spain, 2009.

Digital Library

[31]

L. Wu, X. Ying, and X. Wu. Reconstruction from randomized graph via low rank approximation. In Proceedings of 2010 SIAM International Conference on Data Mining (SDM'10), Columbus, OH, April 2010.

[32]

X. Wu, X. Ying, K. Liu, and L. Chen. A survey of algorithms for privacy- preservation of graphs and social networks. In Managing and Mining Graph Data. Kluwer Academic Publishers, 2010.

[33]

X. Ying, K. Pan, X. Wu, and L. Guo. Comparisons of randomization and k-degree anonymization schemes for privacy preserving social network publishing. In Proceedings of the 3rd SIGKDD Workshop on Social Network Mining and Analysis (SNA-KDD'09), 2009.

Digital Library

[34]

X. Ying and X. Wu. Randomizing social networks: a spectrum preserving approach. In Proceedings of 2008 SIAM International Conference on Data Mining (SDM'08), pages 739--750, Atlanta, GA, April 2008.

[35]

X. Ying and X. Wu. On link privacy in randomizing social networks. In PAKDD, 2009.

Digital Library

[36]

E. Zheleva and L. Getoor. Preserving the privacy of sensitive relationships in graph data. In Workshop on Privacy, Security, and Trust in KDD (PinKDD), pages 153--171, 2007.

Digital Library

[37]

E. Zheleva and L. Getoor. To join or not to join: the illusion of privacy in social networks with mixed public and private user profiles. In WWW, pages 531--540, Madrid, Spain, April 2009.

Digital Library

[38]

B. Zhou, J. Pei, and W.-S. Luk. A brief survey on anonymization techniques for privacy preserving publishing of social network data. SIGKDD Explorations, 2008.

Digital Library

[39]

L. Zou, L. Chen, and M. T. Özsu. K-automorphism: A general framework for privacy preserving network publication. Proceedings of the VLDB Endowment, 2(1):946--957, 2009.

Digital Library

Cited By

Fahrenkrog-Petersen Svan der Aa HWeidlich M(2024)Privacy-Aware Analysis based on Data Series2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00406(5365-5370)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00406
Zhang SNi WFu N(2023)Community-Preserving Social Graph Release with Node Differential PrivacyJournal of Computer Science and Technology10.1007/s11390-021-1270-738:6(1369-1386)Online publication date: 1-Dec-2023
https://dl.acm.org/doi/10.1007/s11390-021-1270-7
He XRogers JBater JMachanavajjhala AWang CWang XLi GLi ZIdreos SSrivastava D(2021)Practical Security and Privacy for Database SystemsProceedings of the 2021 International Conference on Management of Data10.1145/3448016.3457544(2839-2845)Online publication date: 9-Jun-2021
https://dl.acm.org/doi/10.1145/3448016.3457544
Show More Cited By

Index Terms

Privacy-aware data management in information networks
1. Security and privacy
  1. Database and storage security
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory
      1. Theory of database privacy and security

Recommendations

IMR based Anonymization for Privacy Preservation in Data Mining
KMO '16: Proceedings of the The 11th International Knowledge Management in Organizations Conference on The changing face of Knowledge Management Impacting Society

Privacy Preserving Data Mining (PPDM) is a data mining research area that aims to protect individual's personal information from unsolicited or unauthorized disclosure. Privacy relates to personal information that a person would not wish others to know ...
A Survey on Privacy Preserving Dynamic Data Publishing

Many organizations, especially small and medium business SMB enterprises require the collection and sharing of data containing personal information. The privacy of this data must be preserved before outsourcing to the commercial public. Privacy ...
Differentially private data publishing via optimal univariate microaggregation and record perturbation
Abstract
We present an approach to generate differentially private data sets that consists in adding noise to a microaggregated version of the original data set. While this idea has already been pursued in the literature to reduce the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMOD '11: Proceedings of the 2011 ACM SIGMOD International Conference on Management of data

June 2011

1364 pages

ISBN:9781450306614

DOI:10.1145/1989323

General Chair:
Timos Sellis
IMIS/RC Athena
,
Program Chair:
Renée J. Miller
University of Toronto
,
Publications Chairs:
Anastasios Kementsietsidis
IBM T.J. Watson Research Center
,
Yannis Velegrakis
University of Trento

Copyright © 2011 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 June 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Tutorial

Conference

SIGMOD/PODS '11

Sponsor:

SIGMOD

SIGMOD/PODS '11: International Conference on Management of Data

June 12 - 16, 2011

Athens, Greece

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

23
Total Citations
View Citations
748
Total Downloads

Downloads (Last 12 months)13
Downloads (Last 6 weeks)2

Reflects downloads up to 06 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Fahrenkrog-Petersen Svan der Aa HWeidlich M(2024)Privacy-Aware Analysis based on Data Series2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00406(5365-5370)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00406
Zhang SNi WFu N(2023)Community-Preserving Social Graph Release with Node Differential PrivacyJournal of Computer Science and Technology10.1007/s11390-021-1270-738:6(1369-1386)Online publication date: 1-Dec-2023
https://dl.acm.org/doi/10.1007/s11390-021-1270-7
He XRogers JBater JMachanavajjhala AWang CWang XLi GLi ZIdreos SSrivastava D(2021)Practical Security and Privacy for Database SystemsProceedings of the 2021 International Conference on Management of Data10.1145/3448016.3457544(2839-2845)Online publication date: 9-Jun-2021
https://dl.acm.org/doi/10.1145/3448016.3457544
Zhang SNi WFu N(2020)Community Preserved Social Graph Publishing with Node Differential Privacy2020 IEEE International Conference on Data Mining (ICDM)10.1109/ICDM50108.2020.00184(1400-1405)Online publication date: Nov-2020
https://doi.org/10.1109/ICDM50108.2020.00184
Wang TZheng ZRehmani MYao SHuo Z(2019)Privacy Preservation in Big Data From the Communication Perspective—A SurveyIEEE Communications Surveys & Tutorials10.1109/COMST.2018.286510721:1(753-778)Online publication date: Sep-2020
https://doi.org/10.1109/COMST.2018.2865107
Waniek MZhou KVorobeychik YMoro EMichalak TRahwan T(2019)How to Hide One’s Relationships from Link Prediction AlgorithmsScientific Reports10.1038/s41598-019-48583-69:1Online publication date: 21-Aug-2019
https://doi.org/10.1038/s41598-019-48583-6
Casas-Roma J(2019)An evaluation of vertex and edge modification techniques for privacy-preserving on graphsJournal of Ambient Intelligence and Humanized Computing10.1007/s12652-019-01363-614:11(15109-15125)Online publication date: 15-Jun-2019
https://doi.org/10.1007/s12652-019-01363-6
Casas-Roma J(2019)DUEF-GA: data utility and privacy evaluation framework for graph anonymizationInternational Journal of Information Security10.1007/s10207-019-00469-4Online publication date: 23-Sep-2019
https://doi.org/10.1007/s10207-019-00469-4
Ros-Martín MSalas JCasas-Roma J(2019)Scalable non-deterministic clustering-based k-anonymization for rich networksInternational Journal of Information Security10.1007/s10207-018-0409-118:2(219-238)Online publication date: 1-Apr-2019
https://dl.acm.org/doi/10.1007/s10207-018-0409-1
Machanavajjhala AHe XHay MChirkova RYang JSuciu D(2017)Differential Privacy in the WildProceedings of the 2017 ACM International Conference on Management of Data10.1145/3035918.3054779(1727-1730)Online publication date: 9-May-2017
https://dl.acm.org/doi/10.1145/3035918.3054779
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents