Private social network analysis: How to assemble pieces of a graph privately

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2006, Pages 89-97

  Frikken, Keith B ^a   Golle, Philippe ^b  

^a MIAMI UNIVERSITY   (United States)

^b PALO ALTO RESEARCH CENTER   (United States)

Author keywords

anonymity; graph; privacy; social networks

Indexed keywords

ANONYMITY; DISTRIBUTED SYSTEMS; GRAPH; LOCAL KNOWLEDGE; MALICIOUS NODES; ON-LINE COMMUNITIES; PRIVACY CONCERNS; PRIVACY THREATS;

COMPUTER PRIVACY; DATA PRIVACY; DISTRIBUTED COMPUTER SYSTEMS; NETWORK SECURITY; SOCIAL NETWORKING (ONLINE);

GRAPH THEORY;

EID: 84885209870     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1179601.1179619     Document Type: Conference Paper

References (27)

1. J. Black. The Perils and Promise of Online Schmoozing. Business Week Online, February 20, 2004. http://yahoo.businessweek.com/technology/content/ feb2004/tc20040220 3260 tc073.htm
2. J. Boissevain. Friends of friends: Networks, manipulators, and coalitions. 1974. Oxford.
3. J. Brickell and V. Shmatikov. Privacy preserving graph algorithms in the semi-honest model. In Proc. of Asiacrypt '05. To appear.
4. D. Chaum. Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. In Communications of the ACM, 24(2):84-88, 1981. (Pubitemid 11480996)
5. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Proc. of CRYPTO'86. LNCS 263, pp. 186-194.
6. Garton, L., Haythornthwaite, C., and Wellman, B. (1997). Studying online social networks. Journal of Computer Mediated Communication, 3(1).
7. M. Gladwell. The Tipping Point: How Little Things Can Make a Big Difference (pp. 30-88). Back Bay Books, 2002.
8. O. Goldreich, S. Micali and A. Widgerson. How to play any mental game. In STOC'87, pp. 218-229. ACM, 1987.
9. P. Golle and M. Jakobsson. Reusable Anonymous Return Channels. In ACM Workshop on Privacy in the Electronic Society '03, pp. 94-100. ACM Press, 2003.
10. M. Jakobsson, A. Juels, and R. Rivest. Making mix nets robust for electronic voting by randomized partial checking. In Proc. of USENIX'02, pp. 339-353.
11. M. Jakobsson and C. Schnorr. Efficient Oblivious Proofs of Correct Exponentiation. In Proc. of CMS .99.
12. M. Kochen. The small world. 1989. Norwood, NJ: Ablex.
13. V. E. Krebs. Uncloaking terrorist networks. In First Monday, Vol. 7 (4), April 2002.
14. A. Neff. A verifiable secret shuffle and its application to e-voting. In Proc. of ACM CCS '01, pp. 116-125.
15. A. Newitz. Defenses lacking at social network sites. SecurityFocus, Dec 31, 2003. http://www.securityfocus.com/news/7739
16. M. Newman. Who is the best connected scientist? A study of scientific coauthorship networks. In Phys Rev, E 64.
17. W. Ogata, K. Kurosawa, K. Sako and K. Takatani. Fault tolerant anonymous channel. In Proc. of ICICS '97, pp. 440-444, 1997. LNCS 1334.
18. http://www.orgnet.com/
19. T. Pedersen. A Threshold Cryptosystem Without a Trusted Third Party. In Proc. of Eurocrypt '91, pp. 129-140. LNCS 547.
20. R. Rice. Network analysis and computer-mediated communication systems. In Advances in social network analysis, pp. 167-203. 1994.
21. C.P. Schnorr. Efficient signature generation by smart cards. In Journal of Cryptology, 4:161.174, 1991.
22. M. A. Smith. Communities in Cyberspace. Routledge, London, 1999, pp. 195-219.
23. M. K. Sparrow. The application of network analysis to criminal intelligence: an assessment of the prospects. In Social Networks, Vol. 13, pp. 251-274.
24. J. Tyler, D. Wilkinson and B. A. Huberman. Email as Spectroscopy: Automated Discovery of Community Structure within Organizations. In the proceedings of Communities & Technologies 2003, pp. 81-96.
25. B. Welman. Networks in the Global Village. Westview Press, Boulder, CO, 1999.
26. B. Wellman. Computer networks as social networks. In Science, 293, 14, Sept 2001, pp. 2031-34.
27. A. C. Yao. Protocols for secure computations. In FOCS'82, pp. 160-164. IEEE Computer Society, 1982.