The secure link prediction problem
Open Access
- 1 January 2019
- journal article
- research article
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 13 (4) , 733-757
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.Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- SecGDB: Graph Encryption for Exact Shortest Distance Queries with Efficient Updates2017
- Cloud-Based Approximate Constrained Shortest Distance Queries Over Encrypted Graphs With Privacy ProtectionIEEE Transactions on Information Forensics and Security, 2017
- Privacy-Preserving Link Prediction in Decentralized Online Social Networks2015
- GraphSC: Parallel Secure Computation Made Easy2015
- Distributed Searchable Symmetric Encryption2014
- Structured Encryption and Controlled Disclosure2010
- Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima2009
- A Proof of Security of Yao’s Protocol for Two-Party ComputationJournal of Cryptology, 2008
- Evaluating 2-DNF Formulas on Ciphertexts2005
- Protocols for secure computations1982