Skip to main content
Log in

Analysis of key management protocols for social networks

  • Original Article
  • Published:
Social Network Analysis and Mining Aims and scope Submit manuscript

Abstract

Key management protocols play a major role in achieving data privacy in social networks because of the frequent addition and removal of users. Considering this, a remote storage service-key management protocol (RSS-KMP) is proposed in this paper and analysed the performance with respect to client addition and removal. RSS-KMP uses two keys, group key and content encryption/decryption key. Content decryption key will be encrypted using the group key and kept in social network service provider’s storage. Group key will be distributed to the clients or stored in the social network service provider storage securely. Each client gets or receives the group key to get the data decryption key further to decrypt data. To achieve re-key distribution efficiency, clients are grouped according to their nature of relationship and relationship trust levels. This paper also categorizes the social network items into sensitive and non-sensitive to give an idea to clients about items privacy requirement. Finally, paper analysed existing key management protocols and the proposed RSS-KMP with respect to storage, message and encryption to show the proposed protocol efficiency.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16

Similar content being viewed by others

References

  • Berg D, Leenes R (2010) Audience segregation in social network sites. In: Proceedings of IEEE international conference on social computing/IEEE international conference on privacy. Security. Risk and Trust, pp 1111–1116

  • Canetti R, Garay JA, Itkis G, Micciancio D, Naor M, Pinkas B (1999) Multicast security: a taxonomy and some efficient constructions. In: Proceedings of eighteenth annual joint conference of the IEEE computer and communications societies (INFOCOM’99). vol 2. pp 708–716

  • Challal Y, Seba H (2006) Group key management protocols: a novel taxonomy. Int J Inf Technol 2(2):105–118

    Google Scholar 

  • Challal Y, Bettahar H, Bouabdallah A (2004) SAKM: a scalable and adaptive key management approach for multicast communications. In: Proceedings of ACM SIGCOMM Computer Communications Review. vol 34(2), pp 55–70

  • Ciriani V, De Capitani di Vimercati S, Foresti S, Jajodia S, Paraboschi S, Samarati P (2009) Fragmentation design for efficient query execution over sensitive distributed databases. In: Proceedings of 29th IEEE international conference on distributed computing systems, pp 32–39

  • Ciriani V, De Capitani di Vimercati S, Foresti S, Jajodia S, Paraboschi S, Samarati P (2010) Combining fragmentation and encryption to protect privacy in data storage. ACM Trans Inf Syst Secur 13(3):1–30

    Article  Google Scholar 

  • Data Protection Act (1998) http://www.ico.gov.uk/for_organisations/data_protection/the_guide/key_definitions.aspx. Last accessed on 1st Nov 2014]

  • Di Vimercati SDC, Foresti S, Jajodia S, Paraboschi S, Samarati P (2010) Fragments and loose associations: respecting privacy in data publishing. Proc VLDB Endow 3(1–2):1370–1381

    Article  Google Scholar 

  • Eskeland S, Oleshchuk V (2010) Secure group communication using fractional public keys. In: Proceedings of the international conference on availability, reliability, and security (ARES ‘10), pp 254–257

  • Fiat A, Naor M (1993) Broadcast encryption. In: Proceedings of the 13th annual international cryptology conference on Advances in cryptology (CRYPTO ‘93), pp 480–491

  • Gentry C, Waters B (2009) Adaptive security in broadcast encryption systems (with short ciphertexts). In: Proceedings of the 28th annual international conference on advances in cryptology: the theory and applications of cryptographic techniques In (EUROCRYPT’09). pp 171–188

  • Goffman E (1959) The presentation of self in everyday life Doubleday. Doubleday Anchor Books. Doubleday and Company. Inc. Garden City, pp 1–12

  • Günther F, Manulis M, Strufe T (2011) Key management in Distributed Online Social Networks. In: Proceedings of 2011 IEEE international symposium on world of wireless, mobile and multimedia networks (WoWMoM), pp 1–7

  • Harney and Muckenhirn C (1997) Group key management protocol (GKMP) specification. RFC 2093

  • Harney and Muckenhirn C (1997) Group key management protocol (GKMP) architecture. RFC 2094

  • Mittra S (1997) Iolus: a framework for scalable secure multicasting. In: Proceedings of the ACM SIGCOMM ‘97 conference on applications, technologies, architectures, and protocols for computer communication. vol. 27(issue 4), pp 277–288

  • Itani W, Kayssi A, Chehab A (2009) Privacy as a service: privacy—aware data storage and processing in cloud computing architectures. In: Proceedings of 2009 eighth IEEE international conference on dependable autonomic and secure computing, pp 711–716

  • Jung Y, Nam Y, Kim J, Jeon W, Lee H, Won D (2014) Key management scheme using dynamic identity-based broadcast encryption for social network services. Adv Comput Sci Appl Lect Notes Electr Eng 279:435–443

    Google Scholar 

  • Kanagasingham P (2008) Data loss prevention. SANS Institute Infosec Reading Room. pp 1–38

  • Kim Y, Perrig A, Tsudik G (2000) Simple and fault-tolerant key agreement for dynamic collaborative groups. In: Proceedings of the 7th ACM conference on Computer and communications security (ACM CCS 2000), pp. 235–244

  • Liu K, Terzi E (2009) A framework for computing the privacy scores of users in online social networks. ACM Trans Knowl Discov Data 5(1):6:1–6:30 (Article 6)

  • McAfee (2013) Identify sensitive data and prevent data leaks, TITUS Document Classification v3.3 and McAfee Data Loss Prevention 9. McAfee Compatible Solution. http://www.mcafee.com/us/resources/solution-briefs/sb-titus.pdf. Last accessed on 16 Jan 2013

  • Shamir A (1979) How to share a secret. Commun ACM (Mag) 22(11):612–613

    Article  MathSciNet  MATH  Google Scholar 

  • Sherman AT, McGrew DA (2003) Key establishment in large dynamic groups using one-way function trees. IEEE Trans Softw Eng 29(5):444–458

    Article  Google Scholar 

  • Sun J, Zhu X, Fang Y (2010) A privacy-preserving scheme for online social networks with efficient revocation. Proc IEEE INFOCOM 1–9

  • Yüksel S, Yüksel ME, Zaim AH (2010) An approach for protecting privacy on social networks. In: Proceedings of 2010 fifth international conference on systems and networks communications, pp 154–159

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to S. Venkatesan.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Venkatesan, S., Oleshchuk, V.A., Chellappan, C. et al. Analysis of key management protocols for social networks. Soc. Netw. Anal. Min. 6, 3 (2016). https://doi.org/10.1007/s13278-015-0310-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s13278-015-0310-0

Keywords

Navigation