Preserving Link Privacy in Social Network Based Systems

20th Annual Network and Distributed System Security Symposium, NDSS 2013

Volumn , Issue , 2013, Pages

  Mittal, Prateek ^a   Papamanthou, Charalampos ^a   Song, Dawn ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

% REDUCTIONS; GROWING BODIES; LINK PRIVACIES; NETWORK BASED SYSTEMS; NETWORK-BASED; REAL-WORLD; SECURE SYSTEM; SENSITIVE INFORMATIONS; SOCIAL GRAPHS; TRUST RELATIONSHIP;

EID: 85180405994     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (39)

1. D. Aldous and J. Fill. Reversible Markov Chains and Random Walks on Graphs. http://www.stat.berkeley.edu/aldous/RWG/book.html.
2. L. Backstrom, C. Dwork, and J. Kleinberg. Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. In WWW, 2007.
3. M. Bastian, S. Heymann, and M. Jacomy. Gephi: An open source software for exploring and manipulating networks. In International AAAI Conference on We-blogs and Social Media, 2009.
4. S.-H. Cha. Comprehensive survey of distance/similarity measures between probability density functions. International Journal of Mathematical Models and Methods in Applied Sciences, 1(4), 2007.
5. G. Danezis, C. Diaz, C. Troncoso, and B. Laurie. Drac: an architecture for anonymous low-volume communications. In PETS, 2010.
6. G. Danezis and P. Mittal. Sybilinfer: Detecting Sybil nodes using social networks. In NDSS, 2009.
7. R. Dey, Z. Jelveh, and K. Ross. Facebook users have become much more private: a large scale study. Technical report, New York University, 2011.
8. J. Douceur. The Sybil Attack. In IPTPS, 2002.
9. C. Dwork. Differential privacy: a survey of results. In TAMC, 2008.
10. W. K. Hastings. Monte carlo sampling methods using markov chains and their applications. Biometrika, 57(1), 1970.
11. M. Hay, G. Miklau, D. Jensen, D. Towsley, and P. Weis. Resisting structural re-identification in anonymized social networks. Proc. VLDB Endow., 1(1), 2008.
12. M. Hay, G. Miklau, D. Jensen, P. Weis, and S. Srivastava. Anonymizing social networks. Technical Report 07-09, University of Massachusetts, Amherst, 2007.
13. A. Korolova, R. Motwani, S. U. Nabar, and Y. Xu. Link privacy in social networks. In CIKM, 2008.
14. C. Lesniewski-Laas and M. F. Kaashoek. Whanaungatanga: A Sybil-proof distributed hash table. In NSDI, 2010.
15. K. Liu and E. Terzi. Towards identity anonymization on graphs. In SIGMOD, 2008.
16. X. Lu, Y. Song, and S. Bressan. Fast identity anonymization on graphs. In DEXA, 2012.
17. S. Marti, P. Ganesan, and H. Garcia-Molina. SPROUT: P2P routing with social networks. In P2P&DB, 2004.
18. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller. Equation of state calculations by fast computing machines. The Journal of Chemical Physics, 21(6), 1953.
19. A. Mislove, A. Post, P. Druschel, and K. P. Gummadi. Ostra: leveraging trust to thwart unwanted communication. In NSDI, 2008.
20. P. Mittal, N. Borisov, C. Troncoso, and A. Rial. Scalable anonymous communication with provable security. In USENIX HotSec, 2010.
21. P. Mittal, M. Caesar, and N. Borisov. X-vine: Secure and pseudonymous routing using social networks. In NDSS, 2012.
22. P. Mittal, M. Wright, and N. Borisov. Pisces: Anonymous communication using social networks. In NDSS, 2013.
23. A. Mohaisen, N. Hopper, and Y. Kim. Keep your friends close: Incorporating trust into social network-based sybil defenses. In INFOCOM, 2011.
24. A. Mohaisen, A. Yun, and Y. Kim. Measuring the mixing time of social graphs. In IMC, 2010.
25. S. Nagaraja. Anonymity in the wild: mixes on unstructured networks. In PETS, 2007.
26. A. Narayanan and V. Shmatikov. De-anonymizing social networks. In IEEE SSP, 2009.
27. J. A. Pouwelse, P. Garbacki, J. Wang, A. Bakker, J. Yang, A. Iosup, D. H. J. Epema, M. Reinders, M. R. van Steen, and H. J. Sips. Tribler: a social-based peer-to-peer system: Research articles. Concurr. Comput. : Pract. Exper., 20(2), 2008.
28. V. Rastogi, M. Hay, G. Miklau, and D. Suciu. Relationship privacy: output perturbation for queries with joins. In PODS, 2009.
29. A. Sala, X. Zhao, C. Wilson, H. Zheng, and B. Y. Zhao. Sharing graphs using differentially private graph models. In IMC, 2011.
30. Y. Sovran, J. Li, and L. Subramanian. Unblocking the internet: Social networks foil censors. Technical report, NYU, 2008.
31. N. Tran, J. Li, L. Subramanian, and S. Chow. Optimal sybil-resilient node admission control. In INFOCOM, 2011.
32. N. Tran, B. Min, J. Li, and L. Subramanian. Sybil-resilient online content voting. In NSDI, 2009.
33. B. Viswanath, A. Mislove, M. Cha, and K. P. Gummadi. On the evolution of user interaction in Facebook. In WOSN, 2009.
34. X. Ying and X. Wu. Randomizing social networks: a spectrum preserving approach. In SDM, 2008.
35. H. Yu, P. B. Gibbons, M. Kaminsky, and F. Xiao. Sybillimit: A near-optimal social network defense against Sybil attacks. In IEEE S&P, 2008.
36. H. Yu, M. Kaminsky, P. Gibbons, and A. Flaxman. SybilGuard: Defending against Sybil attacks via social networks. In SIGCOMM, 2006.
37. E. Zheleva and L. Getoor. Preserving the privacy of sensitive relationships in graph data. In PinKDD, 2008.
38. B. Zhou and J. Pei. Preserving privacy in social networks against neighborhood attacks. In ICDE, 2008.
39. B. Zhou and J. Pei. The k-anonymity and l-diversity approaches for privacy preservation in social networks against neighborhood attacks. Knowl. Inf. Syst., 28(1), 2011.