Please use this identifier to cite or link to this item:
|Title:||Partial social network disclosure and crawlers|
|Citation:||Effendy, S., Halim, F., Yap, R.H.C. (2011). Partial social network disclosure and crawlers. Proceedings - IEEE 9th International Conference on Dependable, Autonomic and Secure Computing, DASC 2011 : 808-815. ScholarBank@NUS Repository. https://doi.org/10.1109/DASC.2011.139|
|Abstract:||The popularity and size of online social networks means the social graph contains valuable data about relationships. Such graph data may be sensitive. Thus, there is a need to protect the data from privacy leaks. On the other hand, public information and crawl ability are needed to support the basic utility and services on top of the social network. We propose policies where the owner of the social network can tradeoff between these two conflicting goals. We experiment with real world social network graphs and show that the owner of the graph can employ policies which can meet particular tradeoffs under different crawlers. Furthermore, the policies are efficient and scalable for the owner of the social network. © 2011 IEEE.|
|Source Title:||Proceedings - IEEE 9th International Conference on Dependable, Autonomic and Secure Computing, DASC 2011|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 10, 2018
checked on Nov 10, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.