<!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 />
    <article-meta>
      <title-group>
        <article-title>Personal Privacy and the Web of Linked Data</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>David Corsar</string-name>
          <email>dcorsar@abdn.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Peter Edwards</string-name>
          <email>p.edwards@abdn.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>John Nelson</string-name>
          <email>j.d.nelson@abdn.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>dot.rural Digital Economy Hub, University of Aberdeen</institution>
          ,
          <addr-line>Aberdeen</addr-line>
          ,
          <country country="UK">UK</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper reports the results of a study investigating the user privacy challenges when personal data is published within linked data environments. Motivated by GetThere, a passenger information system that crowdsources transport information from users (including personal data, such as their location), four scenarios are outlined that illustrate how linked data environments can impact upon user privacy. The responsibilities of key stakeholders, including researchers, ethics committees, and the linked data community are also discussed, along with a set of guidelines designed to raise awareness of these risks and how to reduce them.</p>
      </abstract>
      <kwd-group>
        <kwd>Personal privacy</kwd>
        <kwd>semantic web</kwd>
        <kwd>linked data</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>Many applications routinely combine the use of mobile devices and
locationaware services. However, when location information, or any other type of
personal information is made available, even in an anonymised form, there is the
potential for it to be integrated with other data as part of the Web of Linked
Data. Automated agents can then reason about this data, with no guarantee
that such reasoning is privacy preserving.</p>
      <p>As part of the Informed Rural Passenger (IRP) project1 we are developing
GetThere, a real-time passenger information (RTPI) system for public transport
in rural areas. Crowdsourcing techniques are used to allow passengers to
contribute public transport information using a smartphone app; the contributions
bene t all users, by providing access to real-time information that is otherwise
unavailable. These observations about vehicle location, occupancy levels, and
facilities, are integrated with a number of other datasets using linked data
principles2. These datasets are themselves described by ontologies, and linked using
technologies such as Uniform Resource Indicators (URIs) and the Resource
Description Framework3 (RDF), to enable software agents to nd and reason about
information.
1 http://www.dotrural.ac.uk/irp
2 http://www.w3.org/DesignIssues/LinkedData.html
3 http://www.w3.org/RDF/</p>
      <p>
        Given the sensitive nature of the information collected from passengers (e.g.
their location) ensuring privacy of contributors and their information is vital.
However, in a linked data environment this is more challenging than simply
restricting access, or removing clearly identifying features (e.g. names), as the
existence of related (and linked) datasets may be used to infer characteristics of
the original information source [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ].
      </p>
      <p>This paper presents the results of a study into Personal Privacy and the Web
of Linked Data conducted as part of the Framework for Responsible Research
and Innovation in ICT4 project funded by the UK's Engineering and Physical
Sciences Research Council. The case study investigated the risks and
uncertainties associated with user privacy in linked data environments. The datasets
developed to support GetThere (discussed in Section 2) motivated the
identication of scenarios illustrating these risks (Section 3). Responsibilities for the
relevant stakeholder groups to support personal privacy are discussed in Section
4. Guidelines to increase awareness of potential risks and how to reduce them
are presented in Section 5.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Background</title>
      <p>
        As noted above, the GetThere system uses linked data principles [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. to integrate
passenger contributions with several other datasets. HTTP URIs are used, as
is RDF, a machine processable data model for the exchange of data on the
Web. HTTP URIs provide identi ers for resources, which agents can look-up to
retrieve information about that resource. Web-based ontologies, de ned using
RDF Schema5 and the Ontology Web Language6, add structure to RDF data,
by describing domain concepts, and the relationships between these (and other)
concepts.
      </p>
      <p>The GetThere system is supported by four main datasets7:
{ Infrastructure: provides details of the road network, extracted from
OpenStreetMaps8 and converted into RDF. This is currently not included in the
LinkedGeoData9 dataset, a linked data version of OpenStreetMap
information including places, shops, and tourism sites.
{ Public transport timetable10: provides details of bus timetables including
routes and arrival/departure times at bus stops. Timetables are linked to
the NaPTAN dataset11, which provides details of each bus stop, including
its name, unique ID, and location.
4 http://responsible-innovation.org.uk/frriict/
5 http://www.w3.org/TR/rdf-schema/
6 http://www.w3.org/TR/owl-ref/
7 Ontologies describing the datasets are</p>
      <p>http://www.dotrural.ac.uk/irp/uploads/ontologies
8 http://www.openstreetmaps.org
9 http://www.linkedgeodata.org
10 Described using the Transit ontology - http://vocab.org/transit/terms
11 http://data.gov.uk/dataset/naptan
available
from
{ Users: provides details of registered GetThere users. This includes user
accounts described using the Semantically Interlinked Online Communities12
and Friend Of A Friend (FOAF)13 ontologies. These provide a nickname for
each user and their email address used for the system; a description of each
user's mobile device(s) is also stored.
{ Journeys: describes trips made by GetThere users on public transport
during which they have contributed information. Along with the bus route and
direction of travel, this also includes details of the observations (e.g.
vehicle location) provided, which are represented using extensions of the W3C
Semantic Sensor Network ontology14.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Scenarios</title>
      <p>During a meeting of, and subsequent discussion between, researchers in semantic
web, linked data, and personal privacy, the GetThere system and datasets were
used to motivate the identi cation of a number of scenarios15. Each scenario
illustrates risks related to personal privacy as a result of publishing user's
personal data (or data derived from it). It should be noted that these scenarios and
risks arise whenever personal data is published online, regardless of the
technology used, and that the use of linked data simply serves to make it easier for
adversaries to access and use such data.</p>
      <p>The scenarios were structured in terms of: name; general description; details
of the data published (either user data or data derived from it), including its
content and the technology used to publish it; how that data could be integrated
with other datasets by an adversary; the reasoning necessary to identify
characteristics of the user; and the resulting information determined about the user.
We summarise the scenarios below16.
3.1</p>
      <sec id="sec-3-1">
        <title>Enhanced Phishing Attacks</title>
        <p>
          Phishing attacks consist of emails that attempt to deceive the recipient into
disclosing personal information (e.g. a username and password) or installing
malware on their device. While basic phishing emails are easy to identify, more
sophisticated emails that have been tailored to the recipient are amongst the type
of spam that result in the greatest number of recipients acting upon the email [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ].
Environments containing personal information potentially provide adversaries
(malicious users) with the information required to automatically produce emails
that are highly tailored to the recipient [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ]. For example, an individual's FOAF
12 http://rdfs.org/sioc/spec/
13 http://xmlns.com/foaf/0.1
14 http://www.w3.org/2005/Incubator/ssn/ssnx/ssn
15 The discussion initially focused on the GetThere datasets, but quickly broadened
out to discuss other types of data.
16 A video discussing and illustrating these scenarios is available at
http://vimeo.com/46583809
pro le provides their name, email address, birthday, and links to FOAF pro les
of people known to them. This is su cient to produce a tailored phishing email
which, for example, wishes the receiver happy birthday or references their recent
blog post [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ].
        </p>
        <p>Within the GetThere datasets, a user's FOAF pro le is linked to each journey
they have made using GetThere. The journey description includes the date, start
time, route travelled, direction of travel, and details of locations they provided
during that journey. Publishing this information provides an adversary with
details that could be used to further personalise phishing emails. For example,
an adversary could retrieve the journeys made by each user and the people
they know (taken from their FOAF pro le), and by reasoning about the route,
time, and proximity of locations contributed during those journeys, attempt
to determine any journeys during which they may have travelled together. If
successful, this enables a phishing email to be produced that appears to come
from a friend, with the correct email address and name, references the receiver
by name, and contains a small piece of relevant personal information, such as a
reference to their recent shared journey.
3.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Identifying Unoccupied Properties</title>
        <p>The website pleaserobme.com17 highlighted the danger of users sharing their
location on sites such as foursquare18 and Twitter19. Assuming the check-in/tweet
is correct, such information can be used to indicate when somebody is away from
home. However, this does not provide that person's home address. As part of
GetThere, when a user boards a bus, they tap a button on the app that starts
continuously uploading their location to a server. A webpage then uses a web
service to retrieve this real-time vehicle location and display it on a map for
other users. Upon alighting from the bus, the user stops sending their location.
While no details of the source of a real-time bus location are published, such
location data could potentially be used to determine unoccupied properties.</p>
        <p>This is due to the nature of rural areas: passengers can board/alight the
vehicle at any point along the route (not just at bus stops), potentially doing
so very close to their home. To identify an unoccupied property, an adversary
would simply need to integrate the rst or last location provided by a user on
a journey20 with the postcode dataset published by the UK OrdnanceSurvey21.
This dataset provides the centroid location (longitude and latitude) for every
UK postcode. Integration can be performed by determining the postcode
nearest a vehicle location either by querying the postcode dataset or using existing
web services22. Other web services can then be used to determine the number
17 http://pleaserobme.com
18 https://foursquare.com
19 http://www.twitter.com
20 This can be determined by monitoring vehicle locations provided by GetThere using
the web service that supports the map.
21 http://datahub.io/dataset/uk-postcodes
22 For example, http://www.uk-postcodes.com/api.php
of addresses at that postcode23. In contrast to urban areas, postcodes in rural
areas can have only one or two properties, and so the adversary has potentially
identi ed when a member of that household has left/returned to the property.
GetThere could be monitored over time, or the journey dataset queried to
determine user travel behaviour patterns, including when they regularly leave and/or
return home.
3.3</p>
      </sec>
      <sec id="sec-3-3">
        <title>Attacking Location Obfuscation</title>
        <p>
          Location-based services typically utilise the GPS in a mobile device to
accurately24 monitor and record a user's location [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ]. However, apps using this
information can potentially violate a user's location privacy [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]. Obfuscation
methods attempt to maintain location privacy by degrading the quality of such
information, reducing the probability that the reported value is the user's true
location [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ].
        </p>
        <p>
          When a location is obtained from GPS, the device is actually somewhere
within a circle centred on that point with a radius equal to the accuracy of the
GPS reading. The probability that the user's true location is any point within
that circle can be calculated as a function of the circle's area [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]. A basic approach
to location obfuscation is to provide a randomly selected point within that circle;
alternatives to this include increasing the circle's radius or decreasing the circle's
radius (as the true location may be outside of the smaller circle) and providing
a random point within the revised circle, or creating an overlapping circle with
the same radius (but di erent centre) and providing a random location within
the overlap [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ].
        </p>
        <p>
          While such obfuscation helps maintain location privacy, additional
information could be used to attempt to undo its e ects. For example, if we know that
a location was obtained while an individual was travelling, we could attempt to
identify the road and their location on that road. Map matching algorithms [
          <xref ref-type="bibr" rid="ref19 ref22 ref28">19,
22, 28</xref>
          ] have been developed by the Geographic Information Systems community
to perform this task in the context of GPS locations in navigation systems.
        </p>
        <p>
          The initial step for map matching involves querying datasets (such as the
GetThere infrastructure dataset) for details of road segments close to a given
location. Each road segment consists of a start and end point, with roads being
modeled as a list of such segments. The number of segments can be reduced, for
example, with the knowledge that the individual was travelling on a particular
public transport route, by only retrieving segments for that route. Map matching
algorithms then calculate a probability that the individual's true location is on
each segment. The segment with the highest probability is then selected, and an
estimated location on that segment determined [
          <xref ref-type="bibr" rid="ref28">28</xref>
          ]. This allows an adversary
to estimate an individual's true location by e ectively reversing the obfuscation,
thus exposing them to a number of risks.
23 For example, http://www.posto ce.co.uk/postcode- nder
24 With an error margin of as little as ve metres.
3.4
        </p>
      </sec>
      <sec id="sec-3-4">
        <title>Resetting User Passwords</title>
        <p>
          Security questions are routinely used by websites to identify a user for the
purposes of, for example, resetting their password. Ideally, the answer to security
questions cannot be easily guessed or researched, is persistent over time,
memorable, and de nitive [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ]. However, several studies have shown how many
common security questions can be successfully attacked by searching publically
available information and linking information from multiple sites. This then enables
answers to be determined for challenging questions, such as \What were the
colours of your secondary school uniform?" [
          <xref ref-type="bibr" rid="ref14 ref23 ref24 ref25">23, 14, 24, 25</xref>
          ].
        </p>
        <p>
          While these studies were performed manually, the growth in online social
networking and open data is resulting in the necessary types of information
becoming available online in machine readable formats. For example, social network
sites have extensive social graphs for their users (a record of all the relationships
between a user, the resources they have produced, group memberships,
relationships with other users, etc.) [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]. Each social graph contains di erent pieces
of personal information: Linkedin25 contains details of education and
employment; facebook26 contains friends and family relationships; and LiveJournal27
contains details of interests. Other datasets providing relevant information are
also becoming available online, for example, transcripts of births, deaths, and
marriages.
        </p>
        <p>
          Although each site provides a limited amount of information, if these can
be uni ed into a single graph describing an individual, an adversary has an
extensive dataset describing that person. This could be produced automatically
using web APIs or screen scraping techniques, with RDF used as a common data
format to support integration. The main challenge is then linking the di erent
pro les for a given individual across di erent sites. Initiatives such as OpenID28
and research in ontology matching [
          <xref ref-type="bibr" rid="ref2 ref27 ref6">27, 2, 6</xref>
          ] could be used to automate this task.
Additional information can then be obtained by linking to datasets on the Web
of Linked Data. For example, Linkedin could provide details about the secondary
school attended by an individual, which can be linked to the DBPedia29 entry
describing that school, including the uniform colours. This potentially provides
the adversary with information about an individual, which could include their
name, address, date of birth, social networks, participation in groups,
employment history, family relationships, and education; providing su cient
information to answer many common security questions. If successfully used to gain
access to an account, the adversary then gains access to any personal
information stored within that account.
25 http://www.linkedin.com
26 http://www.facebook.com
27 http://www.livejournal.com
28 http://openid.net/
29 http://dbpedia.org
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Maintaining Personal Privacy - Who is Responsible?</title>
      <p>Based on the scenarios described above and our own experience deploying the
GetThere system, we have identi ed four stakeholder groups that have a role
to play in ensuring users' personal privacy. Brie y, these are the linked data
community (including researchers, developers, and practitioners), developers of
software that obtains and uses personal information from users (both in general,
and within the semantic web community), individuals that share their personal
information with software, and ethics committees.</p>
      <p>
        In addition to the development of technologies to protect user privacy, such
as security models and access control (e.g. [
        <xref ref-type="bibr" rid="ref29 ref7">7, 29</xref>
        ]), we argue that the linked data
community should also work to educate stakeholder groups about the risks.
For example, developers should consider these risks throughout the design and
development process in order to in uence decisions regarding the amount and
type(s) of personal information that will be collected, and how this data, or data
derived from it, will be stored, used, and published. These considerations can
also in uence any other information developers provide that could be useful to
adversaries.
      </p>
      <p>
        When software utilises linked data to represent and publish personal
information obtained from users, they should be educated about the resulting potential
privacy risks. This will allow users to make an informed decision regarding the
information they provide. Education can include providing a simple, clear
description of the personal data that will be obtained and any associated risks [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ],
as desired by both users and regulators [
        <xref ref-type="bibr" rid="ref15 ref17 ref4">4, 15, 17</xref>
        ]. If these details are provided,
where appropriate, for software produced by the linked data community, this
will raise user awareness of how potential risks arise. This enables users to make
similar assessments of any software they share their personal information with,
even if such descriptions are not provided.
      </p>
      <p>The linked data community should also shape ethical approval processes to
re ect the privacy risks. For example, currently when software is developed as
part of a University research project, it may be required to undergo an ethical
approval process. However, this process may only ask if any data will be
generated and/or stored that could be used to identify an individual. Given the
potential risks, we argue that the ethical approval process should require
details of the data that will be generated, how it will be processed (including any
anonymisation) and published, a review of the privacy risks individuals may be
exposed to, and evidence that these are su ciently minimised and/or justi ed.
The linked data community should be involved in training for ethics
committees, equipping them with the ability to appreciate, understand, and evaluate
potential risks, enabling them to perform a more comprehensive review of such
software.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Guidelines</title>
      <p>
        We now discuss a set of guidelines which aim to raise awareness of the issues
discussed above and suggest means to address them.
{ Many of the risks arise as a result of data from a single user being published
(or data derived from an individual's data). Application developers should
therefore consider not publishing information when it is based on data from
a single user, preferring, for example, to aggregate data from multiple users,
making it more challenging to infer characteristics of an individual.
{ When acquiring and using ne grained location information from an
individual user, location obfuscation techniques based on reporting a false location
can be insu cient and are vulnerable to attack in certain scenarios.
Therefore, alternative obfuscation techniques should be considered, such as:
publishing locations generated by merging those of multiple users; careful use of
landmarking (where a nearby landmark is reported instead of the true
location); or the return of more abstract locations, such as street or town/city
name [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
{ Developers of software that uses personal information from users should
produce a set of scenarios exploring the resulting privacy risks. Each scenario
should include a general description, the data that is made publicly
available, and how an adversary could use that data for malicious purpose(s).
When developing such risk scenarios, it may be useful to adopt the role of
the adversary, and consider questions such as \How would I (an adversary)
use the published data to [stalk, harass, rob, spam, obtain additional
personal/private information, gain access to an account of, steal the identity
of] a user of the system". Further, developers should consider performing
a Privacy Impact Assessment (PIA) for the software. A PIA is designed to
allow organisations to \assess and identify any privacy concerns . . . and
address them at an early stage" [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. The PIA handbook provides a detailed
guide for the process, which includes: evaluating the type of assessment that
should be performed (full-scale or small-scale); producing a project outline
describing the project, its context, motivations, and objectives; developing
a plan for performing the assessment; performing the assessment through
consultations with stakeholders, risk analysis, and the identi cation of
problems and solutions; documenting the PIA process; and nally, reviewing and
auditing the PIA process.
{ Users should be provided with su cient details to allow them to make
an informed choice about using software/contributing personal information.
These details should include a concise and jargon free description of the data
collected, how that data is used and published, and a description of the
associated privacy risks. As many users do not read documentation such as
terms and conditions30, it may be desirable to include non-textual
descriptions (e.g. pictures or video) to assist them in understanding the risks.
{ Ethical approval processes for research involving linked data should require
details of, and justi cation for all data collected from users, and should not
simply ask if identi able or \sensitive personal data" (as de ned by the UK
Data Protection Act [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] or equivalent legislation) will be collected. This
30 It is estimated that 90% of users did not read Google's revised terms and conditions
in 2012 [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
should include requiring evidence that potential risks have been evaluated
and addressed. In addition, details of where the data will be physically stored,
how it will be stored, the format, how it will be accessed electronically, who
will have access to each part of it, and how appropriate access controls will
be implemented and enforced within a system, should also be required.
6
      </p>
    </sec>
    <sec id="sec-6">
      <title>Conclusion</title>
      <p>In this paper we have discussed issues relating to personal privacy and linked
data environments. Although by no means comprehensive, the four scenarios
presented here illustrate how adversaries can exploit linked data and semantic web
technologies to support attacks on individuals. This is a particular concern as
the number of machine-readable, interlinked datasets becoming available online
continues to grow.</p>
      <p>
        Technology based approaches being developed (such as controlling access
to linked data [
        <xref ref-type="bibr" rid="ref29 ref7">29, 7</xref>
        ]) form part of the solution to this problem. Tools could
also be produced to analyse datasets/ontologies and highlight potential issues to
designers. For example, by searching for the use of vocabularies that provide
personal information (e.g. a sioc:UserAccount with a sioc:email ) and informing the
designer of potential risks (e.g. that publishing this information could result in
the user receiving phishing emails). Such tools could also examine potential risks
arising from integrating personal data with other data (e.g. if a sioc:UserAccount
is linked to geo:lat and geo:long values, this potentially indicates location
information about that user will be published). This analysis could also be used to
inform users of potential risks when sharing their information with systems.
      </p>
      <p>Another aspect is educating relevant stakeholders, including software
developers, users, and ethics committees, about the potential risks to personal privacy.
This should allow developers to design software that attempts to minimise the
potential risks; enable users to make more informed decisions about the data
they share with applications; and provide ethics boards with a greater
appreciation and understanding of the risks, enabling them to make more thorough
assessments of ethical approval submissions.</p>
      <p>To support this, we have designed an initial set of guidelines; however, we
recognise that they are just that - a starting point. We would like to see the
creation of an open online repository of privacy scenarios and associated guidelines.
This repository would serve as a reference point for stakeholders, which can be
updated as the semantic web community continues to improve its understanding
of issues related to semantic web and linked data technologies and their impact
on the personal privacy of individuals. While the actions necessary to minimise
the risks are likely to be speci c to any given application, and there may be
no way of reducing these risks completely, a greater understanding will allow
stakeholders to attempt to minimise such risks.</p>
      <p>Acknowledgements The research described here is supported by the award
made by the RCUK Digital Economy programme to the dot.rural Digital
Economy Hub (award reference EP/G066051/1); and an award from the Framework
for Responsible Research and Innovation in ICT project.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Ardagna</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cremonini</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Damiani</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          , Capitani di Vimercati,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Samarati</surname>
          </string-name>
          ,
          <string-name>
            <surname>P.</surname>
          </string-name>
          :
          <article-title>Location privacy protection through obfuscation-based techniques</article-title>
          . In: Barker,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Ahn</surname>
          </string-name>
          , G.J. (eds.)
          <source>Data and Applications Security XXI, Lecture Notes in Computer Science</source>
          , vol.
          <volume>4602</volume>
          , pp.
          <volume>47</volume>
          {
          <fpage>60</fpage>
          . Springer Berlin Heidelberg (
          <year>2007</year>
          ), http://dx.doi. org/10.1007/978-3-
          <fpage>540</fpage>
          -73538-0\_
          <fpage>4</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Bellahsene</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bonifati</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rahm</surname>
          </string-name>
          , E. (eds.):
          <article-title>Schema matching and mapping</article-title>
          . Springer (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Beresford</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stajano</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Location privacy in pervasive computing</article-title>
          .
          <source>Pervasive Computing, IEEE</source>
          <volume>2</volume>
          (
          <issue>1</issue>
          ),
          <volume>46</volume>
          {
          <fpage>55</fpage>
          (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>Big</given-names>
            <surname>Brother</surname>
          </string-name>
          <article-title>Watch: Nine in ten people haven't read google's new privacy policy (</article-title>
          <year>2012</year>
          ), http://www.bigbrotherwatch.org.uk/home/2012/02/tenpeople-havent
          <article-title>-read-googles.html#</article-title>
          .
          <source>UBZyUG9ZWb2</source>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Brown</surname>
          </string-name>
          , G.,
          <string-name>
            <surname>Howe</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ihbe</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Prakash</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Borders</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Social networks and context-aware spam</article-title>
          .
          <source>In: CSCW '08 Proceedings of the 2008 ACM conference on Computer supported cooperative work</source>
          . pp.
          <volume>403</volume>
          {
          <issue>412</issue>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Choi</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Song</surname>
          </string-name>
          , I.Y., Han, H.:
          <article-title>A survey on ontology mapping</article-title>
          .
          <source>SIGMOD Rec</source>
          .
          <volume>35</volume>
          (
          <issue>3</issue>
          ),
          <volume>34</volume>
          {41 (Sep
          <year>2006</year>
          ), http://doi.acm.
          <source>org/10</source>
          .1145/1168092.1168097
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Costabello</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Villata</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rodriguez</surname>
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Corcho</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gandon</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Access control for http operations on linked data</article-title>
          . In: Cimiano,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Corcho</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            ,
            <surname>Presutti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            ,
            <surname>Hollink</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Rudolph</surname>
          </string-name>
          , S. (eds.)
          <source>The Semantic Web: Semantics and Big Data, Lecture Notes in Computer Science</source>
          , vol.
          <volume>7882</volume>
          , pp.
          <volume>185</volume>
          {
          <fpage>199</fpage>
          . Springer Berlin Heidelberg (
          <year>2013</year>
          ), http://dx.doi.org/10.1007/978-3-
          <fpage>642</fpage>
          -38288-8\_
          <fpage>13</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Duckham</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kulik</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>A formal model of obfuscation and negotiation for location privacy</article-title>
          . In: Gellersen,
          <string-name>
            <given-names>H.W.</given-names>
            ,
            <surname>Want</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Schmidt</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . (eds.)
          <source>Pervasive Computing, Lecture Notes in Computer Science</source>
          , vol.
          <volume>3468</volume>
          , pp.
          <volume>152</volume>
          {
          <fpage>170</fpage>
          . Springer Berlin Heidelberg (
          <year>2005</year>
          ), http://dx.doi.org/10.1007/11428572\_
          <fpage>10</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Heath</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bizer</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Linked Data: Evolving the Web into a Global Data Space</article-title>
          .
          <source>Synthesis Lectures on the Semantic Web: Theory and Technology</source>
          , Morgan &amp; Claypool Publishers (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Hong</surname>
            ,
            <given-names>J.I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Landay</surname>
            ,
            <given-names>J.A.</given-names>
          </string-name>
          :
          <article-title>An architecture for privacy-sensitive ubiquitous computing</article-title>
          .
          <source>In: Proceedings of the 2nd international conference on Mobile systems</source>
          , applications, and services. pp.
          <volume>177</volume>
          {
          <fpage>189</fpage>
          . MobiSys '04,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA (
          <year>2004</year>
          ), http://doi.acm.
          <source>org/10</source>
          .1145/990064.990087
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Information</surname>
          </string-name>
          <article-title>Commissioner's O ce: UK data protection act 1998 (</article-title>
          <year>1998</year>
          ), http://www.legislation.gov.uk/ukpga/1998/29/contents
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Information</surname>
          </string-name>
          Commissioners O ce:
          <article-title>Privacy impact assessment handbook</article-title>
          ,
          <source>version 2</source>
          .0 (
          <issue>2012</issue>
          ), http://www.ico.gov.uk/upload/documents/pia handbook html v2/index.html
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Ishold</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Social graph: Concepts and issues</article-title>
          .
          <source>ReadWriteWeb (September</source>
          <year>2007</year>
          ), http://www.readwriteweb.
          <article-title>com/archives/social graph concepts and issues</article-title>
          .php
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Just</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aspinall</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Personal choice and challenge questions: A security and usability assessment</article-title>
          .
          <source>In: SOUPS 09: Proceedings of the Fifth Symposium on Usable Privacy and Security</source>
          . ACM, New York (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Kidner</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Clause for concern: most people ba ed by online t&amp;cs</article-title>
          .
          <source>Which? (July</source>
          <year>2012</year>
          ), http://conversation.which.co.uk/technology/online
          <article-title>-privacy-policyterms-and-conditions-confusion-investigation</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Kupper</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <string-name>
            <surname>Location-Based</surname>
            <given-names>Services</given-names>
          </string-name>
          :
          <article-title>Fundamentals and Operation</article-title>
          . John Wiley &amp; Sons, Ltd (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Masnick</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Web privacy policies confuse net surfers</article-title>
          (
          <year>June 2003</year>
          ), http://www.techdirt.com/articles/20030625/0158245.shtml
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Nasirifar</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hausenblas</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Decker</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Privacy concerns of FOAF-based linked data</article-title>
          .
          <source>In: Trust and Privacy on the Social and Semantic Web Workshop (SPOT 09) at ESWC09</source>
          . Heraklion,
          <string-name>
            <surname>Greece</surname>
          </string-name>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Ochieng</surname>
          </string-name>
          , W.Y.,
          <string-name>
            <surname>Quddus</surname>
            ,
            <given-names>M.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Noland</surname>
          </string-name>
          , R.B.:
          <article-title>Map-matching in complex urban road networks</article-title>
          .
          <source>Brazilian Journal of Cartography</source>
          <volume>55</volume>
          (
          <issue>2</issue>
          ),
          <volume>1</volume>
          {
          <fpage>18</fpage>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Ohm</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Broken promises of privacy: Responding to the surprising failure of anonymization</article-title>
          .
          <source>UCLA Law Review</source>
          <volume>57</volume>
          ,
          <issue>1701</issue>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Out-Law</surname>
          </string-name>
          .
          <article-title>com: Regulators demand clearer privacy policy</article-title>
          (
          <year>Feburary 2009</year>
          ), http://www.out-law.com/page-9795
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Quddus</surname>
            ,
            <given-names>M.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Noland</surname>
            ,
            <given-names>R.B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ochieng</surname>
          </string-name>
          , W.Y.:
          <article-title>A high accuracy fuzzy logic based map matching algorithm for road transport</article-title>
          .
          <source>Journal of Intelligent Transportation Systems: Technology, Planning, and Operations</source>
          <volume>10</volume>
          (
          <issue>3</issue>
          ),
          <volume>103</volume>
          {
          <fpage>115</fpage>
          (
          <year>2006</year>
          ), http:// dx.doi.org/10.1080/15472450600793560
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Rabkin</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Personal knowledge questions for fallback authentication: security questions in the era of facebook</article-title>
          .
          <source>In: Proceedings of the 4th symposium on Usable privacy and security</source>
          . pp.
          <volume>13</volume>
          {
          <fpage>23</fpage>
          . SOUPS '08,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA (
          <year>2008</year>
          ), http://doi.acm.
          <source>org/10</source>
          .1145/1408664.1408667
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Schechter</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brush</surname>
            ,
            <given-names>A.J.B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Egelman</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>It's no secret. measuring the security and reliability of authentication via `secret'; questions</article-title>
          .
          <source>In: Proceedings of the 2009 30th IEEE Symposium on Security and Privacy</source>
          . pp.
          <volume>375</volume>
          {
          <fpage>390</fpage>
          . SP '09, IEEE Computer Society, Washington, DC, USA (
          <year>2009</year>
          ), http://dx.doi.org/10.1109/SP.
          <year>2009</year>
          .11
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Schechter</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Reeder</surname>
          </string-name>
          , R.W.:
          <article-title>1 + 1 = you: measuring the comprehensibility of metaphors for con guring backup authentication</article-title>
          .
          <source>In: Proceedings of the 5th Symposium on Usable Privacy and Security</source>
          . pp.
          <volume>9</volume>
          :
          <issue>1</issue>
          {9:
          <fpage>31</fpage>
          . SOUPS '09,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA (
          <year>2009</year>
          ), http://doi.acm.
          <source>org/10</source>
          .1145/1572532.1572544
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Scoville</surname>
          </string-name>
          , G.:
          <article-title>Good security questions</article-title>
          . http://www.goodsecurityquestions.com (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Shvaiko</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Euzenat</surname>
          </string-name>
          , J.:
          <article-title>Ontology matching: State of the art and future challenges</article-title>
          .
          <source>IEEE Transactions on Knowledge and Data Engineering</source>
          <volume>25</volume>
          (
          <issue>1</issue>
          ),
          <volume>158</volume>
          {
          <fpage>176</fpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Velaga</surname>
            ,
            <given-names>N.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nelson</surname>
            ,
            <given-names>J.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sripada</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Edwards</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Corsar</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sharma</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Beecroft</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Development of a map-matching algorithm for rural passenger information systems via mobile phones and crowd-sourcing</article-title>
          .
          <source>In: Proceedings of the 91st annual meeting of the transportation research board</source>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Villata</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Delaforge</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gandon</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gyrard</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>An access control model for linked data</article-title>
          . In: Meersman,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Dillon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Herrero</surname>
          </string-name>
          , P. (eds.) On the Move to Meaningful
          <source>Internet Systems: OTM 2011 Workshops, Lecture Notes in Computer Science</source>
          , vol.
          <volume>7046</volume>
          , pp.
          <volume>454</volume>
          {
          <fpage>463</fpage>
          . Springer Berlin Heidelberg (
          <year>2011</year>
          ), http: //dx.doi.org/10.1007/978-3-
          <fpage>642</fpage>
          -25126-9\_
          <fpage>57</fpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>