Secure centrality computation over multiple networks

Gilad Asharov, Francesco Bonchi, David Garcia Soriano, Tamir Tassa

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations


Consider a multilayer graph, where the different layers correspond to different proprietary social networks on the same ground set of users. Suppose that the owners of the different networks (called hosts) are mutually non-trusting parties: how can they compute a centrality score for each of the users using all the layers, but without disclosing information about their private graphs? Under this setting we study a suite of three centrality measures whose algebraic structure allows performing that computation with provable security and efficiency. The first measure counts the nodes reachable from a node within a given radius. The second measure extends the first one by counting the number of paths between any two nodes. The final one is a generalization to the multilayer graph case: not only the number of paths is counted, but also the multiplicity of these paths in the different layers is considered. We devise a suite of multiparty protocols to compute those centrality measures, which are all provably secure in the information-theoretic sense. One typical challenge and limitation of secure multiparty computation protocols is their scalability. We tackle this problem and devise a protocol which is highly scalable and still provably secure. We test our protocols on several real-world multilayer graphs: interestingly, the protocol to compute the most sensitive measure (i.e., the multilayer centrality) is also the most scalable one and can be efficiently run on very large networks.

Original languageEnglish
Title of host publication26th International World Wide Web Conference, WWW 2017
PublisherInternational World Wide Web Conferences Steering Committee
Number of pages10
ISBN (Print)9781450349130
StatePublished - 2017
Externally publishedYes
Event26th International World Wide Web Conference, WWW 2017 - Perth, Australia
Duration: 3 Apr 20177 Apr 2017

Publication series

Name26th International World Wide Web Conference, WWW 2017


Conference26th International World Wide Web Conference, WWW 2017

Bibliographical note

Funding Information:
Acknowledgement. The first author was supported by a Junior Fellow award from the Simons Foundation; some of the work was done while the author was a postdoc at the IBM Research, supported by NSF Grant No. 1017660, and in the Hebrew University of Jerusalem, supported by Israeli Centers of Research Excellence (I-CORE) Program (Center No. 4/11). The other authors received funding from the EU Horizon 2020 innovation action programme under grant agreement No 653449 (TYPES project).

Publisher Copyright:
© 2017 International World Wide Web Conference Committee (IW3C2)


  • Centrality measures
  • Multilayer graphs
  • Secure multiparty protocols
  • Social networks


Dive into the research topics of 'Secure centrality computation over multiple networks'. Together they form a unique fingerprint.

Cite this