Advertisement

In Search of Search Privacy

  • Wesley Brandi
  • Martin S. Olivier
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6264)

Abstract

We present findings from an analysis of a database released by an online search provider in 2006. We show that there exists a significantly large number of queries which are shared by users when searching on the Web today. We then propose a network which uses shared queries to preserve the privacy of its participants.

Keywords

Search Engine Search Query Distribute Hash Table Privacy Preserve Privacy Violation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aberer, K.: P-Grid: A Self-Organizing Access Structure for P2P Information Systems. In: Batini, C., Giunchiglia, F., Giorgini, P., Mecella, M. (eds.) CoopIS 2001. LNCS, vol. 2172, pp. 179–194. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  2. 2.
    Adar, E.: User 4xxxxx9: Anonymizing query logs. In: Amitay, E., Murray, C.G., Teevan, J. (eds.) Query Log Analysis: Social And Technological Challenges. A workshop at the 16th International World Wide Web Conference (WWW 2007) (May 2007)Google Scholar
  3. 3.
    Araújo, F.: Position-Based Distributed Hash Tables. PhD thesis, Department of Informatics, University of Lisbon, DI/FCUL TR-06-7 (May 2006)Google Scholar
  4. 4.
    Bellotti, V., Sellen, A.: Design for Privacy in Ubiquitous Computing Environments. In: Proceedings of the Third European Conference on Computer Supported Cooperative Work (ECSCW’93), pp. 77–92. Kluwer, Dordrecht (1993)Google Scholar
  5. 5.
    Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems 30(1-7), 107–117 (1998)CrossRefGoogle Scholar
  6. 6.
    Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM 4(2) (February 1981)Google Scholar
  7. 7.
    Dingledine, R., Mathewson, N., Syverson, P.: Tor: The second-generation onion router. In: Proceedings of the 13th USENIX Security Symposium (August 2004)Google Scholar
  8. 8.
    Garcés-Erice, L., Ross, K.W., Biersack, E.W., Felber, P., Urvoy-Keller, G.: Topology-centric look-up service. Networked Group Communication, 58–69 (2003)Google Scholar
  9. 9.
    Goldberg, I., Wagner, D., Brewer, E.: Privacy-enhancing technologies for the internet. In: Proc. of 42nd IEEE Spring COMPCON. IEEE Computer Society Press, Los Alamitos (February 1997)Google Scholar
  10. 10.
    Karger, D., Lehman, E., Leighton, T., Levine, M., Lewin, D., Panigrahy, R.: Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In: ACM Symposium on Theory of Computing, pp. 654–663 (May 1997)Google Scholar
  11. 11.
    Korolova, A., Kenthapadi, K., Mishra, N., Ntoulas, A.: Releasing search queries and clicks privately. In: 18th International World Wide Web Conference, WWW 2009 (April 2009)Google Scholar
  12. 12.
    Levine, B., Shields, C.: Hordes: A multicast based protocol for anonymity. Journal of Computer Security 10(3), 213–240 (2002)CrossRefGoogle Scholar
  13. 13.
    Øverlier, L., Syverson, P.: Locating hidden servers. In: Proceedings of the 2006 IEEE Symposium on Security and Privacy, May 2006, pp. 100–114. IEEE Computer Society, Los Alamitos (2006)Google Scholar
  14. 14.
    Pfitzmann, A., Koehntopp, M.: Anonymity, unobservability, and pseudonymity - A proposal for terminology. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, p. 1. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  15. 15.
    Pfitzmann, A., Waidner, M.: Networks without user observability. Computers and Security 2(6), 158–166 (1987)CrossRefGoogle Scholar
  16. 16.
    Reed, M.G., Syverson, P.F., Goldschlag, D.M.: Anonymous connections and onion routing. IEEE Journal on Selected Areas in Communications 16(4), 482–494 (1998)CrossRefGoogle Scholar
  17. 17.
    Reiter, M.K., Rubin, A.D.: Crowds: anonymity for Web transactions. ACM Transactions on Information and System Security 1(1), 66–92 (1998)CrossRefGoogle Scholar
  18. 18.
    Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), November 2001, pp. 329–350 (2001)Google Scholar
  19. 19.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of the ACM SIGCOMM ’01 Conference, San Diego, California (August 2001)Google Scholar
  20. 20.
    Wright, J., Stepney, S., Clark, J.A., Jacob, J.L.: Designing Anonymity - A Formal Basis for Identity Hiding. Internal yellow report, York University, York, UK (December 2004)Google Scholar
  21. 21.
    Zhao, B., Kubiatowicz, J., Joseph, A.D.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, University of California Berkeley, Electrical Engineering and Computer Science Department (April 2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Wesley Brandi
    • 1
  • Martin S. Olivier
    • 1
  1. 1.Information and Computer Security Architectures (ICSA) Research Group,Department of Computer ScienceUniversity of PretoriaPretoria

Personalised recommendations