The secure link prediction problem

DOI10.3934/AMC.2019043MaRDI QIDQ2274245zbMATH OpenOpenAlexWikidataFDO

Authors Laltu Sardar, Sushmita Ruj

Publication date 19 September 2019

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1901.11308

zbMATH Keywords

cloud computinglink predictionhomomorphic encryptionsecure computationgarbled circuit

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

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.

Recommendations

• A network structural approach to the link prediction problem
• Link prediction in dynamic networks using random dot product graphs
• A utility-based link prediction method in social networks
• Learning to rank based link prediction algorithm in social networks
• Evidential \(k\)-NN for link prediction

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)