Computing node clustering coefficients securely

Katchaguy Areekijseree, Yuzhe Tang, Sucheta Soundarajan

Research output: Chapter in Book/Entry/PoemConference contribution

Abstract

When performing any analysis task, some information may be leaked or scattered among individuals who may not willing to share their information (e.g., number of individual’s friends and who they are). Secure multi-party computation (MPC) allows individuals to jointly perform any computation without revealing each individual’s input. Here, we present two novel secure frameworks which allow node to securely compute its clustering coefficient, which we evaluate the trade off between efficiency and security of several proposed instantiations. Our results show that the cost for secure computing highly depends on network structure.

Original languageEnglish (US)
Title of host publicationProceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2019
EditorsFrancesca Spezzano, Wei Chen, Xiaokui Xiao
PublisherAssociation for Computing Machinery, Inc
Pages532-533
Number of pages2
ISBN (Electronic)9781450368681
DOIs
StatePublished - Aug 27 2019
Event11th IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2019 - Vancouver, Canada
Duration: Aug 27 2019Aug 30 2019

Publication series

NameProceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2019

Conference

Conference11th IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2019
Country/TerritoryCanada
CityVancouver
Period8/27/198/30/19

ASJC Scopus subject areas

  • Communication
  • Computer Networks and Communications
  • Information Systems and Management
  • Sociology and Political Science

Fingerprint

Dive into the research topics of 'Computing node clustering coefficients securely'. Together they form a unique fingerprint.

Cite this