Title

The secure link prediction problem

Article Type

Research Article

Publication Title

Advances in Mathematics of Communications

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.

First Page

733

Last Page

757

DOI

10.3934/amc.2019043

Publication Date

11-1-2019

Comments

Open Access, Gold, Green

This document is currently not available here.

Share

COinS