Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Knowledge and Information Systems
Published in: Knowledge and Information Systems 3/2015

01-03-2015 | Regular Paper

Interest-driven private friend recommendation

Authors: Bharath K. Samanthula, Wei Jiang

Published in: Knowledge and Information Systems | Issue 3/2015

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

The emerging growth of online social networks has opened new doors for various kinds of applications such as business intelligence and expanding social connections through friend recommendations. In particular, friend recommendation facilitates users to explore new friendships based on social network structures, user profile information (similar interest) or both. However, as the privacy concerns of users are on the rise, searching for new friends is not a straightforward task under the assumption that users’ information is kept private. Along this direction, this paper proposes two private friend recommendation algorithms based on the social network structure and the users’ social tags. The first protocol is more efficient from a user’s perspective compared to the second protocol, and this efficiency gain comes at the expense of relaxing the underlying privacy assumptions. On the other hand, the second protocol provides the best security guarantee. In addition, we empirically analyze the complexities of the proposed protocols and provide various experimental results.
previous article Extended symbolic approximate reasoning based on linguistic modifiers
next article A modified gravitational search algorithm based on sequential quadratic programming and chaotic map for ELD optimization

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now
Footnotes
1
More specifically, the Euclidean length/norm of \(v_i\) and \(v_j\) are given as \(||v_i|| = \sqrt{\sum _{k=1}^{n} v_{i}[k]^2}\) and \(||v_j|| = \sqrt{\sum _{k=1}^{n} v_{j}[k]^2}\).
 
2
To make the presentation clear we simply omit the \(\hbox { mod } N^2\) operation in the expansion of Eq. 5. However, we emphasize that this does not affect our derived results.
 
Literature
1.
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–499
2.
Ben-David A, Nisan N, Pinkas B (October 2008) Fairplaymp—a system for secure multi-party computation. In: Proceedings of the ACM computer and communications security conference (ACM CCS)
3.
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–22:37CrossRef
4.
Boyd D, Ellison NB (2008) Social network sites: definition, history, and scholarship. J Comput-Mediat Commun 13(1):210–230CrossRef
5.
6.
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–210
7.
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–5
8.
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’ 11), pp 709–714
9.
Delgado J, Rodríguez E, Llorente S (2010) User’s privacy in applications provided through social networks. In: Proceedings of second ACM SIGMM workshop on Social media (WSM ’10), pp 39–44
10.
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–352
11.
Dong W, Dave V, Qiu L, Zhang Y (April 2011) Secure friend discovery in mobile social networks. In: Proceedings IEEE INFOCOM, pp 1647–1655
12.
Dwork C (2006) Differential privacy. In: ICALP, pp 1–12
13.
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)
14.
Ehrlich DM (2006) Social network survey paper. Int J Learn Intellect Cap 3(2):167–177
15.
Freedman MJ, Nissim K, Pinkas B, Efficient private matching and set intersection. In: Eurocrypt 2004, Interlaken, Switzerland, May 2–6 2004. International Association for Cryptologic Research (IACR)
16.
Gao H, Hu J, Huang T, Wang J, Chen Y (2011) Security issues in online social networks. IEEE Internet Comput 15(4):56–63CrossRef
17.
Goethals B, Laur S, Lipmaa H, Mielikainen T (Dec 2–3 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–120, Seoul, Korea
18.
Goldreich O (2004) The foundations of cryptography, vol 2, chapter general cryptographic protocols. Cambridge University Press, Cambridge
19.
Goldreich O (2004) The foundations of cryptography, vol 2, chapter encryption schemes. Cambridge University Press, Cambridge
20.
Goldreich O, Micali S, Wigderson A (1987) How to play any mental game—a completeness theorem for protocols with honest majority. In: 19th ACM symposium on the theory of computing, New York, NY, USA, pp 218–229
21.
22.
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—international symposium, VINCI ’11. ACM, pp 1–10
23.
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 ’10. ACM, pp 18:1–9
24.
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 ’05, pp 71–80
25.
He J, Chu WW (2010) A social network-based recommender system (snrs). Annu Inf Syst 12:47–74; (Special issue on Data Mining for Social Network Data)
26.
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’10. ACM, pp 61–64
27.
Jiang W, Clifton C (Apr 26–28 2007) AC-framework for privacy-preserving collaboration. In: SIAM international conference on data mining, Minneapolis, MN
28.
Jiang W, Clifton C, Kantarcioglu M (2008) Transforming semi-honest protocols to ensure accountability. Data Knowl Eng 65(1):57–74
29.
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 ’08). IEEE Computer Society, pp 735–743
30.
31.
Katz J, Lindell Y (2007) Introduction to modern cryptography. CRC Press, Boca Raton
32.
Kissner L, Song D (2005) Privacy-preserving set operations. In: Advances in cryptology—CRYPTO 2005, LNCS. Springer, Berlin, pp 241–257
33.
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 ’07), pp 4–5
34.
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 ’08. ACM, pp 289–298
35.
Krishnamurthy B, Wills CE (2008) Characterizing privacy in online social networks. In: Proceedings of the first workshop on Online social networks, WOSN ’08. ACM, pp 37–42
36.
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–617
37.
Liben-Nowell D, Kleinberg J (2007) The link-prediction problem for social networks. J Am Soc Inf Sci Technol 58:1019–1031CrossRef
38.
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 ’06). IEEE Computer Society, pp 121–128
39.
Ma H, Zhou TC, Lyu MR, King I (2011) Improving recommender systems by incorporating social contextual information. ACM Trans Inf Syst 29:1–23CrossRef
40.
Machanavajjhala A, Korolova A, Sarma AD (2011) Personalized social recommendations: accurate or private. Proc VLDB Endow 4:440–450CrossRef
41.
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–42
42.
Murugesan M, Jiang W, Clifton C, Si L, Vaidya J (2010) Efficient privacy-preserving similar document detection. VLDB J 19:457–475CrossRef
43.
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–2214
44.
45.
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
46.
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
47.
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–7
48.
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 ’08. ACM, pp 223–232
49.
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–252
50.
Vaidya J, Clifton C (Aug 24–27 2003) Privacy-preserving \(k\)-means clustering over vertically partitioned data. In: The ninth ACM SIGKDD international conference on knowledge discovery and data mining, Washington, DC, pp 206–215
51.
Wasserman S, Faust K (1994) Social network analysis: methods and applications. Cambridge University Press, CambridgeCrossRef
52.
Xie X (2010) Potential friend recommendation in online social network. In: IEEE/ACM Int’l Conference on cyber, physical and social computing and international conference on green computing and communications, pp 831–835
53.
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 ’12). ACM, pp 37–48
54.
Yao AC (1982) Protocols for secure computation. In: Proceedings of the 23rd IEEE symposium on foundations of computer science. IEEE, pp 160–164
55.
Yao AC (1986) How to generate and exchange secrets. In: Proceedings of the 27th IEEE symposium on foundations of computer science. IEEE, pp 162–167
Metadata
Title
Interest-driven private friend recommendation
Authors
Bharath K. Samanthula
Wei Jiang
Publication date
01-03-2015
Publisher
Springer London
Published in
Knowledge and Information Systems / Issue 3/2015
Print ISSN: 0219-1377
Electronic ISSN: 0219-3116
DOI
https://doi.org/10.1007/s10115-013-0699-6

Other articles of this Issue 3/2015

Knowledge and Information Systems 3/2015 Go to the issue

Regular Paper

Privacy-preserving LOF outlier detection

Regular Paper

Joint Schatten -norm and -norm robust matrix completion for missing value recovery

Regular Paper

Extended symbolic approximate reasoning based on linguistic modifiers

Regular Paper

Novel harmony search-based algorithms for part-of-speech tagging

Regular Paper

A modified gravitational search algorithm based on sequential quadratic programming and chaotic map for ELD optimization

Regular Paper

Shared-memory and shared-nothing stochastic gradient descent algorithms for matrix completion

Premium Partner

    Image Credits