查看文章

Existing methods regarding the influential nodes identification in complex networks usually assume that the structures of the networks are fully known. However, in many cases, knowing the full structure of one network is hard or impossible, and each participant can only obtain the partial structure of the networks. Therefore, each participant can be viewed as a private network (PN) of the original network, and they form multiple PNs. Then, one question arises: how to collaboratively identify influential nodes in multiple PNs while protecting the privacy of each PN. To this end, a secure multiparty computation ranking (SMPC-ranking) method is proposed to solve such an all-new problem based on the secure multiparty computation (SMPC) protocol, in which the SMPC protocol jointly computes a centrality function to measure the comprehensive importance of nodes or their ranking results by integrating each PN’s inputs …