# American Institute of Mathematical Sciences

November  2019, 13(4): 733-757. doi: 10.3934/amc.2019043

## The secure link prediction problem

 1 Cryptology and Security Research Unit, Indian Statistical Institute, Kolkata, India 2 R C Bose Centre for Cryptology and Security, Indian Statistical Institute, Kolkata, India

* Corresponding author

Received  October 2018 Revised  January 2019 Published  June 2019

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.

Citation: Laltu Sardar, Sushmita Ruj. The secure link prediction problem. Advances in Mathematics of Communications, 2019, 13 (4) : 733-757. doi: 10.3934/amc.2019043
##### References:

show all references

##### References:
System model
Example of a Maximum circuit with $N = 7$
Different max blocks used in $\mathtt{MAXIMUM}$ circuit
Few circuit blocks
Number of vertices and edges of the subgraphs
comparison between $\mathtt{SLP}$-$\mathtt{I}$ and $\mathtt{SLP}$-$\mathtt{II}$ w.r.t. computation time when the primes are of 128 bits each
Time taken by the proxy in $\mathtt{SLP}$-$\mathtt{II}$ for different datasets considering 128-bit primes
Computational time in $\mathtt{SLP}$-$\mathtt{I}$ with 128,256 and 512-bit primes
Computational time in $\mathtt{SLP}$-$\mathtt{II}$ with 128,256 and 512-bit primes
Complexity Comparison Table
 Param Entity $\mathtt{SLP}$-$\mathtt{I}$ $\mathtt{SLP}$-$\mathtt{II}$ $\mathtt{SLP}$-$\mathtt{III}$ Leakage CS $|V|$, $\tau_{v_1},\tau_{v_2},\ldots$ $|V|$, $\tau_{v_1},\tau_{v_2},\ldots$ $|V|$, $\tau_{v_1},\tau_{v_2},\ldots$ PS $S_{v},i_{res}$ $S'_{v},i_{res}$ $i_{res}$ client $\lambda$ bits $\lambda$ bits $\lambda$ bits Storage CS $|V|^2\rho$ bits $2|V|^2\rho$ bits $|V|^2\rho$ bits PS $\rho$ bits $\rho$ bits $\rho$ bits client $|V|^2(\mathsf{M}+\mathsf{A})$ $|V|^2(\mathsf{M}+\mathsf{A}+\mathsf{M_1}+\mathsf{A_1})$ $|V|^2(\mathsf{M}+\mathsf{A})$ Compu- CS $|V|^2$ $\mathsf{P}$ + $|V|$ $\mathsf{E}$ $|V|^2$ $\mathsf{P}$ + $|V|^2$ $\mathsf{P}$ + $4|V|$ $\mathsf{E}$ tation + ($|V|^2+ |V|$) $\mathsf{M}$ ($|V|^2+ 2|V|$) $\mathsf{M}$ + ($|V|^2+ 3|V|$) $\mathsf{M}$ + $MGC_{const}{(\log |V|,|V|)}$ PS $|V|log|V| (\mathsf{M+C}+\mathsf{M_1+C_1})$ $|V| (\mathsf{M_1+C_1})$ + $|V| (\mathsf{M+C}+\mathsf{M_1+C_1})$+ +$|V|log|V| \mathsf{C}$ +$|V| log|V| \mathsf{C}$ $MGC_{eval}{(\log |V|,|V|)}$ client$\rightarrow$CS $|V|^2 \rho$ bits $2 |V|^2 \rho$ bits $|V|^2\rho$ bits Commu- CS$\rightarrow$PS $2|V|\rho$ bits $|V|\rho$ bits $2|V|\rho$ bits + $|V|OT ^{(\log |V| +1)}_{snd}$+ nication $MGC_{size}{(\log |V|,|V|)}$ bits PS$\rightarrow$CS - - $|V|OT ^{(\log |V| +1)}_{rcv}$ PS$\rightarrow$client $\log |V|$ bits $2|V| \log |V|$ bits $\log |V|$ bits $S_{v}$ - Set of scores of $v$ with all other vertices, $S'_{v}$- a subset of $S_{v}$, $\rho$- length of elements in $\mathbb{G}$ or $\mathbb{G}_1$, $\mathsf{C}$- comparison in $\mathbb{G}$, $\mathsf{C_1}$- comparison in $\mathbb{G}_1$, $\mathsf{M}$- multiplication in $\mathbb{G}$, $\mathsf{M_1}$- multiplication in $\mathbb{G}_1$, $\mathsf{E}$- exponentiation in $\mathbb{G}$, $\mathsf{E_1}$- exponentiation in $\mathbb{G}_1$, $\mathsf{P}$- pairing/ bilinear map computation, $MGC_{size}{(\log |V|,|V|)}$- size of $MGC$ with $|V|$ $\log |V|$-bit inputs, $MGC_{const}{(\log |V|,|V|)}$- $MGC$ contraction with $|V|$ $\log |V|$-bit inputs, $MGC_{eval}{(\log |V|,|V|)}$- $MGC$ evaluation with $|V|$ $\log |V|$-bit inputs, $OT ^{(\log |V| +1)}_{snd}$- information to send for $(\log |V|+1)$-bit $OT$, $OT ^{(\log |V| +1)}_{rcv}$- information to receive for $\log |V|$-bit $OT$.
 Param Entity $\mathtt{SLP}$-$\mathtt{I}$ $\mathtt{SLP}$-$\mathtt{II}$ $\mathtt{SLP}$-$\mathtt{III}$ Leakage CS $|V|$, $\tau_{v_1},\tau_{v_2},\ldots$ $|V|$, $\tau_{v_1},\tau_{v_2},\ldots$ $|V|$, $\tau_{v_1},\tau_{v_2},\ldots$ PS $S_{v},i_{res}$ $S'_{v},i_{res}$ $i_{res}$ client $\lambda$ bits $\lambda$ bits $\lambda$ bits Storage CS $|V|^2\rho$ bits $2|V|^2\rho$ bits $|V|^2\rho$ bits PS $\rho$ bits $\rho$ bits $\rho$ bits client $|V|^2(\mathsf{M}+\mathsf{A})$ $|V|^2(\mathsf{M}+\mathsf{A}+\mathsf{M_1}+\mathsf{A_1})$ $|V|^2(\mathsf{M}+\mathsf{A})$ Compu- CS $|V|^2$ $\mathsf{P}$ + $|V|$ $\mathsf{E}$ $|V|^2$ $\mathsf{P}$ + $|V|^2$ $\mathsf{P}$ + $4|V|$ $\mathsf{E}$ tation + ($|V|^2+ |V|$) $\mathsf{M}$ ($|V|^2+ 2|V|$) $\mathsf{M}$ + ($|V|^2+ 3|V|$) $\mathsf{M}$ + $MGC_{const}{(\log |V|,|V|)}$ PS $|V|log|V| (\mathsf{M+C}+\mathsf{M_1+C_1})$ $|V| (\mathsf{M_1+C_1})$ + $|V| (\mathsf{M+C}+\mathsf{M_1+C_1})$+ +$|V|log|V| \mathsf{C}$ +$|V| log|V| \mathsf{C}$ $MGC_{eval}{(\log |V|,|V|)}$ client$\rightarrow$CS $|V|^2 \rho$ bits $2 |V|^2 \rho$ bits $|V|^2\rho$ bits Commu- CS$\rightarrow$PS $2|V|\rho$ bits $|V|\rho$ bits $2|V|\rho$ bits + $|V|OT ^{(\log |V| +1)}_{snd}$+ nication $MGC_{size}{(\log |V|,|V|)}$ bits PS$\rightarrow$CS - - $|V|OT ^{(\log |V| +1)}_{rcv}$ PS$\rightarrow$client $\log |V|$ bits $2|V| \log |V|$ bits $\log |V|$ bits $S_{v}$ - Set of scores of $v$ with all other vertices, $S'_{v}$- a subset of $S_{v}$, $\rho$- length of elements in $\mathbb{G}$ or $\mathbb{G}_1$, $\mathsf{C}$- comparison in $\mathbb{G}$, $\mathsf{C_1}$- comparison in $\mathbb{G}_1$, $\mathsf{M}$- multiplication in $\mathbb{G}$, $\mathsf{M_1}$- multiplication in $\mathbb{G}_1$, $\mathsf{E}$- exponentiation in $\mathbb{G}$, $\mathsf{E_1}$- exponentiation in $\mathbb{G}_1$, $\mathsf{P}$- pairing/ bilinear map computation, $MGC_{size}{(\log |V|,|V|)}$- size of $MGC$ with $|V|$ $\log |V|$-bit inputs, $MGC_{const}{(\log |V|,|V|)}$- $MGC$ contraction with $|V|$ $\log |V|$-bit inputs, $MGC_{eval}{(\log |V|,|V|)}$- $MGC$ evaluation with $|V|$ $\log |V|$-bit inputs, $OT ^{(\log |V| +1)}_{snd}$- information to send for $(\log |V|+1)$-bit $OT$, $OT ^{(\log |V| +1)}_{rcv}$- information to receive for $\log |V|$-bit $OT$.
Detail of the graph datasets
 Dataset Name #Nodes #Edges bitcoin-alpha 3,783 24,186 ego-facebook 4,039 88,234 email-Enron 36,692 183,831 email-Eu-core 1,005 25,571 Wiki-Vote 7,115 103,689
 Dataset Name #Nodes #Edges bitcoin-alpha 3,783 24,186 ego-facebook 4,039 88,234 email-Enron 36,692 183,831 email-Eu-core 1,005 25,571 Wiki-Vote 7,115 103,689
 [1] Weidong Bao, Haoran Ji, Xiaomin Zhu, Ji Wang, Wenhua Xiao, Jianhong Wu. ACO-based solution for computation offloading in mobile cloud computing. Big Data & Information Analytics, 2016, 1 (1) : 1-13. doi: 10.3934/bdia.2016.1.1 [2] Manisha Pujari, Rushed Kanawati. Link prediction in multiplex networks. Networks & Heterogeneous Media, 2015, 10 (1) : 17-35. doi: 10.3934/nhm.2015.10.17 [3] Yang Lu, Jiguo Li. Forward-secure identity-based encryption with direct chosen-ciphertext security in the standard model. Advances in Mathematics of Communications, 2017, 11 (1) : 161-177. doi: 10.3934/amc.2017010 [4] Kyosuke Hashimoto, Hiroyuki Masuyama, Shoji Kasahara, Yutaka Takahashi. Performance analysis of backup-task scheduling with deadline time in cloud computing. Journal of Industrial & Management Optimization, 2015, 11 (3) : 867-886. doi: 10.3934/jimo.2015.11.867 [5] Jinsong Xu. Reversible hidden data access algorithm in cloud computing environment. Discrete & Continuous Dynamical Systems - S, 2019, 12 (4&5) : 1219-1232. doi: 10.3934/dcdss.2019084 [6] Serap Ergün, Bariş Bülent Kırlar, Sırma Zeynep Alparslan Gök, Gerhard-Wilhelm Weber. An application of crypto cloud computing in social networks by cooperative game theory. Journal of Industrial & Management Optimization, 2020, 16 (4) : 1927-1941. doi: 10.3934/jimo.2019036 [7] Tsuguhito Hirai, Hiroyuki Masuyama, Shoji Kasahara, Yutaka Takahashi. Performance analysis of large-scale parallel-distributed processing with backup tasks for cloud computing. Journal of Industrial & Management Optimization, 2014, 10 (1) : 113-129. doi: 10.3934/jimo.2014.10.113 [8] Min Zhang, Gang Li. Multi-objective optimization algorithm based on improved particle swarm in cloud computing environment. Discrete & Continuous Dynamical Systems - S, 2019, 12 (4&5) : 1413-1426. doi: 10.3934/dcdss.2019097 [9] Angsuman Das, Avishek Adhikari, Kouichi Sakurai. Plaintext checkable encryption with designated checker. Advances in Mathematics of Communications, 2015, 9 (1) : 37-53. doi: 10.3934/amc.2015.9.37 [10] Debrup Chakraborty, Sebati Ghosh, Cuauhtemoc Mancillas López, Palash Sarkar. ${\sf {FAST}}$: Disk encryption and beyond. Advances in Mathematics of Communications, 2020  doi: 10.3934/amc.2020108 [11] Xueyan Wu. An algorithm for reversible information hiding of encrypted medical images in homomorphic encrypted domain. Discrete & Continuous Dynamical Systems - S, 2019, 12 (4&5) : 1441-1455. doi: 10.3934/dcdss.2019099 [12] Wolfgang Wagner. A random cloud model for the Wigner equation. Kinetic & Related Models, 2016, 9 (1) : 217-235. doi: 10.3934/krm.2016.9.217 [13] Fok Ricky, Lasek Agnieszka, Li Jiye, An Aijun. Modeling daily guest count prediction. Big Data & Information Analytics, 2016, 1 (4) : 299-308. doi: 10.3934/bdia.2016012 [14] Changhong Shi, Han-Xiong Li, Tianshou Zhou. A simple regulatory circuit that can simultaneously generate excitability of two different mechanisms. Discrete & Continuous Dynamical Systems - B, 2012, 17 (1) : 271-282. doi: 10.3934/dcdsb.2012.17.271 [15] S.M. Booker, P.D. Smith, P. Brennan, R. Bullock. In-band disruption of a nonlinear circuit using optimal forcing functions. Discrete & Continuous Dynamical Systems - B, 2002, 2 (2) : 221-242. doi: 10.3934/dcdsb.2002.2.221 [16] D. R. Stinson. Unconditionally secure chaffing and winnowing with short authentication tags. Advances in Mathematics of Communications, 2007, 1 (2) : 269-280. doi: 10.3934/amc.2007.1.269 [17] Sumit Kumar Debnath, Pantelimon Stǎnicǎ, Nibedita Kundu, Tanmay Choudhury. Secure and efficient multiparty private set intersection cardinality. Advances in Mathematics of Communications, 2021, 15 (2) : 365-386. doi: 10.3934/amc.2020071 [18] Karan Khathuria, Joachim Rosenthal, Violetta Weger. Encryption scheme based on expanded Reed-Solomon codes. Advances in Mathematics of Communications, 2021, 15 (2) : 207-218. doi: 10.3934/amc.2020053 [19] Fei Gao. Data encryption algorithm for e-commerce platform based on blockchain technology. Discrete & Continuous Dynamical Systems - S, 2019, 12 (4&5) : 1457-1470. doi: 10.3934/dcdss.2019100 [20] Aiwan Fan, Qiming Wang, Joyati Debnath. A high precision data encryption algorithm in wireless network mobile communication. Discrete & Continuous Dynamical Systems - S, 2019, 12 (4&5) : 1327-1340. doi: 10.3934/dcdss.2019091

2019 Impact Factor: 0.734