Secure Centrality Computation Over Multiple Networks

Gilad Asharov, Francesco Bonchi, David García-Soriano, Tamir Tassa · 2017

Consider a multi-layered 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?

Read the paper · More papers on PaperTik