ObliviAd: Provably Secure and Practical Online Behavioral Advertising

被引:55
作者
Backes, Michael
Kate, Aniket
Maffei, Matteo
Pecina, Kim
机构
来源
2012 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP) | 2012年
关键词
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
相关论文
共 46 条
  • [31] Komanduri S., 2011, CMUCYLAB11005
  • [32] Krishnamurthy B., 2009, Proceedings of the 18th international conference on World wide web, P541, DOI 10.1145/1526709.1526782
  • [33] A hierarchy of authentication specifications
    Lowe, G
    [J]. 10TH COMPUTER SECURITY FOUNDATIONS WORKSHOP, PROCEEDINGS, 1997, : 31 - 43
  • [34] Mayer J., DO NOT TRACK UNIVERS
  • [35] McCune JM, 2008, EUROSYS'08: PROCEEDINGS OF THE EUROSYS 2008 CONFERENCE, P315, DOI 10.1145/1357010.1352625
  • [36] McLachlan J, 2009, CCS'09: PROCEEDINGS OF THE 16TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P590
  • [37] Olumofin F., 2011, P INT C FIN CRYPT DA
  • [38] Perrig A., 2001, P INT PAR DISTR PROC, P170
  • [39] Reznichenko A, 2011, PROCEEDINGS OF THE 18TH ACM CONFERENCE ON COMPUTER & COMMUNICATIONS SECURITY (CCS 11), P667
  • [40] Shi E, 2011, LECT NOTES COMPUT SC, V7073, P197, DOI 10.1007/978-3-642-25385-0_11