<!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>Semantic and Sensitivity Aware Location Privacy Protection for the Internet of Things</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Berker Agir</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jean-Paul Calbimonte</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Karl Aberer</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Faculty of Computer Science and Communication Systems</institution>
          ,
          <addr-line>EPFL</addr-line>
          ,
          <country country="CH">Switzerland</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Everyday applications and ubiquitous devices contribute data to the Internet of Things, oftentimes including sensitive information of people. This opens new challenges for protecting users' data from adversaries, who can perform di erent types of attacks using combinations of private and publicly available information. In this paper, we discuss some of the main challenges, especially regarding location-privacy, and a general approach for adaptively protecting this type of data. This approach considers the semantics of the user location, as well as the user's sensitivity preferences, and also builds an adversary model for estimating privacy levels.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>the majority of the population in a city, hospitals might be sensitive locations,
because disclosing the fact that a person is visiting a hospital may reveal that
he has a disease. Although in general this could mean that this location
information should be hidden, for other users (e.g., a physician who works at the
hospital) this might not be sensitive at all. In this particular example, we see
that the sensitivity depends on the semantics of the location and the user's
preferences. A potential adversary can take advantage of this type of
information, even more, considering that this type of semantic location information can
be easily and publicly accessed through di erent geo-tagging, and geo-Linked
Data interfaces [2]. Moreover, the protection strategies should adapt to the user
context, e.g. trajectories, time of day, density of people in a certain place, etc.</p>
      <p>In this paper we propose a general approach for location-privacy protection
that takes into account not only the geographical but also the semantic
information of urban locations, as well as user's sensitivities to obfuscate the location
information that is transmitted to a service provider of Internet of Things. This
approach extends and leverages on our previous set of protection techniques [1],
fundamentally adding the combination of semantics and attack models. In our
approach each individual is able to build a model of an adversary, based on
possible strategies and background information, so that he can adaptively change
the obfuscation level according to a required level of protection.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Adaptive and Sensitivity-aware Privacy Protection</title>
      <p>In this work, we focus on scenarios where users with mobile devices move in
an urban area and they continuously provide data to the IoT for a speci c
purpose. We assume that users provide their geographical location information
along other domain-speci c data. Users occasionally visit certain
semanticallyannotated places (such as \Restaurant" or \Hospital"). In this case, the
corresponding server may know what type of location is visited thanks to availability
of rich online resources (geo-tagged maps, geo-Linked Data, etc.).</p>
      <p>In this setting, location privacy of users is threatened by the server they
communicate with (or any other entity who has access to the data they send).
In particular, users may not want to disclose their actual locations in the fear
that an adversary can exploit this information to gain more private data about
them. Therefore, they would like to obfuscate (i.e., reduce the granularity of)
their locations or hide them completely. There have been numerous proposals
for protecting location-privacy in di erent ways (see Section 3), but none can
continuously adapt the protection strategy considering both location semantics
and varying user sensitivities. In summary, we focus on two main points:
1. We model the adversary that takes into account location semantics and
user sensitivities in addition to users' geographical mobility behaviors. The
adversary can develop sophisticated algorithms (e.g., using machine learning
techniques) for inferring users' actual locations.
2. We develop an adaptive user-side protection mechanism that considers
location semantics and users' varying privacy sensitivities. Previous work [1]
proves that adaptive approaches retain location privacy better than static
obfuscation approaches. Distinctively, our scheme automatically determines
the required privacy levels based on location semantics and user sensitivities
and meets these levels by anticipating the adversary's strategy.</p>
      <p>A crucial advantage of our approach is the ability to model the adversary,
and thus the possibility to continuously simulate his attacks and evaluate his
probability of success. The adversary model considers the parameters that users
already know: user mobility, location semantics and privacy sensitivities. A user
sensitivity pro le can be crowdsourced or inferred [8] and then personalized as
needed. Figure 1 depicts the standing points of the adversary and users. These
two problems can be seen as two sides of the same coin, in the sense that both
users and the adversary reason about their counterparts' knowledge and
capabilities while taking action. We explain the details of these points in sections 2.2 and
2.3, respectively, after introducing the framework formalization in Section 2.1.</p>
      <p>Adversary
• Location Semantics
• User Mobility History
• Common-knowledge sensitivities
→ Inference</p>
      <p>User
• Location Semantics
• Adversary Modelling
• Sensitivity Profile
→ Real-Time Adaptive Protection
As previously stated, we consider mobile users U = fu1; u2; :::; uN g, who move
in a discretized urban area consisting of M regions in set R. A user u generates
an actual trace au as he moves through time period T = ft1; t2; :::; tT g. Each
element, i.e., event, in au is of the form au(t) = hu; t; r; ci, where r 2 R is user
u's actual location at time t 2 T and c 2 C is a semantic tag for region r.</p>
      <p>User u would like to connect to a server of a certain online application, but
is afraid that his privacy will be violated. Hence, he employs a location-privacy
protection mechanism f , which generates an obfuscated trace ou from au. Note
that ou is the disclosed location trace of user u and it is observed by the adversary.
Users may have di erent privacy-sensitivity levels for di erent semantic tags and
even for some particular regions. As a result, a protection mechanism f takes
into account user u's sensitivities denoted by Su 2 S.
A server that aggregates data from users U in an IoT environment, is interested
in inferring their private data through location context; hence he is considered as
the adversary. We assume that he can obtain some background information about
a user u which he exploits in order to enhance his attack. This background
information is in the form of transition counts between regions, which constitutes
user u's behavior history, denoted by Hu. We argue that the adversary may fail
to obtain a complete history pro le Hu and try actually to approximate it. We
denote by Hcu the history pro le as observed and obtained by the adversary.</p>
      <p>The adversary knows which protection mechanism f users employ and also
knows that the users may provide f with their sensitivity pro les S to meet
their privacy requirements. Most users may share similar sensitivity values for
many semantic tags or at least it is possible to predict such sensitivity values,
with some challenge for speci c locations [8]. Therefore, the adversary may not
have the actual sensitivity pro les S of users, but a close approximation for
most of the population. In this regard, he can build a common-knowledge
sensitivity pro le set Sb. Formally, this translates into the fact that, a mechanism
f generates an obfuscated trace ou from au according to a probability
distribution Prfoujau; Sg. As a result, the adversary builds his attack in terms of
the probability that a trace a0u is the actual trace of user u given the
adversary observation ou, his background knowledge Hcu and sensitivity pro le Scu:
h(a0u) = Prfa0ujou; Hcu; Scug. h(a0u) represents the posterior probability
distribution on user traces based on the adversary's attack. Considering that the
adversary has considerably more computational power than users, but still limited,
we model a sophisticated attack with machine learning techniques on
multidimensional data, i.e., geographical location, semantic dimension, time and user
privacy sensitivities. The ultimate purpose of the attack is to approximate h.
2.3</p>
      <p>Adaptive Privacy-Protection
We know that the adversary has a certain knowledge about users (i.e., Hb , Sb,
f ), and therefore users (and the protection mechanisms they employ) must be
aware of this fact. Hence, we build our location-privacy protection scheme in an
adaptive manner; it reasons about the information the adversary has, anticipates
on what he can infer from disclosed data and decide on the protection details
accordingly. It also regards the semantics of the user's location and his privacy
sensitivities, which it integrates in its decision process. Formally, the protection
mechanism f employed by a user u generates an obfuscated event ou(t) 2 ou
given the actual event au(t), all the past disclosed events fou(t0)g for t1 t0 &lt; t,
user u's history pro le Hu, and his sensitivity pro le Su:
ou(t) = f (au(t); fou(t0)g; Hu; Su);
t1
t0 &lt; t
In order for f to exploit the aforementioned data in addition to the user's actual
location and also to adapt to user behavior in real-time, it needs to reason about
the adversary's strategy, i.e., how the adversary fuses all the data he has for
inference. This means that the user should attack his own obfuscated trace and
make an evaluation of the expected privacy level for his protection mechanism's
actions before disclosing any data. However, users do not have as much
computational power as the adversary has; hence, they need to model a more e cient and
thus weaker attack in order to approximate what the adversary can achieve. For
this, we introduce two separate core modules in our adaptive privacy-protection
scheme: the module responsible for local estimation of location-privacy and also
the protection module that essentially apply the protection techniques on user
locations. Figure 2 shows these modules with their interaction among each other.</p>
      <p>Sensitivity Profile
History Module
estimate</p>
      <p>Privacy
Estimation
Module</p>
      <p>candidate</p>
      <p>Location-Privacy
Protection Mechanism</p>
      <p>Privacy estimation module (PEM) keeps track of the user's past events and
history pro le. It then uses Bayesian inference to attack user's own trace as
described in [1]. For e ciency, this is achieved through storing user (obfuscated)
events in an inference graph and updating the graph in real-time as the user
generates new events. PEM fuses information from Bayesian inference with history
data and computes a privacy level using the expected distortion metric proposed
by Shokri et al. [6]. This metric is basically an expected value computation on
distances between the user's actual location and the observed locations in his
obfuscated event. Note that what the user estimates here is in fact the posterior
distribution h resulting from the adversary attack. However, the adversary
attacks the obfuscated trace as a whole; the user only attacks the disclosed part
of his obfuscated trace. As a result, the user achieves an approximation of h.</p>
      <p>Whenever the user generates a new event, the protection module obtains the
actual location and the corresponding semantic tag; then it checks the user's
sensitivity pro le Su and drafts an obfuscated location by also considering the
user's history pro le H. It invokes the PEM by passing it the generated
obfuscated location and the PEM evaluates the expected privacy-level as if the user
would disclose the current obfuscated location. Upon receiving the estimated
privacy-level, the protection module checks if it satis es the user's sensitivities.
If yes, it discloses the obfuscated location. Otherwise, it adjusts its parameters
and generates a new obfuscated location, and goes through the same
procedure. In summary, the protection mechanism iteratively adjusts its obfuscation
parameters until the user's sensitivity preferences are satis ed.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Related Work</title>
      <p>There have been numerous works in the literature on location privacy, primarily
variations of protection mechanisms that make use of obfuscation, perturbation
and hiding. Most of the proposed solutions are evaluated based on static
parameters (e.g., obfuscation area size) which lacks a potential adversary's perspective
and therefore do not yield realistic privacy evaluation. Shokri et al. [6, 7]
addressed this problem and proposed a framework for quantifying location-privacy
w.r.t. an adversary with limited capabilities, but some background knowledge
on user behavior. They evaluate users' location privacy based on the result of
the adversary's attack, i.e., his confusion, correctness and accuracy, but they
developed their framework only on geographical dimension of location.</p>
      <p>Additionally, some prior work takes into account user sensitivities and
location semantics in order to better protect location privacy of users. For instance,
the PROBE Framework by Damiani et al. [3] propose to generate personal
obfuscation areas based on users' privacy sensitivities to certain types of places and
their ratio to their obfuscation areas in terms of size. Another work, by Monreale
et al. [5], focuses on users' semantic trajectories which consist of sequences of
visited places. They argue that some of the places of certain types in a
trajectory might be sensitive and develop a protection approach based on semantic
generalization according to a prede ned semantic tag taxonomy. Both of these
work analyze location-privacy by computing expected confusion levels without
considering an adversary's capabilities and attack strategies.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Conclusions &amp; Future Work</title>
      <p>We presented an adaptive location-privacy protection scheme that is aware of
location semantics and user sensitivities. This scheme takes into account a
sophisticated adversary by emulating his attack and thus estimates users' expected
privacy levels. We also model and formalize this sophisticated adversary for
realizing the threat, through which we aim to evaluate location-privacy
comprehensively. Even though less powerful than an actual adversary, we expect our
scheme to perform better against a sophisticated adversary than previous work.
Our next step is to develop both the types of attacks described and the adaptive
protection scheme. Moreover, user sensitivities may depend on more features
such as time of day and the user activity. We will investigate these aspects and
their e ect on privacy in order to enhance and complete our framework.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <article-title>Acknowledgements: This work is supported by the OpenSense2 project,</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <article-title>funded by Nano-Tera.ch and nanced by the Swiss Confederation. References 1</article-title>
          .
          <string-name>
            <given-names>B.</given-names>
            <surname>Agir</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. G.</given-names>
            <surname>Papaioannou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Narendula</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Aberer</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.-P.</given-names>
            <surname>Hubaux.</surname>
          </string-name>
          User-side
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <volume>18</volume>
          (
          <issue>1</issue>
          ):
          <volume>165</volume>
          {
          <fpage>191</fpage>
          ,
          <year>2014</year>
          . 2.
          <string-name>
            <given-names>S.</given-names>
            <surname>Auer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lehmann</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Hellmann</surname>
          </string-name>
          . Linkedgeodata: Adding a Spatial Dimension
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <source>to the Web of Data</source>
          . Springer,
          <year>2009</year>
          . 3.
          <string-name>
            <surname>M. L. Damiani</surname>
            , E. Bertino, and
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Silvestri</surname>
          </string-name>
          .
          <article-title>The PROBE Framework for the Per-</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <source>sonalized Cloaking of Private Locations. Trans. Data Privacy</source>
          , pages
          <volume>123</volume>
          {
          <fpage>148</fpage>
          ,
          <year>2010</year>
          . 4.
          <string-name>
            <given-names>P.</given-names>
            <surname>Golle</surname>
          </string-name>
          and
          <string-name>
            <given-names>K.</given-names>
            <surname>Partridge</surname>
          </string-name>
          .
          <article-title>On the Anonymity of Home/Work Location Pairs</article-title>
          . In
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <given-names>Pervasive</given-names>
            <surname>Computing</surname>
          </string-name>
          , volume
          <volume>5538</volume>
          , pages
          <fpage>390</fpage>
          {
          <fpage>397</fpage>
          . Springer,
          <year>2009</year>
          . 5.
          <string-name>
            <given-names>A.</given-names>
            <surname>Monreale</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Trasarti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Pedreschi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Renso</surname>
          </string-name>
          , and
          <string-name>
            <given-names>V.</given-names>
            <surname>Bogorny</surname>
          </string-name>
          . C-safety: A
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <source>pages 73{101</source>
          ,
          <year>2011</year>
          . 6.
          <string-name>
            <given-names>R.</given-names>
            <surname>Shokri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Freudiger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Jadliwala</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.-P.</given-names>
            <surname>Hubaux</surname>
          </string-name>
          .
          <article-title>A Distortion-based Metric</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <given-names>for Location</given-names>
            <surname>Privacy. In</surname>
          </string-name>
          <string-name>
            <surname>WPES</surname>
          </string-name>
          ,
          <year>2009</year>
          . 7.
          <string-name>
            <given-names>R.</given-names>
            <surname>Shokri</surname>
          </string-name>
          , G. Theodorakopoulos, J.
          <string-name>
            <surname>-Y. Le Boudec</surname>
            , and
            <given-names>J.-P.</given-names>
          </string-name>
          <string-name>
            <surname>Hubaux</surname>
          </string-name>
          . Quantifying
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <given-names>Location</given-names>
            <surname>Privacy</surname>
          </string-name>
          . In IEEE S&amp;P, pages
          <volume>247</volume>
          {
          <fpage>262</fpage>
          ,
          <year>2011</year>
          . 8.
          <string-name>
            <given-names>E.</given-names>
            <surname>Toch</surname>
          </string-name>
          .
          <article-title>Crowdsourcing Privacy Preferences in Context-aware Applications</article-title>
          . Per-
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <source>sonal and Ubiquitous Computing</source>
          ,
          <volume>18</volume>
          (
          <issue>1</issue>
          ):
          <volume>129</volume>
          {
          <fpage>141</fpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>