The secure link prediction problem
From MaRDI portal
Publication:2274245
DOI10.3934/AMC.2019043zbMATH Open1419.94058arXiv1901.11308OpenAlexW2949411814WikidataQ127645723 ScholiaQ127645723MaRDI QIDQ2274245
Publication date: 19 September 2019
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1901.11308
This page was built for publication: The secure link prediction problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2274245)
