Privacy-preserving webshopping with attributes

被引:6
|
作者
Hampiholi, Brinda [1 ]
Alpar, Gergely [1 ,2 ]
机构
[1] Radboud Univ Nijmegen, Nijmegen, Netherlands
[2] Open Univ, Heerlen, Netherlands
关键词
webshopping; purchaser privacy; attribute-based credentials; data minimization; unlinkability;
D O I
10.1109/PAC.2017.34
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Online shopping is one of the most important applications on the Internet and it is one that has been steadily growing over the last decade. With increasing numbers of online shopping transactions there are also raising concerns over privacy and protection of the customer data collected by the webshops. This is why, we need privacy-preserving technologies for online shopping, in the interest of both users and businesses. To design shopping transactions where privacy is one of the main design considerations, we propose to use attributes. Attributes are pieces of data about an entity that are authenticated by some party. Attribute-based technologies go back more than a decade and they have mainly been used for access control, identity management and encryption. In this paper, however, we demonstrate that they can naturally be employed for various transactions in electronic commerce. In particular, we propose a cryptographic webshopping scheme based on attribute-based credentials. It preserves the functional and security properties required in practice for webshopping, while providing much more privacy for the purchasers. Privacy in this context is defined in terms of data minimization and unlinkability: Purchasers reveal exactly as much information as required in each transaction while leaving no traces that can be linked to their other transactions. In our scheme, a webshop does not learn a purchaser's identity, her financial information (e.g. credit card number or account number) or shipping details (e.g. house address). A bank that processes the payment does not learn the relationship between webshops and purchasers.
引用
收藏
页码:25 / 36
页数:12
相关论文
共 50 条
  • [1] Private attributes: The meanings and mechanisms of "privacy-preserving" adtech
    McGuigan, Lee
    Sivan-Sevilla, Ido
    Parham, Patrick
    Shvartzshnaider, Yan
    [J]. NEW MEDIA & SOCIETY, 2023,
  • [2] Human Attributes Prediction Under Privacy-preserving Conditions
    Singh, Anshu
    Fan, Shaojing
    Kankanhalli, Mohan
    [J]. PROCEEDINGS OF THE 29TH ACM INTERNATIONAL CONFERENCE ON MULTIMEDIA, MM 2021, 2021, : 4698 - 4706
  • [3] Privacy-Preserving Data Publishing for Multiple Numerical Sensitive Attributes
    Qinghai Liu
    Hong Shen
    Yingpeng Sang
    [J]. Tsinghua Science and Technology, 2015, 20 (03) : 246 - 254
  • [4] Privacy-Preserving Data Publishing for Multiple Numerical Sensitive Attributes
    Liu, Qinghai
    Shen, Hong
    Sang, Yingpeng
    [J]. TSINGHUA SCIENCE AND TECHNOLOGY, 2015, 20 (03) : 246 - 254
  • [5] A privacy-preserving method for publishing data with multiple sensitive attributes
    Yi, Tong
    Shi, Minyong
    Shang, Wenqian
    Zhu, Haibin
    [J]. CAAI TRANSACTIONS ON INTELLIGENCE TECHNOLOGY, 2024, 9 (01) : 222 - 238
  • [6] Research on personalised privacy-preserving model of multi-sensitive attributes
    Kang, Haiyan
    Feng, Yaping
    Si, Xiameng
    Lu, Kaili
    [J]. INTERNATIONAL JOURNAL OF INTERNET PROTOCOL TECHNOLOGY, 2023, 16 (01) : 58 - 67
  • [7] Privacy-Preserving Distributed Decision Tree Learning with Boolean Class Attributes
    Kikuchi, Hiroaki
    Ito, Kouichi
    Ushida, Mebae
    Tsuda, Hiroshi
    Yamaoka, Yuji
    [J]. 2013 IEEE 27TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS (AINA), 2013, : 538 - 545
  • [8] Privacy-preserving boosting
    Gambs, Sebastien
    Kegl, Balazs
    Aimeur, Esma
    [J]. DATA MINING AND KNOWLEDGE DISCOVERY, 2007, 14 (01) : 131 - 170
  • [9] Privacy-preserving boosting
    Sébastien Gambs
    Balázs Kégl
    Esma Aïmeur
    [J]. Data Mining and Knowledge Discovery, 2007, 14 : 131 - 170
  • [10] Privacy-Preserving Polling
    Shasha, Dennis
    [J]. COMMUNICATIONS OF THE ACM, 2020, 63 (10) : 108 - +