Browse > Article
http://dx.doi.org/10.13089/JKIISC.2012.22.3.505

Efficient Hop-based Access Control for Private Social Networks  

Jung, Sang-Im (Graduate School of Information Security, Korea University)
Kim, Dong-Min (Graduate School of Information Security, Korea University)
Jeong, Ik-Rae (Graduate School of Information Security, Korea University)
Publication Information
Journal of the Korea Institute of Information Security & Cryptology / v.22, no.3, 2012 , pp. 505-514 More about this Journal
Abstract
Because people usually establish their online social network based on their offline relationship, the social networks (i.e., the graph of friendship relationships) are often used to share contents. Mobile devices let it easier in these days, but it also increases the privacy risk such as access control of shared data and relationship exposure to untrusted server. To control the access on encrypted data and protect relationship from the server, M. Atallah et al. proposed a hop-based scheme in 2009. Their scheme assumed a distributed environment such as p2p, and each user in it shares encrypted data on their social network. On the other hand, it is very inefficient to keep their relationship private, so we propose an improved scheme. In this paper, among encrypted contents and relationships, some authenticated users can only access the data in distributed way. For this, we adopt 'circular-secure symmetric encryption' first. Proposed scheme guarantees the improved security and efficiency compared to the previous work.
Keywords
Social Network; Access Control; Privacy;
Citations & Related Records
연도 인용수 순위
  • Reference
1 B. Carminati, E. Ferrari, and A. Perego, "Rule-based access control for social networks," On the Move to Meaningful Internet System, LNCS 4278, pp. 1734-1744, 2006.
2 B. Carminati, E. Ferrari, and A. Perego, "Private relationships in social networks," Proceedings of IEEE International Conference on Data Engineering Workshop, pp. 163-171, Apr. 2007.
3 B. Carminati and E. Ferrari, "Privacy-aware collaborative access control in web-based social networks," Data and Applications Security X XII, LNCS 5094, pp. 81-96, 2008.
4 J. Domingo-Ferrer, "A public-key protocol for social networks with private relationships," Modeling Decisions for Artificial Intelligence, LNAI 4617, pp. 373-379, 2007.
5 V. Alexandre, J. Domingo-Ferrer, S. Francesc, and G.N. Ursula, "Privacy homomorphisms for social networks with private relationships," Elsevier, Computer Networks, vol. 52, no. 15, pp. 3007-3016, Oct. 2008.   DOI   ScienceOn
6 K.B. Frikken and P. Srinivas, "Key allocation schemes for private social networks," Proceedings of the 8th ACM Workshop on Privacy in the Electronic Society, pp. 11-20, Nov. 2009.
7 M.J. Atallah, M. Blanton, N. Fazio, and K.B. Frikken, "Dynamic and efficient key management for access hierarchies," ACM Transactions on Information and System Security, vol. 12, no. 3, pp. 18-43, Jan. 2009.
8 B. Applebaum, D. Cash, C. Peikert, and A. Sahai, "Fast cryptographic primitives and circular-secure encryption based on hard learning problems," Advanced in Cryptology, CRYPTO'09, LNCS 5677, pp. 595-618, 2009.