Wherefore art thou R3579X? Anonymized social networks, hidden patterns, and structural steganography

Communications of the ACM

Volumn 54, Issue 12, 2011, Pages 133-141

  Backstrom, Lars ^a   Dwork, Cynthia ^b   Kleinberg, Jon ^c  

^a FACEBOOK   (United States)

^b MICROSOFT RESEARCH   (United States)

^c Department of Molecular Biology and Genetics   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANONYMIZATION; HIDDEN PATTERNS; SOCIAL ENTITIES; SOCIAL NETWORKS; UNIQUE IDENTIFIERS;

COMPUTER APPLICATIONS; COMPUTER SCIENCE;

ARTS COMPUTING;

EID: 82155166768     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/2043174.2043199     Document Type: Article

References (25)

1. Agrawal, D., Aggarwal, C. On the design and quantification of privacy preserving data mining algorithms. In ACMSymposium on Principles of Database System (2001).
2. Agrawal, R., Srikant, R. Privacypreserving data mining. In Proceedings of the ACMSIGMOD (2000).
3. Bhalgat, A., Hariharan, R., Kavitha, T., Panigrahi, D. An O(mn) Gomory- Hutree construction algorithm for unweighted graphs. In Proceedings of ACMSymposium on Theory of Computing (2007).
4. Blum, A., Dwork, C., McSherry, F., Nissim, K. Practical privacy: the SuLQ framework. In ACMPODS(2005).
5. Bollobás, B. Random Graphs. Cambridge University Press, Cambridge, U.K., 2001.
6. Crandall, D., Backstrom, L., Cosley, D., Suri, S., Huttenlocher, D., Kleinberg, J. Inferring social ties from geographic coincidences. Proc. Natl. Acad. Sci., 107 (2010).
7. Dinur, I., Nissim, K. Revealing information while preserving privacy. In Symposium on Principles of Database System (2003).
8. Dwork, C. Differential privacy. Proceedings of International Colloquium on Automata, Languages and Programming (2006).
9. Dwork, C. AFirm Foundation for Private Data Analysis. CACM54, 1 (2011).
10. Dwork, C., McSherry, F., Nissim, K., Smith, A. Calibrating noise to sensitivity in private data analysis. In Proceedings of Theory of Cryptography Conference (2006).
11. Erdøs, P. Some remarks on the theory of graphs. Bull. AMS53 (1947).
12. Flake, G., Tarjan, R., Tsioutsiouliklis, K. Graph clustering and min cut trees. Internet Math. 1 (2003).
13. Gomory, R., Hu, T.C. Multi-terminal network flows. J. Soc. Ind. Appl. Math. 9 (1961).
14. Hardt, M., Rothblum, G. Amultiplicative weights mechanism for privacy-preserving data analysis. In Proceedings of FOGS(2010).
15. Hay, M., Miklau, G., Jensen, D., Towsley, D., Weis, P. Resisting structural re-identification in anonymized social networks. In Proceedings of the VLDBEndowment, 1 (2008).
16. Jernigan, C., Mistree, B. Gaydar: Facebook friendships expose sexual orientation. First Monday 14 (2009).
17. Kumar, R., Novak, J., Pang, B., Tomkins, A. On anonymizing query logs via token-based hashing. In Proceedings of the 16th International World Wide Web Conference (2007).
18. Mishra, N., Sandier, M. Privacy via pseudorandom sketches. In ACMSymposium on Principles of Database System (2006).
19. Mislove, A., Viswanath, B., Gummadi, P.K., Druschel, P. You are who you know: inferring user profiles in online social networks. In ACMWSDM(2010).
20. Narayanan, A., Shmatikov, V. Robust de-anonymization of large sparse datasets (How to break anonymity of the Netflix prize dataset). In Proceedings of the IEEE Symposium on Security and Privacy (2008).
21. Narayanan, A., Shmatikov, V. De-anonymizing social networks. In Proceedings of the IEEE Symposium on Security and Privacy (2009).
22. Novak, J., Raghavan, P., Tomkins, A. Anti-aliasing on the web. Proceedings of the 13th International World Wide Web Conference (2004).
23. Samarati, P. Protecting respondents' identities in microdata release. IEEE TKDE 13 (2001).
24. Sweeney, L., k-anonymity: a model for protecting privacy. Intl. J. Uncertainty Fuzziness Knowledge-Based Systems 10 (2002).
25. Zheleva, E., Getoor, L. The illusion of privacy in social networks with mixed public and private user profiles. Proceedings of the 18th International World Wide Web Conference (2009).