<!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>A Hybrid Strategy for Privacy-Preserving Recommendations for Mobile Shopping</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Toon De Pessemier</string-name>
          <email>toon.depessemier@ugent.be</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Kris Vanhecke</string-name>
          <email>kris.vanhecke@ugent.be</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Luc Martens</string-name>
          <email>luc1.martens@ugent.be</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>iMinds-WiCa-Ghent University</institution>
          ,
          <addr-line>G. Crommenlaan 8 box 201, B-9050 Ghent</addr-line>
          ,
          <country country="BE">Belgium</country>
        </aff>
      </contrib-group>
      <fpage>21</fpage>
      <lpage>24</lpage>
      <abstract>
        <p>To calculate recommendations, recommender systems collect and store huge amounts of users' personal data such as preferences, interaction behavior, or demographic information. If these data are used for other purposes or get into the wrong hands, the privacy of the users can be compromised. Thus, service providers are confronted with the challenge of o↵ ering accurate recommendations without the risk of dissemination of sensitive information. This paper presents a hybrid strategy combining collaborative filtering and content-based techniques for mobile shopping with the primary aim of preserving the customer's privacy. Detailed information about the customer, such as the shopping history, is securely stored on the customer's smartphone and locally processed by a content-based recommender. Data of individual shopping sessions, which are sent to the store backend for product association and comparison with similar customers, are unlinkable and anonymous. No uniquely identifying information of the customer is revealed, making it impossible to associate successive shopping sessions at the store backend. Optionally, the customer can disclose demographic data and a rudimentary explicit profile for further personalization.</p>
      </abstract>
      <kwd-group>
        <kwd>Recommender System</kwd>
        <kwd>Shopping Assistant</kwd>
        <kwd>Privacy</kwd>
        <kwd>Mobile</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Categories and Subject Descriptors</title>
    </sec>
    <sec id="sec-2">
      <title>1. INTRODUCTION</title>
      <p>Data gathering and analysis, i.e. one of the
fundamentals of traditional recommender systems, is a serious
concern for many, increasingly privacy-aware users. A data
collector may disclose personal information to untrusted
parPermission to make digital or hard copies of all or part of this work for
personal or classroom use is granted without fee provided that copies are
not made or distributed for profit or commercial advantage and that copies
bear this notice and the full citation on the first page. To copy otherwise, to
rCeoppuybrliisghh,tto post on servers or to redistribute to lists, requires prior specific
2014 for the individual papers by the paper’s authors.
pCeorpmyiisnsgionpearnmd/iottreda ffeoer. private and academic purposes. This volume is
CpuBbRlieschSeyds a2n0d14c,oOpyctroigbhetre6d, b2y01it4s, eSdiliitcoorsn. Valley, CA, USA.</p>
      <p>
        CoBpRyercigShyts22001144b,yOtchteobaeurth6o,r2(s0)1.4, Silicon Valley, CA, USA.
ties. This could occur either on purpose, i.e., by selling
the personal information to a third party, or involuntarily
through a security breach. As a result, users are becoming
apprehensive about using applications or services that
collect personal data. For shopping applications for example,
many customers are already concerned with the data
collection practices related to loyalty programs [
        <xref ref-type="bibr" rid="ref11 ref8">8, 11</xref>
        ]. This
can be exacerbated when the loyalty program is an
application running on the customer’s own smartphone. These
devices contain a large amount of personal data such as the
customer’s phone number, e-mail address, and social
networking account details.
      </p>
      <p>
        Despite these privacy concerns, Mobile Shopping
Assistants (MSAs) are becoming increasingly popular due to the
benefits they o↵ er to both customers and retailers. An
MSA can enhance the shopping experience by incorporating
features such as loyalty programs, discount vouchers, easy
checkout, and various personalized services. The
applications are easy and inexpensive to roll out because they can
run on the customer’s own smartphone. The retailer does
not have to invest in specialized hardware and many
customers are already familiar with smartphones and the
concept of mobile apps. To address these privacy concerns, Put
et al. [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] have created inShopnito, a transparent,
privacypreserving MSA that still o↵ ers all the features that
customers and retailers have come to expect, including a
rudimentary recommender system. In this paper, we have
extended the MSA with an advanced, hybrid
recommendation strategy. Section 3 describes this contribution in detail.
As the security and privacy-enhancing technologies used for
(anonymous) authentication and transactions have already
been described [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], Section 2 of this paper provides only a
brief overview of the functionality and the implications of
privacy-preserving measures on recommendations.
2.
      </p>
      <p>PRIVACY-PRESERVING MOBILE
SHOPPING</p>
      <p>
        Preserving the customer’s privacy during the usage of
inShopnito is of primary importance, which has significant
implications for the recommender. At registration time, the
customer is issued an Idemix [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] anonymous credential
containing attributes with personal information such as name,
zip code, or gender. When the customer enters the store, the
inShopnito MSA uses the credential to initiate a new
shopping session on the store backend system. The customer
chooses which attributes (name, zip code, gender, explicit
profile) to disclose during this authentication phase. These
di↵ erent levels of privacy provide the customer the necessary
flexibility in the trade-o↵ between privacy and
personalization. The backend system knows that the customer has a
valid credential, and it knows the content of the attributes
that the customer opted to disclose. However, it does not
know which particular customer it is dealing with, because
no uniquely identifying information is disclosed during
authentication. This also means that a customer’s successive
shopping sessions can not be tied together.
      </p>
      <p>The customer can now proceed to scan products using the
camera of her smartphone and add them to the inShopnito
shopping cart. During checkout, inShopnito can be used to
redeem loyalty points and vouchers to get a discount. To
provide the customer with a complete overview of her
shopping history, the MSA stores this information securely on
the smartphone where it can be used for recommendation
purposes. In Section 3, we expand on the recommender
components of the inShopnito MSA and backend, and
propose a practical solution that preserves the privacy of the
customer while still o↵ering advanced personalized services.</p>
      <p>
        Recommender systems initially face the cold start
problem, because nothing is known about the user [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Usually,
a user’s actions can be tracked over time. As more
information about the user becomes available, the quality of the
recommendations increases. With inShopnito, each
shopping session is associated with a di↵erent, anonymous user
identifier. Thus, a server-side recommender system will
always have to address the cold start problem, whether it is
the customer’s first store visit, or her hundredth. Client-side
recommenders pose their own set of challenges [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>
        Related research [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] into privacy-preserving, personalized
ad delivery has proposed a coarse-grained filtering of ads
based on the personal information that customers choose
to disclose. Subsequently, a further filtering can be
performed at client side based on the purchase details stored
on the customer’s smartphone. Compared to existing
solutions, the hybrid recommender strategy of inShopnito goes
further than a filtering of information, by analyzing
individual shopping carts and comparing them with the purchases
of similar customers at the backend.
      </p>
      <sec id="sec-2-1">
        <title>HYBRID RECOMMENDATIONS</title>
        <p>The hybrid strategy combines five recommendation
approaches. For each approach, preserving the customer’s
privacy is of crucial importance. Figure 1 provides a schematic
overview of these approaches and the data they use.
3.1</p>
      </sec>
      <sec id="sec-2-2">
        <title>Explicit Profile Recommendations</title>
        <p>Through an explicit profile on her smartphone, the
customer can specify her preferred product categories, as shown
in Figure 2(a). These categories, grouping individual
products that are typically located in the same section of the
store, allow customers to quickly express their interests and
filter out irrelevant product groups. Product categories such
as pet supplies, garden tools, car/motorcycle supplies, toys,
or baby products, are not relevant for every customer. This
explicit profile is created automatically based on the
customer’s purchases, but can be altered at her own discretion.
Although the explicit profile contains only category
preferences and no details regarding individual products,
disclosing the explicit profile is an optional feature for privacy
reasons. In addition, customers can opt to disclose some
demographic data such as age, municipality, and gender, in
order to further filter the product categories such as shaving</p>
        <p>Customer</p>
        <p>Explicit Profile
Shopping Cart</p>
        <p>Personalized Vouchers</p>
        <p>Associated Products
Explicit Profile</p>
        <p>Shopping Cart</p>
        <sec id="sec-2-2-1">
          <title>Content-Based Detailed Profile</title>
          <p>Recommendation</p>
        </sec>
        <sec id="sec-2-2-2">
          <title>Purchase Pattern Shopping History</title>
          <p>Recommendation</p>
          <p>Serendipitous</p>
          <p>Products
Subset of Product Data</p>
          <p>Explicit Profile
Recommendation</p>
          <p>Shopping Cart
Recommendation
Similar Customer
Recommendation
Product Catalog
products, make-up, personal care products, etc.</p>
          <p>If the customer opts to disclose (parts of) her explicit
profile and demographic data, this information is sent to
the store backend and used to personalize the coupons and
vouchers she receives. These targeted vouchers have benefits
for the retailers (the vouchers are more e↵ective) as well as
for the customers (more relevant vouchers are o↵ered). For
privacy reasons, these explicit profiles are only used during
the current sessions and removed from the store backend
after issuing the vouchers.
3.2</p>
        </sec>
      </sec>
      <sec id="sec-2-3">
        <title>Shopping Cart Recommendations</title>
        <p>During every shopping session, the content of the shopping
cart is sent to the store backend for analysis. For privacy
reasons, no uniquely identifying reference to the customer
is stored at server side. Only the content of the
individual shopping carts, together with the date of the purchase,
are stored. The date provides useful information regarding
trends in purchasing behavior, or seasonal products. A
detailed timestamp with the exact moment of the purchase
(hours/minutes) would have no extra value for the
recommender and is omitted because this might induce a privacy
risk. If a customer’s time of purchase is known (e.g., by
observation) and the exact timestamp would be stored, linking
the content of the shopping cart to the customer’s identity
would be possible.</p>
        <p>Analysis of the content of the shopping carts of
di↵erent customers provides insight into the shopping habits of
the customers and reveals which products are often bought
together. For instance, customers will buy both pasta and
bolognese sauce if they intend to prepare spaghetti or lasagna.
Product association rules are used to discover which
products belong together. Interesting recommendations are
products that are not yet added to the shopping cart, but are
often bought in combination with the products that are in
the shopping cart. So, if bolognese sauce is in the shopping
cart, pasta is a good recommendation. More generally, the
best recommendation is the product, Y, with the highest
probability to be bought, given the current content of the
shopping cart, X. Here, X can be a single product or a set
of products that the customer wants to buy.</p>
        <p>However, highly popular products will always be bought
in combination with a large variety of other products, even
though no direct link (e.g., a recipe) exists between them.
The probability that the customer will buy these popular
products is always high, regardless of the content of the
shopping cart. In order to take into account the general
popularity of products, this probability, P (X, Y |X), is
normalized by dividing it by the probability of buying Y, if
the content of the shopping cart is di↵erent from X. The
products with the highest normalized probability are
recommended to the customer, as illustrated in Figure 2(b).</p>
        <p>Max
X⇢ Cart P (!X, Y |!X)</p>
        <p>P (X, Y |X)
=</p>
        <p>P (X,Y )</p>
        <p>Max P (X)
X⇢ Cart P (!X,Y )</p>
        <p>P (!X)
(1)</p>
        <p>In addition to these automatically derived combinations
of products using product association rules, domain
knowledge helps to recommend the best matching products. For
the shopping cart recommendations, the domain knowledge
consists of a set of recipes. If the customer’s shopping cart
already contains several products that match the ingredients
of a certain recipe, the missing ingredients are recommended
and the recipe is suggested to try out. Since these
recommendations do not require a user profile with an extensive
purchase history, they can help to overcome the cold start
problem.
3.3</p>
      </sec>
      <sec id="sec-2-4">
        <title>Similar Customer Recommendations</title>
        <p>Storing the customers’ individual consumption behavior
on a central server induces a privacy risk and is therefore
undesirable. With inShopnito, each shopping session has a
die↵rent, anonymous user identifier, and successive shopping
sessions cannot be linked (Section 2). Because
collaborative filtering is based on calculating the similarity between
the historical consumption behavior of individual users (or
products), a traditional collaborative filtering approach is
not possible in this situation.</p>
        <p>As an alternative, customers are compared based on their
explicit profile, which is voluntarily disclosed and contains
only data about product categories but not of individual
product purchases. Calculating the similarity between
customers based on their explicit profile might be less accurate
than based on their complete consumption behavior; but this
approach induces no privacy risk. Based on this explicit
shopping profile, customers are partitioned into groups of
similar customers, just as the neighborhoods of similar users
in the traditional collaborative filtering approach. Each
group is represented by a bucket that contains all products
that have been bought by the customers of that group.</p>
        <p>After every visit to the store, the content of the customer’s
shopping cart is added to the bucket of the customer’s group.
If two customers have a similar explicit profile, their
shopping carts will end up in the same bucket. Since the bucket
contains only product information and no link to the
identity of the customer, the purchasing history of an individual
customer cannot be deduced if the bucket groups purchases
of many customers. Analysis of the products in the bucket
of the customer allows to generate recommendations based
on what people who like similar products have bought in
the past. The products that are most popular with other
customers of the group are recommended, with the
exception of products that are already in the shopping cart of
the customer. The popularity of products within a group
is normalized with respect to the general popularity of a
product. These recommendations, based on the purchases
of similar customers, aim to o↵er more serendipitous
recommendations to the customers, just as collaborative filtering
algorithms do.</p>
        <p>This recommendation technique can also be combined with
the approach that compares shopping carts (Section 3.2).
Individual shopping carts (without a reference to the
customer’s identity) can be stored per group of similar
customers, as defined by the explicit profile. Subsequently,
product association rules can be applied on the groups of
similar customers, instead of on the complete population of
customers. This partitioning of customers according to their
preferences can help to refine the product association rules.
3.4</p>
      </sec>
      <sec id="sec-2-5">
        <title>Content-based Recommendations</title>
        <p>
          For privacy reasons, detailed historical information about
purchases cannot leave the secured environment of the
customer’s smartphone. As a result, these detailed purchase
data can only be exploited if the recommendation algorithm
runs on the customer’s smartphone. In this customer-centric
personalization approach [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ], each user has its own mobile
recommendation engine. Storing this detailed user profile
securely on the smartphone also has advantages. For instance,
the user profile can be shared amongst di↵erent shops
without the privacy risk that one retailer abuses these purchase
data for commercial profits.
        </p>
        <p>Since only purchase data of the target user (i.e. the user
for who recommendations are calculated) are available on
the smartphone, a content-based recommendation algorithm
is the most worthwhile solution to process this detailed
profile.</p>
        <p>
          Content-based recommendation algorithms determine the
products that best match the user’s profile, based on a
description of the product characteristics [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. Since the
detailed profile cannot leave the customer’s smartphone, the
product descriptions have to be transferred to the
smartphone for comparison with the detailed profile. However,
the complete product catalog of the store and the
corresponding descriptions can be quite extensive for processing
on a smartphone. Therefore, only products and descriptions
of categories that are relevant for the customer are sent to
the smartphone to reduce the data trac.
Recommendations for pet supplies may be irrelevant for customers who
have never bought any pet supplies in the past. They may
not have pets, or buy their supplies through other channels.
The explicit profile is used to determine which categories are
relevant and have to be considered. The resulting subset of
the product catalog has to be downloaded only once, the
first time that the customer visits the store. From then on,
updates of the catalog are sucient to keep track of new
products, changed descriptions, and products that are not
(a)
(b)
available anymore.
        </p>
        <p>
          Di↵erent types of content-based recommendation algorithms
can be used, but with the limitation that the
computational requirements must fit within the available resources of
the smartphone. Our approach uses the InterestLMS
algorithm of the Duine recommender framework [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ].
Contentbased algorithms often su↵er from over-specialization [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ],
since they recommend only products similar to those already
bought by the customers. In certain application domains,
items should not be recommended if they are too similar
to something the user has already seen, such as a di↵erent
news article describing the same event. For shops however,
various situations exist in which customers are interested
in similar products: cheaper or discounted products of a
die↵rent brand, new or similar food products to replenish
their house stock, or alternatives for products that are out
of stock.
3.5
        </p>
      </sec>
      <sec id="sec-2-6">
        <title>Purchase Pattern Recommendations</title>
        <p>
          The last type of recommendations focuses on the
repetitive purchase behavior of customers [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. Specific products,
such as toothpaste or co↵ee, are used on a regular basis,
and as a result, need to be replenished regularly. Patterns
in the purchase behavior can be detected, and used to
predict the next purchase of a certain product. E.g., if one
tube of toothpaste is bought every month, predicting the
next purchase of toothpaste is obvious.
        </p>
        <p>Based on the shopping history (i.e. the time and amount
of the last purchase), the recommender estimates if the
customer needs to buy a certain product. If this is the case,
and the customer has not yet added the product to the
shopping cart, it will be recommended. So, the aim of the
purchase pattern recommendations is to remind customers
to buy products that they might forget but probably need
because of their repetitive consumption behavior.</p>
      </sec>
      <sec id="sec-2-7">
        <title>CONCLUSIONS</title>
        <p>The growing importance of privacy in online services
emphasizes the need for privacy-preserving recommender
systems, not the least in the domain of shopping. Traditional
collaborative filtering algorithms, which rely on a central
storage and comparison of detailed user profiles, may induce
a privacy risk. But limiting the disclosed customer data
introduces a trade-o↵ between the accuracy of the
recommendations and the privacy of the customer. Therefore, we
present a privacy-preserving, hybrid strategy that combines
client-side and server-side recommendation techniques. At
server-side, the recommender is based on information that
customers opt to disclose, and performs an analysis of the
shopping cart using product association rules, and a
comparison with the shopping carts of similar customers. At
clientside, detailed customer information is used for content-based
recommendations and suggestions based on purchase
patterns.</p>
      </sec>
      <sec id="sec-2-8">
        <title>ACKNOWLEDGMENTS</title>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>G.</given-names>
            <surname>Adomavicius</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Tuzhilin</surname>
          </string-name>
          .
          <article-title>Personalization and recommender systems</article-title>
          . Tutorials in Operations Research, Informs, pages
          <fpage>55</fpage>
          -
          <lpage>107</lpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>H.</given-names>
            <surname>Baumgartner</surname>
          </string-name>
          .
          <article-title>Repetitive purchase behavior</article-title>
          . In A. Diamantopoulos,
          <string-name>
            <given-names>W.</given-names>
            <surname>Fritz</surname>
          </string-name>
          , and L. Hildebrandt, editors,
          <source>Quantitative Marketing and Marketing Management</source>
          , pages
          <fpage>269</fpage>
          -
          <lpage>286</lpage>
          . Gabler Verlag,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>L. N.</given-names>
            <surname>Cassel</surname>
          </string-name>
          and
          <string-name>
            <given-names>U.</given-names>
            <surname>Wolz</surname>
          </string-name>
          .
          <article-title>Client side personalization</article-title>
          .
          <source>In DELOS Workshop: Personalisation and Recommender Systems in Digital Libraries</source>
          , pages
          <fpage>8</fpage>
          -
          <lpage>12</lpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M.</given-names>
            <surname>Hardt</surname>
          </string-name>
          and
          <string-name>
            <given-names>S.</given-names>
            <surname>Nath</surname>
          </string-name>
          .
          <article-title>Privacy-aware personalization for mobile advertising</article-title>
          .
          <source>In Proceedings of the 2012 ACM Conference on Computer and Communications Security, CCS '12</source>
          , pages
          <fpage>662</fpage>
          -
          <lpage>673</lpage>
          , New York, NY, USA,
          <year>2012</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>IBM</given-names>
            <surname>Research Security Team</surname>
          </string-name>
          .
          <source>Specification of the Identity Mixer Cryptographic Library v. 2.3.4. Technical report</source>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>D.</given-names>
            <surname>Jannach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zanker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Felfernig</surname>
          </string-name>
          , and
          <string-name>
            <given-names>G.</given-names>
            <surname>Friedrich</surname>
          </string-name>
          .
          <source>Recommender Systems: An Introduction</source>
          . Cambridge University Press, New York, NY, USA, 1st edition,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>P.</given-names>
            <surname>Lops</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gemmis</surname>
          </string-name>
          , and
          <string-name>
            <given-names>G.</given-names>
            <surname>Semeraro</surname>
          </string-name>
          .
          <article-title>Content-based recommender systems: State of the art and trends</article-title>
          . In F. Ricci,
          <string-name>
            <given-names>L.</given-names>
            <surname>Rokach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Shapira</surname>
          </string-name>
          , and P. B. Kantor, editors,
          <source>Recommender Systems Handbook</source>
          , pages
          <fpage>73</fpage>
          -
          <lpage>105</lpage>
          . Springer US,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>V.</given-names>
            <surname>Pez</surname>
          </string-name>
          .
          <article-title>Negative e↵ects of loyalty programs: An empirical investigation on the french mobile phone sector</article-title>
          .
          <source>Technical report</source>
          , Universit´e Paris-Dauphine,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>A.</given-names>
            <surname>Put</surname>
          </string-name>
          , I. Dacosta,
          <string-name>
            <given-names>M.</given-names>
            <surname>Milutinovic</surname>
          </string-name>
          , B. De Decker,
          <string-name>
            <given-names>S.</given-names>
            <surname>Seys</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Boukayoua</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Naessens</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Vanhecke</surname>
          </string-name>
          , T. De Pessemier, and
          <string-name>
            <given-names>L.</given-names>
            <surname>Martens</surname>
          </string-name>
          .
          <article-title>inshopnito: An advanced yet privacy-friendly mobile shopping application</article-title>
          .
          <source>In Proceedings of the IEEE 10th World Congress on Services (SERVICES</source>
          <year>2014</year>
          ). IEEE,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Telematica</surname>
            <given-names>Instituut</given-names>
          </string-name>
          / Novay. Duine Framework,
          <year>2009</year>
          . Online available at http://duineframework.org/.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>S.</given-names>
            <surname>Worthington</surname>
          </string-name>
          and
          <string-name>
            <surname>J. Fear.</surname>
          </string-name>
          <article-title>The hidden side of loyalty card programs</article-title>
          .
          <source>The Austalian centre for retail studies</source>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>