Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/1179601.1179619acmconferencesArticle/Chapter ViewAbstractPublication PagesccsConference Proceedingsconference-collections
Article

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

Published: 30 October 2006 Publication History

Abstract

Connections in distributed systems, such as social networks, online communities or peer-to-peer networks, form complex graphs. These graphs are of interest to scientists in fields as varied as marketing, epidemiology and psychology. However, knowledge of the graph is typically distributed among a large number of subjects, each of whom knows only a small piece of the graph. Efforts to assemble these pieces often fail because of privacy concerns: subjects refuse to share their local knowledge of the graph. To assuage these privacy concerns, we propose reconstructing the whole graph privately, i.e., in a way that hides the correspondence between the nodes and edges in the graph and the real-life entities and relationships that they represent. We first model the privacy threats posed by the private reconstruction of a distributed graph. Our model takes into account the possibility that malicious nodes may report incorrect information about the graph in order to facilitate later attempts to de-anonymize the reconstructed graph. We then propose protocols to privately assemble the pieces of a graph in ways that mitigate these threats. These protocols severely restrict the ability of adversaries to compromise the privacy of honest subjects.

References

[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.
[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.

Cited By

View all
  • (2023)Secure Multi-Party Computation of Graphs’ Intersection and Union under the Malicious ModelElectronics10.3390/electronics1202025812:2(258)Online publication date: 4-Jan-2023
  • (2021)Privacy Preserving Approaches for Online Social Network Data PublishingDigital Transformation and Challenges to Data Security and Privacy10.4018/978-1-7998-4201-9.ch007(119-132)Online publication date: 2021
  • (2021)MyceliumProceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles10.1145/3477132.3483585(327-343)Online publication date: 26-Oct-2021
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
WPES '06: Proceedings of the 5th ACM workshop on Privacy in electronic society
October 2006
128 pages
ISBN:1595935568
DOI:10.1145/1179601
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

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 October 2006

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. anonymity
  2. graph
  3. privacy
  4. social networks

Qualifiers

  • Article

Conference

CCS06
Sponsor:

Acceptance Rates

Overall Acceptance Rate 106 of 355 submissions, 30%

Upcoming Conference

CCS '25

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)18
  • Downloads (Last 6 weeks)0
Reflects downloads up to 19 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2023)Secure Multi-Party Computation of Graphs’ Intersection and Union under the Malicious ModelElectronics10.3390/electronics1202025812:2(258)Online publication date: 4-Jan-2023
  • (2021)Privacy Preserving Approaches for Online Social Network Data PublishingDigital Transformation and Challenges to Data Security and Privacy10.4018/978-1-7998-4201-9.ch007(119-132)Online publication date: 2021
  • (2021)MyceliumProceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles10.1145/3477132.3483585(327-343)Online publication date: 26-Oct-2021
  • (2021)Privacy Preservation Approaches for Social Network Data PublishingArtificial Intelligence for Cyber Security: Methods, Issues and Possible Horizons or Opportunities10.1007/978-3-030-72236-4_9(213-233)Online publication date: 1-Jun-2021
  • (2020)Resonance - An Intelligence Analysis Framework for Social Connection Inference via Mining Co-Occurrence Patterns Over Multiplex TrajectoriesIEEE Access10.1109/ACCESS.2020.29681318(24535-24548)Online publication date: 2020
  • (2018)De-Anonymization TechniquesSecurity, Privacy, and Anonymization in Social Networks10.4018/978-1-5225-5158-4.ch007(137-147)Online publication date: 2018
  • (2018)Editorial of the Special Issue on Following User Pathways: Key Contributions and Future Directions in Cross-Platform Social Media ResearchInternational Journal of Human–Computer Interaction10.1080/10447318.2018.147157534:10(895-912)Online publication date: 29-May-2018
  • (2017)Secure Multiparty Construction of a Distributed Social NetworkProceedings of the 18th International Conference on Distributed Computing and Networking10.1145/3007748.3007783(1-4)Online publication date: 5-Jan-2017
  • (2016)Privacy preserving anonymization of social networks using eigenvector centrality approachIntelligent Data Analysis10.3233/IDA-16081920:3(543-560)Online publication date: 20-Apr-2016
  • (2016)Social Network Integration and Analysis with Privacy PreservationAnalyzing and Securing Social Networks10.1201/b19566-43(459-475)Online publication date: 31-Mar-2016
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media