An improved algorithm for transitive closure on acyclic digraphs
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Efficient management of transitive relationships in large data and knowledge bases
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Graph theory and its applications
Graph theory and its applications
Fast computing reachability labelings for large graphs with high compression rate
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Inferring privacy policies for social networking services
Proceedings of the 2nd ACM workshop on Security and artificial intelligence
Privacy wizards for social networking sites
Proceedings of the 19th international conference on World wide web
Computing label-constraint reachability in graph databases
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Graph pattern matching: from intractable to polynomial time
Proceedings of the VLDB Endowment
A reachability-based access control model for online social networks
Databases and Social Networks
Rule-Based access control for social networks
OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part II
Social access control language (SocACL)
Proceedings of the 6th International Conference on Security of Information and Networks
| Hi-index | 0.00 |
Nowadays, social networks are attracting more and more users. These social network subscribers may share personal and sensitive information with a large number of possibly unknown other users, which is in constant evolution. This raises the need of giving users more control on the distribution of their shared content which can be accessed by a community far wider than they may expect. Our concern is to devise and enforce an appropriate access control model for online social networks that enables users to specify their privacy preferences in an expressive way, and, scales well over small, as well as, large social graphs (i.e., regardless to the size of the social graph). In this paper, we propose an access control model for online social networks based on connection characteristics between users, in an extended sense that includes indirect connections. This model provides a conditional access to shared resources based on reachability constraints, between the owner and the requester of a piece of information. Then, we describe the work that we have done to scale the access control enforcement performances over large social graphs. This paper describes PhD work carried out at Télécom ParisTech under the guidance of Talel Abdessalem.