<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>Feb</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Modeling Social Networking Privacy</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Carolina Dania?</string-name>
          <email>carolina.dania@imdea.org</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>IMDEA Software Institute</institution>
          ,
          <addr-line>Madrid</addr-line>
          ,
          <country country="ES">Spain</country>
          <addr-line>Universidad Complutense de Madrid</addr-line>
          ,
          <country country="ES">Spain</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2012</year>
      </pub-date>
      <volume>15</volume>
      <issue>2012</issue>
      <abstract>
        <p>Privacy-related issues are becoming a serious concern among users of social networks. There are at least three reasons that justify this growing concern: social networking privacy policies are hardly trivial; they live in a constant state of ux; and they are only informally and partially described by the social networking sites. To improve this current state of a airs, we propose SecureUML as a formal language to model social networking privacy, and we set ourselves the goal of modeling, as a case study, Facebook privacy policy. Based on our formal model, we envision a new generation of tools that will provide Facebook users with more information about the privacy of their posts and about the associated privacy-related risks.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Motivation</title>
      <p>
        Many people in our society rightly consider themselves as \internet natives":
when they need information, they naturally open a browser and search for it;
when they want to share information, they naturally post it on a social network.
A few gures about Facebook, the leader among social networking sites,
exemplify our point: Facebook has more than 800 million users, of which, about 50%
log on to their accounts every day; more to the point, Facebook users upload,
on average, 250 million photos per day [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <p>
        Not surprisingly, privacy-related issues are a growing concern among users
of social networking sites [
        <xref ref-type="bibr" rid="ref1 ref14 ref15 ref7">7, 1, 14, 15</xref>
        ] and, consequently, among their
developers. Last November, Facebook's founder and CEO, Mark Zuckerberg, wrote in
his blog [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] \I also understand that many people are just naturally skeptical
of what it means for hundreds of millions of people to share so much personal
information online, especially using any one service. Even if our record on
privacy were perfect, I think many people would still rightfully question how their
information was protected." Then, recognizing an increasing criticism over
Facebook privacy policy, Zuckerberg announced: \we're making a clear and formal
long-term commitment to do the things we've always tried to do and planned to
keeping doing |giving you tools to control who can see your information and
then making sure only those people you intend can see it."
      </p>
      <p>To Facebook's credit, over the past 2 years, its users have been equipped
with new tools and resources which are designed to give them more control over
? This work has been partially supported by the EU-NoE project NESSoS, 256980.
their Facebook experience, including: an easier way to select your audience when
making a new post; inline privacy control on all your existing posts; the ability
to review tags made by others before they appear on your pro le; a tool to view
your pro le as someone else would see it; many more privacy education resources.</p>
      <p>
        Despite all these e orts, many users are still concerned about how to
maintain their privacy or |in Zuckerberg's words| \rightfully questions how their
information was protected". There are at least three reasons for this:
{ The Facebook privacy policy is hardly trivial to understand: for example,
when tagging policies and privacy settings con ict to each other.
{ The Facebook privacy policy has been in a constant state of ux over the
past few years [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], and it is prompted to change again in the near future.
{ The Facebook privacy policy is only informally and partially described in a
collection of \privacy education resources", which cannot provide a coherent
and complete account of the policy.
      </p>
      <p>
        As a consequence, even advanced Facebook users may nd di cult to
understand, for example, the actual visibility of a post. To illustrate our point, recall
the tagging policy explained in [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]:
\When I tag someone in a photo or post, who can see it? When you tag
someone, it may be visible to: 1. The audience you selected for your post.
2. Friends of the person you tagged (if the audience is set to \Friends"
or more). (...) When someone adds a tag to a photo or post I shared,
who can see it? When someone adds a tag to something you shared, it's
visible to: 1. The audience you chose for the post or photo. 2. The person
tagged in the post, and their friends (if the audience is set to \Friends"
or more)."
Now, suppose that Bob, Alice, Ted, and Peter have Facebook pro les: Bob is
friend of Alice and Ted; Ted is friend of Peter; Ted is not a friend of Alice; and
Peter is not friend of Alice or Bob. Assume also that Alice has set to \Friends"
the default audience for posts of friends in her wall. Consider the following
scenarios:
Scenario #1 Alice posts a photo of herself, Bob and Ted in her wall, and set
its audience to \Friends". Then, Bob tags Ted in this photo. Question: Can
Peter see this photo in Alice's wall? (The answer is Yes.).
      </p>
      <p>Scenario #2 Bob posts a photo of himself, Ted and Alice in Alice's wall. Then,
Bob tags Ted in this photo Question: Can Peter see this photo in Alice's
wall? (The answer is No. Why?).
2</p>
    </sec>
    <sec id="sec-2">
      <title>Research Project</title>
      <p>Objectives. We set ourselves two goals: rst, to provide a formal account of
the Facebook privacy policy (as complete as possible); and second, to design
methods (based on this formal account) for reasoning about sharing and privacy
in Facebook.</p>
      <p>Potential impact. We envision at least three new Facebook privacy tools that can
use our results as a solid, rigorous foundation: rst, a tool for checking whether
a person can see a post (currently, this tool is only available for the owner of
the wall where the post is posted, but not for the creator of the post); second,
a tool for assessing the risk of a post becoming visible for a person; and third,
a tool for assessing the impact, on the visibility of a post, of a default privacy
policy change. We also expect our methodology to be applicable to other social
networking site, like Google+, opening the path for a formal comparison between
privacy policies of di erent social networking sites.</p>
      <p>Context. This project is being conducted at IMDEA Software (http://software.
imdea.org) Modeling Lab, under the co-supervision of Manuel Clavel and
Marina Egea. Manuel Clavel is Associate Researcher at IMDEA Software and
Professor at Universidad Complutense de Madrid. Dr. Marina Egea is Consultant &amp;
Research Project Manager at Atos S.A., Spain. We are developing this research
within the European Network of Excellence for Engineering Secure Software and
Systems.</p>
      <p>
        Methodology. As discussed in [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], when modeling social networking privacy it is
crucial to use a language able to formalize ne-grained access control policies: in
other words, a role-based access control language, as proposed in [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], will only do
part of the job. There are di erents options for this, but not so many when having
a formal semantics becomes a hard requirement. For example, XACML [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ],
which can be considered the standard choice for describing privacy policies,
lacks of a formal semantics.
      </p>
      <p>
        To provide a formal account of the Facebook privacy policy, we use
SecureUML [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. SecureUML is a formal language for modeling role-based access
control. It provides a rich language for expressing both static and dynamic access
control policies, the latter being policies that depend on the run-time satisfaction
of authorization constraints. Based on our preliminary results, we believe that
SecureUML is up for the task we have set to ourselves for the following reasons:
1. Facebook ultimately decides about the visibility of a post based on the
settings chosen by the owner of the wall and on the relationships (if any) that
link the visitor of the wall, the owner of the wall, the creator of the post, and
the creators and targets of the tags (if any) added to the post. Interestingly,
when only real users are considered (i.e., no Facebook-enhanced games,
applications, websites, or advertisers) the purpose of the visitor (and, similarly,
for the creator of the post or of the tags) play no role in Facebook decisions;
neither assigns the Facebook privacy policy any obligation to the visitor.
2. Facebook's pro les, walls, posts, photos, tags, and so on, can be naturally
modeled in SecureUML as entities, with the expected relationships between
them: the owner of a wall, the creator of a post, the wall where a post is
posted, the post where a tag is added, and so on. In particular, privacy
settings can be modeled as attributes of the entities `pro le' and `post' while
the relationship of friendship can be modeled as a self-association of the
entity `pro le'.
3. Facebook's policy constraints (like `a user can read a post if he or she is
a friend of the owner of the wall where the post is posted') are naturally
modeled in SecureUML using OCL [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. OCL is a strongly typed, declarative
language, speci cally designed for querying scenarios consisting of entities
(with attributes) and associations between them. In particular, using OCL,
we can (the list is by no means exhaustive):
{ refer to the value, in a data element, of any of the attributes speci ed in
the data model.
{ refer to all the data elements which are linked to a data element through
any of the associations speci ed in the data model.
{ perform standard operations on booleans (negation, conjunction,
disjunction, implication, etc.).
{ perform equalities/inequalites between (collection of) data elements of
the same type.
{ perform standard operations on collections (union, intersection,
emptiness, inclusion, exclusion, insertion, deletion, etc.).
      </p>
      <p>To illustrate our methodology, we show in Figure 1 a basic data model that
(partially) represents Facebook posts and tags. Using the entities, attributes,
and associations contained in this data model, we show in Figure 2 how the
following clauses |about when a visitor (@caller) can read a post (@post)| are
formalized in OCL:
{ anybody can read any post that is posted in his or her wall, independently
of its creator.
{ anybody can read any post that is posted in a wall when he or she is a friend
of the owner of the wall and the audience selected is `Friends'.
)) or ...
{ anybody can ready any post that is posted in a wall when the audience
selected is `Public', unless he or she is blocked by the owner of the wall.
{ anybody can read any post that is posted in a wall when he or she is tagged in
this post, independently of the audience selected, unless he or she is blocked
by the owner of the wall.
{ anybody can read any post that is posted in a wall, when the audience
selected is `Friends', he or she is a friend of somebody tagged on the post,
he or she is not blocked by the owner of the wall, and the owner of the post
happens to be the creator of the post.</p>
      <p>
        On the other hand, with respect to our second goal (namely, reasoning),
SecureUML has a well-de ned semantics that supports the formal analysis of its
models. In particular, for a certain type of analysis, we can automatically analyze
SecureUML models using the metamodel-based approach described in [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. For
more general analysis, we can use theorem-proving tools (including SMT solvers),
thanks to the mapping from OCL to rst-order logic introduced in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Research Plan</title>
      <p>
        Our rst task is to gather as much information as possible about the Facebook
privacy policy. We would like to assume that the information available at [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]
is correct and complete. Unfortunately, our initial results show that this is not
always the case. Our second task is then to design \experiments" on precooked
Facebook scenarios for testing that our understanding of the Facebook privacy
policy corresponds to reality. Eventually, these \experiments" should also help us
to monitor and report changes in the Facebook privacy policy. We will also look
very closely at the results of the thorough and detailed audit [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] of Facebook's
practices and policies by the O ce of the Irish Data Protection Commissioner.
      </p>
      <p>According to the gathered information, we will decide how to proceed. We
envision separated tasks for modeling each of the basic actions on Facebook:
select audience, switch reviews on/o , read a post, write a post, remove a post,
add a tag, remove a tag, approve a tag, add a friend, remove a friend, block a
user, and so on. For each of these actions, we plan to model also their pre- and
post-conditions using OCL. We are aware that we may have to exclude from our
project the privacy policies that apply to advertisers and/or so-called
Facebookenhanced games, applications, and websites, unless we obtain this information
directly from the company. Finally, we plan to design methods (based on the
di erent types of analysis for SecureUML models that we mentioned before) for
reasoning about sharing and privacy in Facebook (e.g., audience evaluation, risk
and change impact assessment), although the actual implementation of these
methods may have to be carried out in other research projects.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>A.</given-names>
            <surname>Acquisti</surname>
          </string-name>
          and
          <string-name>
            <given-names>R.</given-names>
            <surname>Gross</surname>
          </string-name>
          . Imagined Communities: Awareness,
          <string-name>
            <given-names>Information</given-names>
            <surname>Sharing</surname>
          </string-name>
          , and
          <article-title>Privacy on the Facebook</article-title>
          . In G. Danezis and P. Golle, editors,
          <source>Privacy Enhancing Technologies</source>
          , volume
          <volume>4258</volume>
          <source>of LNCS</source>
          , pages
          <volume>36</volume>
          {
          <fpage>58</fpage>
          . Springer,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>D.</given-names>
            <surname>Basin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Clavel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Doser</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Egea</surname>
          </string-name>
          .
          <source>Automated analysis of security-design models. Information and Software Technology</source>
          ,
          <volume>51</volume>
          (
          <issue>5</issue>
          ):
          <volume>815</volume>
          {
          <fpage>831</fpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>D.</given-names>
            <surname>Basin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Doser</surname>
          </string-name>
          , and
          <string-name>
            <given-names>T.</given-names>
            <surname>Lodderstedt</surname>
          </string-name>
          .
          <article-title>Model driven security: From UML models to access control infrastructures</article-title>
          .
          <source>ACM TOSEM</source>
          ,
          <volume>15</volume>
          (
          <issue>1</issue>
          ):
          <volume>39</volume>
          {
          <fpage>91</fpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>M.</given-names>
            <surname>Clavel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Egea</surname>
          </string-name>
          , and
          <string-name>
            <surname>M. A. G. de Dios</surname>
          </string-name>
          .
          <article-title>Checking unsatis ability for OCL constraints</article-title>
          .
          <source>Electronic Communications of the EASST</source>
          ,
          <volume>24</volume>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>5. Facebook. http://www.facebook.com/press/info.php?statistics.</mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Facebook</surname>
          </string-name>
          . Facebook Help Center. http://www.facebook.com/help.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>R.</given-names>
            <surname>Gross</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Acquisti</surname>
          </string-name>
          , and
          <string-name>
            <given-names>H. J.</given-names>
            <surname>Heinz</surname>
          </string-name>
          .
          <article-title>Information Rvelation and Privacy in Online Social Networks</article-title>
          . In V. Atluri, S. D. C. di
          <string-name>
            <surname>Vimercati</surname>
          </string-name>
          , and R. Dingledine, editors,
          <source>WPES</source>
          , pages
          <volume>71</volume>
          {
          <fpage>80</fpage>
          . ACM,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>Irish</given-names>
            <surname>Data Protection Commissioner</surname>
          </string-name>
          .
          <source>Facebook Ireland Ltd. Report of Audit</source>
          ,
          <year>December 2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Mao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Lai</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhu</surname>
          </string-name>
          .
          <article-title>Role based access control for social network sites</article-title>
          .
          <source>In Pervasive Computing (JCPC)</source>
          ,
          <source>2009 Joint Conferences on</source>
          , pages
          <volume>389</volume>
          {394, dec.
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10. OASIS.
          <source>eXtensible Access Control Markup Language (XACML)</source>
          ,
          <year>2010</year>
          . http: //docs.oasis-open.
          <source>org/xacml/3</source>
          .0/xacml-3.0
          <article-title>-core-spec-cs-01-en</article-title>
          .pdf.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11. Object Management Group.
          <source>Object Constraint Language speci cation Version 2</source>
          .2,
          <string-name>
            <surname>Feb</surname>
          </string-name>
          .
          <year>2010</year>
          . OMG document available at http://www.omg.org/spec/OCL/2.2.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>N. O'Neill.</surname>
          </string-name>
          <article-title>Infographic: The History of Facebooks Default Privacy Settings</article-title>
          . http: //www.allfacebook.com/.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <given-names>A.</given-names>
            <surname>Simpson</surname>
          </string-name>
          .
          <article-title>On the Need for User-De ned Fine-Grained Access Control Policies for Social Networking Applications</article-title>
          .
          <source>In Proceedings of the workshop on SOSOC</source>
          , pages
          <volume>1</volume>
          :
          <issue>1</issue>
          {
          <issue>1</issue>
          :
          <fpage>8</fpage>
          , New York, NY, USA,
          <year>2008</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <given-names>A.</given-names>
            <surname>Young</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Quan-Haase</surname>
          </string-name>
          .
          <article-title>Information Revelation and Internet Privacy Concerns on Social Network Sites: A Case Study of Facebook</article-title>
          .
          <source>In Proceedings of the international conference on C&amp;T</source>
          , pages
          <volume>265</volume>
          {
          <fpage>274</fpage>
          , New York, NY, USA,
          <year>2009</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <given-names>E.</given-names>
            <surname>Zheleva</surname>
          </string-name>
          and
          <string-name>
            <given-names>L.</given-names>
            <surname>Getoor</surname>
          </string-name>
          .
          <article-title>To join or not to join: the illusion of privacy in social networks with mixed public and private user pro les</article-title>
          . In J. Quemada, G. Leon,
          <string-name>
            <given-names>Y. S.</given-names>
            <surname>Maarek</surname>
          </string-name>
          , and W. Nejdl, editors,
          <source>WWW</source>
          , pages
          <volume>531</volume>
          {
          <fpage>540</fpage>
          . ACM,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <given-names>M.</given-names>
            <surname>Zuckerberg</surname>
          </string-name>
          .
          <article-title>Our Commitment to the Facebook Community</article-title>
          .
          <source>The Facebook Blog, Nov</source>
          .
          <year>2011</year>
          . https://blog.facebook.com.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>