Cryptology ePrint Archive: Report 2019/087

The Secure Link Prediction Problem

Laltu Sardar and Sushmita Ruj

Abstract: Link Prediction is an important and well-studied problem for social networks. Given a snapshot of a graph, the link prediction problem predicts which new interactions between members are most likely to occur in the near future. As networks grow in size, data owners are forced to store the data in remote cloud servers which reveals sensitive information about the network. The graphs are therefore stored in encrypted form.

We study the link prediction problem on encrypted graphs. To the best of our knowledge, this secure link prediction problem has not been studied before. We use the number of common neighbors for prediction. We present three algorithms for the secure link prediction problem. We design prototypes of the schemes and formally prove their security. We execute our algorithms in real-life datasets.

Category / Keywords: applications / Link prediction, Homomorphic encryption, Garbled circuit, Secure computation, Cloud computing

Original Publication (in the same form): Advances in Mathematics of Communications

Date: received 26 Jan 2019, last revised 28 Jan 2019

Contact author: laltuisical at gmail com,sush@isical ac in

Available format(s): PDF | BibTeX Citation

Note: This has been accepted for publication in Advances in Mathematics of Communications (AMC) journal

Version: 20190128:191145 (All versions of this report)

Short URL: ia.cr/2019/087


[ Cryptology ePrint archive ]