Unlinkable Updatable Hiding Databases and Privacy-Preserving Loyalty Programs

Author:

Damodaran Aditya1,Rial Alfredo1

Affiliation:

1. SnT, University of Luxembourg , Esch-sur-Alzette , Luxembourg .

Abstract

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.

Publisher

Walter de Gruyter GmbH

Subject

General Medicine

Reference32 articles.

1. [1] Masayuki Abe, Jens Groth, Kristiyan Haralambiev, and Miyako Ohkubo. Optimal structure-preserving signatures in asymmetric bilinear groups. In CRYPTO 2011, pages 649–666.

2. [2] Joseph A. Akinyele, Christina Garman, Ian Miers, Matthew W. Pagano, Michael Rushanan, Matthew Green, and Aviel D. Rubin. Charm: a framework for rapidly prototyping cryptosystems. J. Cryptographic Engineering, 3(2):111–128, 2013.

3. [3] Roy L Anderson, Joan M Ziegler, and Jacob Y Wong. Anonymous merchandise delivery system, 2010. US Patent 7,693,798.

4. [4] Alberto Blanco-Justicia and Josep Domingo-Ferrer. Privacy-preserving loyalty programs. In DPM 2014, SETOP 2014, QASA 2014, pages 133–146.

5. [5] Johannes Blömer, Jan Bobolz, Denis Diemert, and Fabian Eidens. Updatable anonymous credentials and applications to incentive systems. In ACM CCS 2019, pages 1671–1685.

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Personalized Outsourced Privacy-preserving Database Updates for Crowd-sensed Dynamic Spectrum Access;2022 IEEE 21st Mediterranean Electrotechnical Conference (MELECON);2022-06-14

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3