TY - JOUR
T1 - Pri-RTB
T2 - Privacy-preserving real-time bidding for securing mobile advertisement in ubiquitous computing
AU - Deng, Erdong
AU - Zhang, Huajun
AU - Wu, Peilin
AU - Guo, Fei
AU - Liu, Zhen
AU - Zhu, Haojin
AU - Cao, Zhenfu
N1 - Publisher Copyright:
© 2019 Elsevier Inc.
PY - 2019/12
Y1 - 2019/12
N2 - Real-time bidding (RTB), one of the major trading mechanisms used for online advertising, allows the advertiser to make an impression-level bid decision. However, the security and privacy concerns of RTB are gaining increasing attention with the recent enforcement of the European Union General Data Protection Regulation (GDPR). In this study, we present a novel privacy-preserving RTB (Pri-RTB) protocol, which aims at preserving both data privacy and utility by performing additively homomorphic encryption on the user profile. To our knowledge, this is the first work to address the privacy issue of the RTB paradigm. We present a formal proof for the security of Pri-RTB under the assumption of the decisional Diffie–Hellman (DDH) problem. We analyze and elaborate the superiority of Pri-RTB over other related works. We also developed a prototype for Pri-RTB and conducted several experiments to evaluate its feasibility and efficiency under different parameters. Our experiments demonstrate that Pri-RTB can work highly efficiently in a practical setting (for example, a scenario with approximately 200 advertisers per auction).
AB - Real-time bidding (RTB), one of the major trading mechanisms used for online advertising, allows the advertiser to make an impression-level bid decision. However, the security and privacy concerns of RTB are gaining increasing attention with the recent enforcement of the European Union General Data Protection Regulation (GDPR). In this study, we present a novel privacy-preserving RTB (Pri-RTB) protocol, which aims at preserving both data privacy and utility by performing additively homomorphic encryption on the user profile. To our knowledge, this is the first work to address the privacy issue of the RTB paradigm. We present a formal proof for the security of Pri-RTB under the assumption of the decisional Diffie–Hellman (DDH) problem. We analyze and elaborate the superiority of Pri-RTB over other related works. We also developed a prototype for Pri-RTB and conducted several experiments to evaluate its feasibility and efficiency under different parameters. Our experiments demonstrate that Pri-RTB can work highly efficiently in a practical setting (for example, a scenario with approximately 200 advertisers per auction).
KW - Homomorphic encryption
KW - Online behavioral advertising
KW - Real-time bidding
UR - https://www.scopus.com/pages/publications/85069478375
U2 - 10.1016/j.ins.2019.07.034
DO - 10.1016/j.ins.2019.07.034
M3 - 文章
AN - SCOPUS:85069478375
SN - 0020-0255
VL - 504
SP - 354
EP - 371
JO - Information Sciences
JF - Information Sciences
ER -