Link privacy in social networks

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2008, Pages 289-298

  Korolova, Aleksandra ^a   Motwani, Rajeev ^a   Nabar, Shubha U ^a   Xu, Ying ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LOOK-AHEAD; SOCIAL NETWORKS;

KNOWLEDGE MANAGEMENT;

EID: 70349248583     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1458082.1458123     Document Type: Conference Paper

References (26)

1. Facebook Press Release.http://www.facebook.com/press/info.php? statistics,2008.
2. TechCrunch. http://www.techcrunch.com/2008/05/17/facebooks-glass- jaw/,2008.
3. Technology Review.http://www.technologyreview.com/Wire/20825/, 2008.
4. L. Adamic, R. Lukose, A. Puniyani, and B. Huberman. Search in power-law networks. Phys. Rev. E, 2001.
5. W. Aiello, F. Chung, and L. Liu. A random graph model for power law graphs. IEEE Symposium on Foundations of Computer Science, 2000.
6. L. Backstrom, C. Dwork, and J. Kleinberg. Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. In WWW '07: Proceedings of the 16th international conference on World Wide Web, pages 181-190, New York, NY, USA, 2007. ACM Press.
7. A. Barabasi and R. Albert. Emergence of scaling in random networks. Science, (509), 1999.
8. E. A. Bender and E. R. Canfield. The asymptotic number of labeled graphs with given degree sequences. Journal of Combinatorial Theory, Series A 24, pp. 296-307, 1978.
9. B. Bollobas, C. Borgs, T. Chayes, and O. Riordan. Directed scale-free graphs. ACM-SIAM Sypmosium on Discrete Algorithms, 2003.
10. C. Cooper and A. Frieze. A general model of web graphs. Random Structures and Algorithms, 22(3), pp.311-335, 2003.
11. G. Csanyi and B. Szendroi. Structure of a large social network. Physical Review E 69, 2004.
12. C. Gkantsidis, M. Mihail, and A. Saberi. Conductance and congestion in power law graphs. Sigmetrics, 2003.
13. M. Hay, G. Miklau, D. Jensen, P. Weis, and S. Srivastava. Anonymizing social networks. University of Massachusetts, Amherst Technical Report, 2007.
14. M. Kelly. Facebook Security: Fighting the good fight. Facebook blog,http://blog.new.facebook.com/blog.php?post=25844207130,August 7, 2008.
15. J. Kleinberg. Navigation in a small world. Nature, (845), 2000.
16. B. Krebs. Account Hijackings Force LiveJournal Changes. Washington Post, January 20, 2006.
17. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal. Stochastic models for the web graph. IEEE Symposium on Foundations of Computer Science, 2000.
18. J. Leskovec, D. Chakrabarti, J. M. Kleinberg, and C. Faloutsos. Realistic, mathematically tractable graph generation and evolution, using kronecker multiplication. In PKDD, pages 133-145, 2005.
19. K. Liu, K. Das, T. Grandison, and H. Kargupta. Privacy-preserving data analysis on graphs and social networks. In H. Kargupta, J. Han, P. Yu, R. Motwani, and V. Kumar, editors, Next Generation Data Mining. CRC Press, 2008.
20. M. Mihail, A. Saberi, and P. Tetali. Random walks with lookahead in power law random graphs. Internet Mathematics.
21. R. Motwani and P. Raghavan. Cambridge University Press New York, NY, USA, 1995.
22. H. von Schelling. Coupon collecting for unequal probabilities. Am. Math. Monthly, 61:306-311, 1954.
23. S. Wasserman and K. Faust. Cambridge University Press, Cambridge, USA, 1994.
24. D. Watts and S. Strogatz. Collective dynamics of small-world networks. Nature 393 440-442, 1998.
25. E. Zheleva and L. Getoor. Preserving the privacy of sensitive relationships in graph data. In Proceedings of the International Workshop on Privacy, Security and Trust in KDD, 2007.
26. B. Zhou and J. Pei. Preserving privacy in social networks against neighborhood attacks. In Data Engineering, 2008. ICDE 2008. IEEE 24th International Conference on, pages 506-515, 2008.