Abstract
Users and resources in online social networks (OSNs) are interconnected via various types of relationships. In particular, user-to-user relationships form the basis of the OSN structure, and play a significant role in specifying and enforcing access control. Individual users and the OSN provider should be enabled to specify which access can be granted in terms of existing relationships. In this paper, we propose a novel user-to-user relationship-based access control (UURAC) model for OSN systems that utilizes regular expression notation for such policy specification. Access control policies on users and resources are composed in terms of requested action, multiple relationship types, the starting point of the evaluation, and the number of hops on the path. We present two path checking algorithms to determine whether the required relationship path between users for a given access request exists. We validate the feasibility of our approach by implementing a prototype system and evaluating the performance of these two algorithms.
Original language | English |
---|---|
Article number | 7047733 |
Pages (from-to) | 424-436 |
Number of pages | 13 |
Journal | IEEE Transactions on Dependable and Secure Computing |
Volume | 13 |
Issue number | 4 |
DOIs | |
Publication status | Published - 1 Jul 2016 |
Externally published | Yes |
Keywords
- access control
- policy specification
- security model
- Social network
ASJC Scopus subject areas
- General Computer Science
- Electrical and Electronic Engineering