{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T22:59:17Z","timestamp":1762210757212},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,10,15]],"date-time":"2013-10-15T00:00:00Z","timestamp":1381795200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s10115-013-0699-6","type":"journal-article","created":{"date-parts":[[2013,10,14]],"date-time":"2013-10-14T06:01:08Z","timestamp":1381730468000},"page":"663-687","source":"Crossref","is-referenced-by-count":11,"title":["Interest-driven private friend recommendation"],"prefix":"10.1007","volume":"42","author":[{"given":"Bharath K.","family":"Samanthula","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,15]]},"reference":[{"key":"699_CR1","doi-asserted-by":"crossref","unstructured":"Asur S, Huberman BA (2010) Predicting the future with social media. In: Proceedings of IEEE\/WIC\/ACM international conference on Web intelligence and intelligent agent technology, pp 492\u2013499","DOI":"10.1109\/WI-IAT.2010.63"},{"key":"699_CR2","doi-asserted-by":"crossref","unstructured":"Ben-David A, Nisan N, Pinkas B (October 2008) Fairplaymp\u2014a system for secure multi-party computation. In: Proceedings of the ACM computer and communications security conference (ACM CCS)","DOI":"10.1145\/1455770.1455804"},{"key":"699_CR3","doi-asserted-by":"crossref","first-page":"22:1","DOI":"10.1145\/1961189.1961194","volume":"2","author":"F Bonchi","year":"2011","unstructured":"Bonchi F, Castillo C, Gionis A, Jaimes A (2011) Social network analysis and mining for business applications. ACM Trans Intell Syst Technol 2:22:1\u201322:37","journal-title":"ACM Trans Intell Syst Technol"},{"issue":"1","key":"699_CR4","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1111\/j.1083-6101.2007.00393.x","volume":"13","author":"D Boyd","year":"2008","unstructured":"Boyd D, Ellison NB (2008) Social network sites: definition, history, and scholarship. J Comput-Mediat Commun 13(1):210\u2013230","journal-title":"J Comput-Mediat Commun"},{"issue":"1","key":"699_CR5","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti R (2000) Security and composition of multiparty cryptographic protocols. J Cryptol 13(1):143\u2013202","journal-title":"J Cryptol"},{"key":"699_CR6","doi-asserted-by":"crossref","unstructured":"Chen J, Geyer W, Dugan C, Muller M, Guy I (2009) Make new friends, but keep the old: recommending people on social networking sites. In: Proceedings of the 27th international conference on Human factors in, computing systems, pp 201\u2013210","DOI":"10.1145\/1518701.1518735"},{"key":"699_CR7","doi-asserted-by":"crossref","unstructured":"Cutillo LA, Molva R, Onen M (Dec 2011) Analysis of privacy in online social networks from the graph theory perspective. In: Proceedings of IEEE global telecommunications conference (GLOBECOM 2011), pp 1\u20135","DOI":"10.1109\/GLOCOM.2011.6133517"},{"key":"699_CR8","doi-asserted-by":"crossref","unstructured":"Dai B-R, Lee C-Y, Chung C-H (July 2011) A framework of recommendation system based on both network structure and messages. In: International conference on advances in social networks analysis and mining (ASONAM\u2019 11), pp 709\u2013714","DOI":"10.1109\/ASONAM.2011.68"},{"key":"699_CR9","doi-asserted-by":"crossref","unstructured":"Delgado J, Rodr\u00edguez E, Llorente S (2010) User\u2019s privacy in applications provided through social networks. In: Proceedings of second ACM SIGMM workshop on Social media (WSM \u201910), pp 39\u201344","DOI":"10.1145\/1878151.1878163"},{"key":"699_CR10","doi-asserted-by":"crossref","unstructured":"Dey R, Jelveh Z, Ross K (March 2012) Facebook users have become much more private: a large-scale study. In: IEEE international conference on pervasive computing and communications workshops (PERCOM workshops), pp 346\u2013352","DOI":"10.1109\/PerComW.2012.6197508"},{"key":"699_CR11","doi-asserted-by":"crossref","unstructured":"Dong W, Dave V, Qiu L, Zhang Y (April 2011) Secure friend discovery in mobile social networks. In: Proceedings IEEE INFOCOM, pp 1647\u20131655","DOI":"10.1109\/INFCOM.2011.5934958"},{"key":"699_CR12","doi-asserted-by":"crossref","unstructured":"Dwork C (2006) Differential privacy. In: ICALP, pp 1\u201312","DOI":"10.1007\/11787006_1"},{"key":"699_CR13","unstructured":"Dwyer C, Hiltz SR, Passerini K (2007) Trust and privacy concern within social networking sites: a comparison of facebook and myspace. In: Proceedings of the thirteenth Americas conference on information systems (AMCIS 2007)"},{"key":"699_CR14","doi-asserted-by":"crossref","unstructured":"Ehrlich DM (2006) Social network survey paper. Int J Learn Intellect Cap 3(2):167\u2013177","DOI":"10.1504\/IJLIC.2006.010330"},{"key":"699_CR15","doi-asserted-by":"crossref","unstructured":"Freedman MJ, Nissim K, Pinkas B, Efficient private matching and set intersection. In: Eurocrypt 2004, Interlaken, Switzerland, May 2\u20136 2004. International Association for Cryptologic Research (IACR)","DOI":"10.1007\/978-3-540-24676-3_1"},{"issue":"4","key":"699_CR16","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1109\/MIC.2011.50","volume":"15","author":"H Gao","year":"2011","unstructured":"Gao H, Hu J, Huang T, Wang J, Chen Y (2011) Security issues in online social networks. IEEE Internet Comput 15(4):56\u201363","journal-title":"IEEE Internet Comput"},{"key":"699_CR17","doi-asserted-by":"crossref","unstructured":"Goethals B, Laur S, Lipmaa H, Mielikainen T (Dec 2\u20133 2004) On secure scalar product computation for privacy-preserving data mining. In: Park C, Chee S (eds) The 7th annual international conference in information security and cryptology (ICISC 2004), pp 104\u2013120, Seoul, Korea","DOI":"10.1007\/11496618_9"},{"key":"699_CR18","unstructured":"Goldreich O (2004) The foundations of cryptography, vol 2, chapter general cryptographic protocols. Cambridge University Press, Cambridge"},{"key":"699_CR19","unstructured":"Goldreich O (2004) The foundations of cryptography, vol 2, chapter encryption schemes. Cambridge University Press, Cambridge"},{"key":"699_CR20","unstructured":"Goldreich O, Micali S, Wigderson A (1987) How to play any mental game\u2014a completeness theorem for protocols with honest majority. In: 19th ACM symposium on the theory of computing, New York, NY, USA, pp 218\u2013229"},{"key":"699_CR21","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S Goldwasser","year":"1989","unstructured":"Goldwasser S, Micali S, Rackoff C (1989) The knowledge complexity of interactive proof systems. SIAM J Comput 18:186\u2013208","journal-title":"SIAM J Comput"},{"key":"699_CR22","doi-asserted-by":"crossref","unstructured":"Gou L, You F, Guo J, Wu L, Zhang XL (2011) Sfviz: interest-based friends exploration and recommendation in social networks. In: Proceedings of visual information communication\u2014international symposium, VINCI \u201911. ACM, pp 1\u201310","DOI":"10.1145\/2016656.2016671"},{"key":"699_CR23","unstructured":"Gou L, Zhang S, Wang J, Zhang XL (2010) Tagnetlens: multiscale visualization of knowledge structures in social tags. In: Proceedings of the 3rd international symposium on visual information communication, VINCI \u201910. ACM, pp 18:1\u20139"},{"key":"699_CR24","doi-asserted-by":"crossref","unstructured":"Gross R, Acquisti A (2005) Information revelation and privacy in online social networks. In: Proceedings of the 2005 ACM workshop on Privacy in the electronic society, WPES \u201905, pp 71\u201380","DOI":"10.1145\/1102199.1102214"},{"key":"699_CR25","doi-asserted-by":"crossref","unstructured":"He J, Chu WW (2010) A social network-based recommender system (snrs). Annu Inf Syst 12:47\u201374; (Special issue on Data Mining for Social Network Data)","DOI":"10.1007\/978-1-4419-6287-4_4"},{"key":"699_CR26","doi-asserted-by":"crossref","unstructured":"Huber M, Mulazzani M, Schrittwieser S, Weippl E (2010) Cheap and automated socio-technical attacks based on social networking sites. In: Proceedings of the 3rd ACM workshop on Artificial intelligence and security, AISec\u201910. ACM, pp 61\u201364","DOI":"10.1145\/1866423.1866435"},{"key":"699_CR27","doi-asserted-by":"crossref","unstructured":"Jiang W, Clifton C (Apr 26\u201328 2007) AC-framework for privacy-preserving collaboration. In: SIAM international conference on data mining, Minneapolis, MN","DOI":"10.1137\/1.9781611972771.5"},{"key":"699_CR28","doi-asserted-by":"crossref","unstructured":"Jiang W, Clifton C, Kantarcioglu M (2008) Transforming semi-honest protocols to ensure accountability. Data Knowl Eng 65(1):57\u201374","DOI":"10.1016\/j.datak.2007.06.014"},{"key":"699_CR29","doi-asserted-by":"crossref","unstructured":"Jiang W, Murugesan M, Clifton C, Si L (2008) Similar document detection with limited information disclosure. In: Proceedings of the 2008 IEEE 24th international conference on data engineering (ICDE \u201908). IEEE Computer Society, pp 735\u2013743","DOI":"10.1109\/ICDE.2008.4497482"},{"key":"699_CR30","doi-asserted-by":"crossref","unstructured":"Jiang W, Samanthula BK (Feb 2011) N-gram based secure similar document detection. Technical Report TR 2011-01, Department of Computer Science, Missouri S & T, Rolla, Missouri. http:\/\/web.mst.edu\/~wjiang\/ngram-ssdd-tech.pdf","DOI":"10.1007\/978-3-642-22348-8_19"},{"key":"699_CR31","doi-asserted-by":"crossref","DOI":"10.1201\/9781420010756","volume-title":"Introduction to modern cryptography","author":"J Katz","year":"2007","unstructured":"Katz J, Lindell Y (2007) Introduction to modern cryptography. CRC Press, Boca Raton"},{"key":"699_CR32","doi-asserted-by":"crossref","unstructured":"Kissner L, Song D (2005) Privacy-preserving set operations. In: Advances in cryptology\u2014CRYPTO 2005, LNCS. Springer, Berlin, pp 241\u2013257","DOI":"10.1007\/11535218_15"},{"key":"699_CR33","doi-asserted-by":"crossref","unstructured":"Kleinberg JM (2007) Challenges in mining social network data: processes, privacy, and paradoxes. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining (KDD \u201907), pp 4\u20135","DOI":"10.1145\/1281192.1281195"},{"key":"699_CR34","unstructured":"Korolova A, Motwani R, Nabar SU, Xu Y (2008) Link privacy in social networks. In: Proceedings of the 17th ACM conference on Information and knowledge management, CIKM \u201908. ACM, pp 289\u2013298"},{"key":"699_CR35","doi-asserted-by":"crossref","unstructured":"Krishnamurthy B, Wills CE (2008) Characterizing privacy in online social networks. In: Proceedings of the first workshop on Online social networks, WOSN \u201908. ACM, pp 37\u201342","DOI":"10.1145\/1397735.1397744"},{"key":"699_CR36","doi-asserted-by":"crossref","unstructured":"Kumar R, Novak J, Tomkins A (2006) Structure and evolution of online social networks. In: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 611\u2013617","DOI":"10.1145\/1150402.1150476"},{"key":"699_CR37","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D Liben-Nowell","year":"2007","unstructured":"Liben-Nowell D, Kleinberg J (2007) The link-prediction problem for social networks. J Am Soc Inf Sci Technol 58:1019\u20131031","journal-title":"J Am Soc Inf Sci Technol"},{"key":"699_CR38","doi-asserted-by":"crossref","unstructured":"Lo S, Lin C (2006) Wmr-a graph-based algorithm for friend recommendation. In: Proceedings of the 2006 IEEE\/WIC\/ACM international conference on Web intelligence (WI \u201906). IEEE Computer Society, pp 121\u2013128","DOI":"10.1109\/WI.2006.202"},{"key":"699_CR39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1961209.1961212","volume":"29","author":"H Ma","year":"2011","unstructured":"Ma H, Zhou TC, Lyu MR, King I (2011) Improving recommender systems by incorporating social contextual information. ACM Trans Inf Syst 29:1\u201323","journal-title":"ACM Trans Inf Syst"},{"key":"699_CR40","doi-asserted-by":"crossref","first-page":"440","DOI":"10.14778\/1988776.1988780","volume":"4","author":"A Machanavajjhala","year":"2011","unstructured":"Machanavajjhala A, Korolova A, Sarma AD (2011) Personalized social recommendations: accurate or private. Proc VLDB Endow 4:440\u2013450","journal-title":"Proc VLDB Endow"},{"key":"699_CR41","doi-asserted-by":"crossref","unstructured":"Mislove A, Marcon M, Gummadi KP, Druschel P, Bhattacharjee B (2007) Measurement and analysis of online social networks. In: Proceedings of the 7th ACM SIGCOMM conference on Internet measurement, pp 29\u201342","DOI":"10.1145\/1298306.1298311"},{"key":"699_CR42","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/s00778-009-0175-9","volume":"19","author":"M Murugesan","year":"2010","unstructured":"Murugesan M, Jiang W, Clifton C, Si L, Vaidya J (2010) Efficient privacy-preserving similar document detection. VLDB J 19:457\u2013475","journal-title":"VLDB J"},{"key":"699_CR43","doi-asserted-by":"crossref","unstructured":"Naruchitparames J, Giine MH, Louis SJ (2011) Friend recommendations in social networks using genetic algorithms and network topology. In: IEEE congress on evolutionary computation (CEC), pp 2207\u20132214","DOI":"10.1109\/CEC.2011.5949888"},{"key":"699_CR44","unstructured":"Official. Facebook blog: http:\/\/blog.facebook.com\/blog.php?post=15610312130"},{"key":"699_CR45","doi-asserted-by":"crossref","unstructured":"Paillier P (1999) Public-key cryptosystems based on composite degree residuosity classes. In: Proceedings of the 17th international conference on theory and application of cryptographic techniques. Springer, Berlin","DOI":"10.1007\/3-540-48910-X_16"},{"key":"699_CR46","doi-asserted-by":"crossref","unstructured":"Samanthula BK, Jiang W (August 2012) Structural and message based private friend recommendation. In: Proceedings of IEEE international conference on advances in social networks analysis and mining","DOI":"10.1109\/ASONAM.2012.114"},{"key":"699_CR47","doi-asserted-by":"crossref","unstructured":"Silva NB, Tsang IR, Cavalcanti GDC, Tsang IJ (July 2010) A graph-based friend recommendation system using genetic algorithm. In: IEEE congress on evolutionary computation (CEC), pp 1\u20137","DOI":"10.1109\/CEC.2010.5586144"},{"key":"699_CR48","doi-asserted-by":"crossref","unstructured":"Suchanek FM, Vojnovic M, Gunawardena D (2008) Social tags: meaning and suggestions. In: Proceedings of the 17th ACM conference on Information and knowledge management, CIKM \u201908. ACM, pp 223\u2013232","DOI":"10.1145\/1458082.1458114"},{"key":"699_CR49","doi-asserted-by":"crossref","unstructured":"Thomas K, Grier C, Nicol DM (2010) unfriendly: multi-party privacy risks in social networks. In: Proceedings of the 10th international conference on Privacy enhancing technologies. Springer, Berlin, pp 236\u2013252","DOI":"10.1007\/978-3-642-14527-8_14"},{"key":"699_CR50","doi-asserted-by":"crossref","unstructured":"Vaidya J, Clifton C (Aug 24\u201327 2003) Privacy-preserving $$k$$ k -means clustering over vertically partitioned data. In: The ninth ACM SIGKDD international conference on knowledge discovery and data mining, Washington, DC, pp 206\u2013215","DOI":"10.1145\/956750.956776"},{"key":"699_CR51","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social network analysis: methods and applications","author":"S Wasserman","year":"1994","unstructured":"Wasserman S, Faust K (1994) Social network analysis: methods and applications. Cambridge University Press, Cambridge"},{"key":"699_CR52","doi-asserted-by":"crossref","unstructured":"Xie X (2010) Potential friend recommendation in online social network. In: IEEE\/ACM Int\u2019l Conference on cyber, physical and social computing and international conference on green computing and communications, pp 831\u2013835","DOI":"10.1109\/GreenCom-CPSCom.2010.28"},{"key":"699_CR53","doi-asserted-by":"crossref","unstructured":"Yang Y, Lutes J, Li F, Luo B, Liu P (2012) Stalking online: on user privacy in social networks. In: Proceedings of the second ACM conference on data and application security and privacy (CODASPY \u201912). ACM, pp 37\u201348","DOI":"10.1145\/2133601.2133607"},{"key":"699_CR54","doi-asserted-by":"crossref","unstructured":"Yao AC (1982) Protocols for secure computation. In: Proceedings of the 23rd IEEE symposium on foundations of computer science. IEEE, pp 160\u2013164","DOI":"10.1109\/SFCS.1982.38"},{"key":"699_CR55","doi-asserted-by":"crossref","unstructured":"Yao AC (1986) How to generate and exchange secrets. In: Proceedings of the 27th IEEE symposium on foundations of computer science. IEEE, pp 162\u2013167","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-013-0699-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-013-0699-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-013-0699-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T20:01:22Z","timestamp":1564516882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-013-0699-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,15]]},"references-count":55,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["699"],"URL":"https:\/\/doi.org\/10.1007\/s10115-013-0699-6","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,15]]}}}