ObliviAd: Provably Secure and Practical Online Behavioral Advertising

被引:55
|
作者
Backes, Michael
Kate, Aniket
Maffei, Matteo
Pecina, Kim
机构
关键词
PERFORMANCE;
D O I
10.1109/SP.2012.25
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Online behavioral advertising (OBA) involves the tracking of web users' online activities in order to deliver tailored advertisements. OBA has become a rapidly increasing source of revenue for a number of web services, and it is typically conducted by third-party data analytics firms such as brokers, which track user behaviors across web-sessions using mechanisms such as persistent cookies. This practice raises significant privacy concerns among users and privacy advocates alike. Therefore, the task of designing OBA systems that do not reveal user profiles to third parties has been receiving growing interest from the research community. Nevertheless, existing solutions are not ideal for privacy preserving OBA: some of them do not provide adequate privacy to users or adequate targeting information to brokers, while others require trusted third parties that are difficult to realize. In this paper, we propose ObliviAd,(1) a provably secure architecture for privacy preserving OBA. The distinguishing features of our approach are the usage of secure hardware-based private information retrieval for distributing advertisements and high-latency mixing of electronic tokens for billing advertisers without disclosing any information about client profiles to brokers. ObliviAd does not assume any trusted party and provides brokers an economical alternative that preserves the privacy of users without hampering the precision of ads selection. We present the first formal security definitions for OBA systems (namely, profile privacy, profile unlinkability, and billing correctness) and conduct a formal security analysis of ObliviAd using ProVerif, an automated cryptographic protocol verifier, establishing the aforementioned security properties against a strong adversarial model. Finally, we demonstrated the practicality of our approach with an experimental evaluation.
引用
收藏
页码:257 / 271
页数:15
相关论文
共 50 条
  • [21] Communicating Algorithmic Process in Online Behavioral Advertising
    Eslami, Motahhare
    Kumaran, Sneha R. Krishna
    Sandvig, Christian
    Karahalios, Karrie
    PROCEEDINGS OF THE 2018 CHI CONFERENCE ON HUMAN FACTORS IN COMPUTING SYSTEMS (CHI 2018), 2018,
  • [22] A system using provably strong cryptography is probably not secure: Some practical attacks
    Burman, S
    IETE TECHNICAL REVIEW, 2002, 19 (04): : 161 - 168
  • [23] Provably secure E-cash system with practical and efficient complete tracing
    Lian, Bin
    Chen, Gongliang
    Li, Jianhua
    INTERNATIONAL JOURNAL OF INFORMATION SECURITY, 2014, 13 (03) : 271 - 289
  • [24] Online Behavioral Advertising (OBA) with Privacy Protection
    Vuppalapati, Nihar
    Park, Joon S.
    2014 WORLD CONGRESS ON INTERNET SECURITY (WORLDCIS), 2014, : 60 - 65
  • [25] An Enhanced Model for Behavioral Targeting in Online Advertising
    Radhika, V. M.
    Thottungal, Aiswarya
    Nizar, Abdul M.
    PROCEEDINGS OF THE 2016 INTERNATIONAL CONFERENCE ON DATA SCIENCE & ENGINEERING (ICDSE), 2016, : 173 - 177
  • [26] Legal Solution to Online Behavioral Targeting Advertising
    Zhang Weiwan
    Zhu Linbin
    Yan Dongsheng
    PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON PRODUCT INNOVATION MANAGEMENT, VOLS I AND II, 2009, : 1480 - 1484
  • [27] Practical and Provably Secure Distributed Aggregation: Verifiable Additive Homomorphic Secret Sharing
    Tsaloli, Georgia
    Banegas, Gustavo
    Mitrokotsa, Aikaterini
    CRYPTOGRAPHY, 2020, 4 (03) : 1 - 22
  • [28] A practical and provably secure scheme for publicly verifiable secret sharing and its applications
    Fujisaki, E
    Okamoto, T
    ADVANCES IN CRYPTOLOGY - EUROCRYPT '98, 1998, 1403 : 32 - 46
  • [29] Practical Data Outsourcing Framework with Provably Secure Deduplication in Untrusted Remote Storage
    Koo, Dongyoung
    Shin, Youngjoo
    Hur, Junbeom
    2017 INTERNATIONAL CONFERENCE ON PLATFORM TECHNOLOGY AND SERVICE (PLATCON), 2017, : 23 - 27
  • [30] Practical and provably-secure multicasting over high-delay networks
    Nam, JY
    Kim, H
    Kim, S
    Won, D
    Yang, HK
    COMPUTATIONAL SCIENCE - ICCS 2005, PT 2, 2005, 3515 : 493 - 501