scholarly journals Privacy-Preserving Loyalty Programs

Author(s):  
Alberto Blanco-Justicia ◽  
Josep Domingo-Ferrer
2021 ◽  
Vol 2021 (3) ◽  
pp. 289-307
Author(s):  
Saba Eskandarian

Abstract Loyalty programs in the form of punch cards that can be redeemed for benefits have long been a ubiquitous element of the consumer landscape. However, their increasingly popular digital equivalents, while providing more convenience and better bookkeeping, pose a considerable privacy risk. This paper introduces a privacy-preserving punch card protocol that allows firms to digitize their loyalty programs without forcing customers to submit to corporate surveillance. We also present a number of extensions that allow our scheme to provide other privacy-preserving customer loyalty features. Compared to the best prior work, we achieve a 14× reduction in the computation and a 11× reduction in the communication required to perform a “hole punch,” a 55× reduction in the communication required to redeem a punch card, and a 128× reduction in the computation time required to redeem a card. Much of our performance improvement can be attributed to removing the reliance on pairings or range proofs present in prior work, which has only addressed this problem in the context of more general loyalty systems. By tailoring our scheme to punch cards and related loyalty systems, we demonstrate that we can reduce communication and computation costs by orders of magnitude.


2021 ◽  
Vol 2021 (3) ◽  
pp. 95-121
Author(s):  
Aditya Damodaran ◽  
Alfredo Rial

Abstract Loyalty programs allow vendors to profile buyers based on their purchase histories, which can reveal privacy sensitive information. Existing privacy-friendly loyalty programs force buyers to choose whether their purchases are linkable. Moreover, vendors receive more purchase data than required for the sake of profiling. We propose a privacy-preserving loyalty program where purchases are always unlinkable, yet a vendor can profile a buyer based on her purchase history, which remains hidden from the vendor. Our protocol is based on a new building block, an unlinkable updatable hiding database (HD), which we define and construct. HD allows the vendor to initialize and update databases stored by buyers that contain their purchase histories and their accumulated loyalty points. Updates are unlinkable and, at each update, the database is hidden from the vendor. Buyers can neither modify the database nor use old versions of it. Our construction for HD is practical for large databases.


2012 ◽  
Vol 3 (3) ◽  
pp. 60-61
Author(s):  
V.Sajeev V.Sajeev ◽  
◽  
R.Gowthamani R.Gowthamani

Author(s):  
Haruna HIGO ◽  
Toshiyuki ISSHIKI ◽  
Kengo MORI ◽  
Satoshi OBANA

Author(s):  
S Durga Bhavani ◽  
◽  
Gudlanarva Sudhakar ◽  
Mohammad Almechal ◽  
◽  
...  
Keyword(s):  

2015 ◽  
Vol 2 (2) ◽  
pp. 22-30
Author(s):  
Lokanadham Naidu Vadlamudi ◽  
◽  
Srinivasulu Asadi ◽  

Sign in / Sign up

Export Citation Format

Share Document