DocumentCode :
3128835
Title :
enList: Automatically Simplifying Privacy Policies
Author :
Bejugam, Rajesh ; LeFevre, Kristen
Author_Institution :
Electr. Eng. & Comput. Sci, Univ. of Michigan, Ann Arbor, MI, USA
fYear :
2011
fDate :
11-11 Dec. 2011
Firstpage :
620
Lastpage :
627
Abstract :
Online social networking sites have become extremely popular. Due to the pervasiveness of these sites, it is important to provide tools that allow users to specify detailed policies controlling access to their data. However, the policies specified using existing tools are often complex, verbose, and difficult to understand. In this paper, we study the policy simplification problem. Given a complex or verbose policy, our goal is to automatically produce an equivalent policy that is easier to understand. We propose a novel framework called enList, which automatically extracts friend "lists" (semantically meaningful subgroups of a user\´s friends) and then simplifies an existing policy using the lists. A laboratory-based user study confirms that the resulting policies are easier for users to comprehend, remember, and maintain than the policies produced by an existing recommendation tool.
Keywords :
authorisation; data privacy; recommender systems; social networking (online); access control; enList; laboratory based user study; online social networking sites; policy simplification problem; privacy policies; recommendation tool; Communities; Complexity theory; Educational institutions; Facebook; Partitioning algorithms; Privacy; Algorithms; Privacy; Social network services;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Mining Workshops (ICDMW), 2011 IEEE 11th International Conference on
Conference_Location :
Vancouver, BC
Print_ISBN :
978-1-4673-0005-6
Type :
conf
DOI :
10.1109/ICDMW.2011.74
Filename :
6137438
Link To Document :
بازگشت