Paper 2019/087

The Secure Link Prediction Problem

Laltu Sardar and Sushmita Ruj


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.

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

Available format(s)
Publication info
Published elsewhere. Advances in Mathematics of Communications
Link predictionHomomorphic encryptionGarbled circuitSecure computationCloud computing
Contact author(s)
laltuisical @ gmail com
sush @ isical ac in
2019-01-28: revised
2019-01-28: received
See all versions
Short URL
Creative Commons Attribution


      author = {Laltu Sardar and Sushmita Ruj},
      title = {The Secure Link Prediction Problem},
      howpublished = {Cryptology ePrint Archive, Paper 2019/087},
      year = {2019},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.