Journal
ADVANCES IN MATHEMATICS OF COMMUNICATIONS
Volume 13, Issue 4, Pages 733-757Publisher
AMER INST MATHEMATICAL SCIENCES-AIMS
DOI: 10.3934/amc.2019043
Keywords
Link prediction; homomorphic encryption; garbled circuit; secure computation; cloud computing
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available