skip to main content
10.1145/2457317.2457341acmotherconferencesArticle/Chapter ViewAbstractPublication PagesedbtConference Proceedingsconference-collections
research-article

A theoretical model for obfuscating web navigation trails

Published:18 March 2013Publication History

ABSTRACT

Information about consumer's web navigation trails are increasingly being collected, analyzed, and used to target them with advertisements. This information can be quite personal, indicating individuals' likes and dislikes, as well as current and long term needs. While the ability to effectively target advertisements helps keep many sites and services on the web available freely, this practice has also raised privacy concerns. These concerns concern multiple factors: lack of transparency by the data aggregators and lack of control by the consumers. One viable approach that individuals can take to regain control is obfuscation, whereby real user requests are masked via the injection of noisy requests. In this paper, we describe a theoretical model and design for a web browser extension that relies on a trusted third party to generate fake HTTP requests (dummies). The dummy requests are generated as k different users' profiles surfing in parallel with the actual user. The value of k can be adjusted by the user to achieve the level of obfuscation they are comfortable with.

References

  1. B. Krishnamurthy and C. Wills, "Privacy diffusion on the web: A longitudinal perspective," in Proceedings of the 18th international conference on World wide web, 2009, pp. 541--550. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. B. Krishnamurthy, K. Naryshkin, and C. Wills, "Privacy leakage vs. protection measures: the growing disconnect," in Web 2.0 Security and Privacy Workshop, 2011.Google ScholarGoogle Scholar
  3. R. K. Miller, The 2007 Entertainment, Media & Advertising Market Research Handbook. Richard K Miller & Associates, 2007.Google ScholarGoogle Scholar
  4. A. Klever, Behavioural Targeting: An Online Analysis for Efficient Media Planning? Diplomica Verlag, 2009.Google ScholarGoogle Scholar
  5. B. Krishnamurthy, "I know what you will do next summer," ACM SIGCOMM Computer Communication Review, vol. 40, no. 5, pp. 65--70, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. Rosen, "Who Do Online Advertisers Think You Are?," The New York Times, Nov. 2012.Google ScholarGoogle Scholar
  7. J. Domingo-Ferrer, A. Solanas, and J. Castellà-Roca, "h(k)-private information retrieval from privacy-uncooperative queryable databases," Online Information Review, vol. 33, no. 4, pp. 720--744, 2009.Google ScholarGoogle ScholarCross RefCross Ref
  8. M. Murugesan and C. Clifton, "Providing privacy through plausibly deniable search," in Proceedings of the 9th SIAM International Conference on Data Mining (SDM), 2009, pp. 768--779.Google ScholarGoogle Scholar
  9. D. Rebollo-Monedero and J. Forne, "Optimized Query Forgery for Private Information Retrieval," IEEE Transactions on Information Theory, vol. 56, no. 9, pp. 4631--4642, Sep. 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. B. Shapira, Y. Elovici, A. Meshiach, and T. Kuflik, "PRAW---A PRivAcy model for the Web: Research Articles," J. Am. Soc. Inf. Sci. Technol., vol. 56, no. 2, pp. 159--172, Jan. 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. S. Ye, F. Wu, R. Pandey, and H. Chen, "Noise injection for search privacy protection," in Computational Science and Engineering, 2009. CSE'09. International Conference on, 2009, vol. 3, pp. 1--8. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. D. C. Howe and H. Nissenbaum, "TrackMeNot: Resisting surveillance in web search," Lessons from the Identity Trail: Anonymity, Privacy, and Identity in a Networked Society, pp. 417--436, 2009.Google ScholarGoogle Scholar
  13. H. H. Pang, X. Xiao, and J. Shen, "Obfuscating the Topical Intention in Enterprise Text Search," in 2012 IEEE 28th International Conference on Data Engineering (ICDE), 2012, pp. 1168--1179. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. R. Dingledine, N. Mathewson, and P. Syverson, "Tor: The second-generation onion router," DTIC Document, 2004.Google ScholarGoogle Scholar
  15. S. L. Blond, P. Manils, C. Abdelberi, M. A. D. Kaafar, C. Castelluccia, A. Legout, and W. Dabbous, "One bad apple spoils the bunch: Exploiting P2P applications to trace and profile tor users," arXiv preprint arXiv:1103.1518, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Federal Trade Commission, "Protecting Consumer Privacy in an Era of Rapid Change: Recommendations for Businesses and Policymakers," FTC Privacy Report, Mar. 2012.Google ScholarGoogle Scholar
  17. L. A. Adamic and B. A. Huberman, "The Web's hidden order," Communications of the ACM, vol. 44, no. 9, pp. 55--60, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. D. Olmedilla, E. Frías-Martínez, and R. Lara, "Mobile web profiling: A study of off-portal surfing habits of mobile users," User Modeling, Adaptation, and Personalization, pp. 339--350, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. E. Balsa, C. Troncoso, and C. Diaz, "OB-PWS: Obfuscation-Based Private Web Search," in Security and Privacy (SP), 2012 IEEE Symposium on, 2012, pp. 491--505. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. S. T. Peddinti and N. Saxena, "On the privacy of web search based on query obfuscation: a case study of TrackMeNot," in Proceedings of the 10th international conference on Privacy enhancing technologies, Berlin, Heidelberg, 2010, pp. 19--37. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. M. Hartmann and D. Schreiber, "Prediction algorithms for user actions," Proceedings of Lernen Wissen Adaption, ABIS, pp. 349--354, 2007.Google ScholarGoogle Scholar
  22. S. Sigg, D. Gordon, G. von Zengen, M. Beigl, S. Haseloff, and K. David, "Investigation of Context Prediction Accuracy for Different Context Abstraction Levels," IEEE Transactions on Mobile Computing, vol. 11, no. 6, pp. 1047--1059, Jun. 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. W. Ali, S. M. Shamsuddin, and A. S. Ismail, "A survey of Web caching and prefetching," Int. J. Advance. Soft Comput. Appl, vol. 3, no. 1, pp. 18--44, 2011.Google ScholarGoogle Scholar
  24. T. Palpanas and A. Mendelzon, Web prefetching using partial match prediction. University of Toronto, Department of Computer Science, 1998.Google ScholarGoogle Scholar
  25. Z. Ban, Z. Gu, and Y. Jin, "A PPM Prediction Model Based on Stochastic Gradient Descent for Web Prefetching," in 22nd International Conference on Advanced Information Networking and Applications, 2008. AINA 2008, 2008, pp. 166--173. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. I. Burbey and T. L. Martin, "Predicting future locations using prediction-by-partial-match," in Proceedings of the first ACM international workshop on Mobile entity localization and tracking in GPS-less environments, 2008, pp. 1--6. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Q. Liu, "Web latency reduction with prefetching," THE UNIVERSITY OF WESTERN ONTARIO, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. F. Khalil, J. Li, and H. Wang, "An integrated model for next page access prediction," International Journal of Knowledge and Web Intelligence, vol. 1, no. 1, pp. 48--80, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A theoretical model for obfuscating web navigation trails

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Other conferences
        EDBT '13: Proceedings of the Joint EDBT/ICDT 2013 Workshops
        March 2013
        423 pages
        ISBN:9781450315999
        DOI:10.1145/2457317

        Copyright © 2013 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 18 March 2013

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        EDBT '13 Paper Acceptance Rate7of10submissions,70%Overall Acceptance Rate7of10submissions,70%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader