{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T15:06:48Z","timestamp":1772809608100,"version":"3.50.1"},"reference-count":25,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2019]]},"DOI":"10.3934\/amc.2019043","type":"journal-article","created":{"date-parts":[[2019,6,21]],"date-time":"2019-06-21T23:53:48Z","timestamp":1561161228000},"page":"733-757","source":"Crossref","is-referenced-by-count":4,"title":["The secure link prediction problem"],"prefix":"10.3934","volume":"13","author":[{"given":"Laltu","family":"Sardar","sequence":"first","affiliation":[]},{"given":"Sushmita","family":"Ruj","sequence":"additional","affiliation":[{"name":"R C Bose Centre for Cryptology and Security, Indian Statistical Institute, Kolkata, India"}]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2019043-1","unstructured":"

https:\/\/www.cryptopp.com\/benchmarks.html<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2019043-2","doi-asserted-by":"crossref","unstructured":"

G. Asharov, Y. Lindell, T. Schneider and M. Zohner, More efficient oblivious transfer and extensions for faster secure computation, in 2013 ACM SIGSAC Conference on Computer and Communications Security, CCS'13, Berlin, Germany, November 4-8, 2013<\/i>, 2013, 535\u2013548.<\/p>","DOI":"10.1145\/2508859.2516738"},{"key":"key-10.3934\/amc.2019043-3","doi-asserted-by":"crossref","unstructured":"

L. Backstrom, C. Dwork and J. M. Kleinberg, Wherefore art thou r3579x: anonymized social networks, hidden patterns, and structural steganography, WWW '07 Proceedings of the 16th international conference on World Wide Web<\/i>, (2007), 181\u2013190.<\/p>","DOI":"10.1145\/1242572.1242598"},{"key":"key-10.3934\/amc.2019043-4","doi-asserted-by":"crossref","unstructured":"

D. Boneh, E. Goh and K. Nissim, Evaluating 2-dnf formulas on ciphertexts, in Theory of Cryptography, Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10-12, 2005, Proceedings<\/i>, 3378<\/b> (2005), 325\u2013341.<\/p>","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"key-10.3934\/amc.2019043-5","doi-asserted-by":"crossref","unstructured":"

C. B\u00f6sch, A. Peter, B. Leenders, H. W. Lim, Q. Tang, H. Wang, P. H. Hartel and W. Jonker, Distributed searchable symmetric encryption, in 2014 Twelfth Annual International Conference on Privacy, Security and Trust, Toronto, ON, Canada, July 23-24, 2014<\/i>, 2014, 330\u2013337.<\/p>","DOI":"10.1109\/PST.2014.6890956"},{"key":"key-10.3934\/amc.2019043-6","doi-asserted-by":"crossref","unstructured":"

M. Chase and S. Kamara, Structured encryption and controlled disclosure, in Advances in Cryptology - ASIACRYPT 2010 - 16th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 5-9, 2010. Proceedings<\/i>, 6417<\/b> (2010), 577\u2013594.<\/p>","DOI":"10.1007\/978-3-642-17373-8_33"},{"key":"key-10.3934\/amc.2019043-7","doi-asserted-by":"crossref","unstructured":"

V. Kolesnikov, A. Sadeghi and T. Schneider, Improved garbled circuit building blocks and applications to auctions and computing minima, in Cryptology and Network Security, 8th International Conference, CANS 2009, Kanazawa, Japan, December 12-14, 2009. Proceedings<\/i>, 2009, 1\u201320.<\/p>","DOI":"10.1007\/978-3-642-10433-6_1"},{"key":"#cr-split#-key-10.3934\/amc.2019043-8.1","unstructured":"

V. Kolesnikov and T. Schneider, Improved garbled circuit: Free XOR gates and applications, in Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming<\/i> &"},{"key":"#cr-split#-key-10.3934\/amc.2019043-8.2","unstructured":"Track C: Security and Cryptography Foundations<\/i>, 5126<\/b> (2008), 486-498.<\/p>"},{"key":"key-10.3934\/amc.2019043-9","unstructured":"

J. Leskovec and A. Krevl, SNAP Datasets: Stanford large network dataset collection, http:\/\/snap.stanford.edu\/data<\/a>, 2014.<\/p>"},{"key":"key-10.3934\/amc.2019043-10","doi-asserted-by":"crossref","unstructured":"

D. Liben-Nowell and J. M. Kleinberg, The link prediction problem for social networks, in Proceedings of the 2003 ACM CIKM International Conference on Information and Knowledge Management, New Orleans, Louisiana, USA, November 2-8, 2003<\/i>, 2003, 556\u2013559.<\/p>","DOI":"10.1145\/956863.956972"},{"key":"key-10.3934\/amc.2019043-11","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-008-9036-8"},{"key":"key-10.3934\/amc.2019043-12","doi-asserted-by":"publisher","DOI":"10.1109\/TSUSC.2017.2704163"},{"key":"key-10.3934\/amc.2019043-13"},{"key":"key-10.3934\/amc.2019043-14","doi-asserted-by":"crossref","unstructured":"

X. Meng, S. Kamara, K. Nissim and G. Kollios, GRECS: graph encryption for approximate shortest distance queries, in Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, October 12-6, 2015<\/i>, 2015, 504\u2013517.<\/p>","DOI":"10.1145\/2810103.2813672"},{"key":"key-10.3934\/amc.2019043-15","unstructured":"

M. Naor and B. Pinkas, Efficient oblivious transfer protocols, in Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA.<\/i>, 2001, 448\u2013457.<\/p>"},{"key":"key-10.3934\/amc.2019043-16","doi-asserted-by":"crossref","unstructured":"

K. Nayak, X. S. Wang, S. Ioannidis, U. Weinsberg, N. Taft and E. Shi, Graphsc: Parallel secure computation made easy, in 2015 IEEE Symposium on Security and Privacy, SP 2015, San Jose, CA, USA, May 17-21, 2015<\/i>, 2015, 377\u2013394.<\/p>","DOI":"10.1109\/SP.2015.30"},{"key":"key-10.3934\/amc.2019043-17","unstructured":"

PBC Library, The Pairing-based Cryptography Library, https:\/\/crypto.stanford.edu\/pbc\/<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2019043-18","unstructured":"

L. Sardar and S. Ruj, Prototypes of secure link prediction schemes, GitHub repository, https:\/\/github.com\/sardarlaltu\/SecureLinkPrediction<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2019043-19","doi-asserted-by":"crossref","unstructured":"

M. Shen, B. Ma, L. Zhu, R. Mijumbi, X. Du and J. Hu, Cloud-based approximate constrained shortest distance queries over encrypted graphs with privacy protection, IEEE Trans. Information Forensics and Security<\/i>, 13<\/b> (2018), 940\u2013953.<\/p>","DOI":"10.1109\/TIFS.2017.2774451"},{"key":"key-10.3934\/amc.2019043-20","unstructured":"

D. X. Song, D. A. Wagner and A. Perrig, Practical techniques for searches on encrypted data, in 2000 IEEE Symposium on Security and Privacy, Berkeley, California, USA, May 14-17, 2000<\/i>, 2000, 44\u201355.<\/p>"},{"key":"key-10.3934\/amc.2019043-21","doi-asserted-by":"crossref","unstructured":"

E. Stefanov, M. van Dijk, E. Shi, C. W. Fletcher, L. Ren, X. Yu and S. Devadas, Path ORAM: An extremely simple oblivious RAM protocol, J. ACM<\/i>, 65<\/b> (2018), Art. 18, 26 pp.<\/p>","DOI":"10.1145\/3177872"},{"key":"key-10.3934\/amc.2019043-22","doi-asserted-by":"crossref","unstructured":"

Q. Wang, K. Ren, M. Du, Q. Li and A. Mohaisen, Secgdb: Graph encryption for exact shortest distance queries with efficient updates, in Financial Cryptography and Data Security - FC 2017, Sliema, Malta, April 3-7, 2017, Revised Selected Papers<\/i>, 10322<\/b> (2017), 79\u201397.<\/p>","DOI":"10.1007\/978-3-319-70972-7_5"},{"key":"key-10.3934\/amc.2019043-23","doi-asserted-by":"crossref","unstructured":"

A. C. Yao, Protocols for secure computations (extended abstract), in 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3-5 November 1982<\/i>, 1982, 160\u2013164.<\/p>","DOI":"10.1109\/SFCS.1982.38"},{"key":"key-10.3934\/amc.2019043-24","doi-asserted-by":"crossref","unstructured":"

Y. Zheng, B. Wang, W. Lou and Y. T. Hou, Privacy-preserving link prediction in decentralized online social networks, in Computer Security - ESORICS 2015 - Vienna, Austria, September 21-25, 2015, Proceedings, Part II<\/i>, 9327<\/b> (2015), 61\u201380.<\/p>","DOI":"10.1007\/978-3-319-24177-7_4"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:08:44Z","timestamp":1772791724000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2019043"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2019043","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}