Boosting Big Brother: Attacking Search Engines with Encodings

2Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

Abstract

Search engines are vulnerable to attacks against indexing and searching via text encoding manipulation. By imperceptibly perturbing text using uncommon encoded representations, adversaries can control results across search engines for specific search queries. We demonstrate that this attack is successful against two major commercial search engines - Google and Bing - and one open source search engine - Elasticsearch. We further demonstrate that this attack is successful against LLM chat search including Bing’s GPT-4 chatbot and Google’s Bard chatbot.We also present a variant of the attack targeting text summarization and plagiarism detection models, two ML tasks closely tied to search.We provide a set of defenses against these techniques and warn that adversaries can leverage these attacks to launch disinformation campaigns against unsuspecting users, motivating the need for search engine maintainers to patch deployed systems.

Cite

CITATION STYLE

APA

Boucher, N., Pajola, L., Shumailov, I., Anderson, R., & Conti, M. (2023). Boosting Big Brother: Attacking Search Engines with Encodings. In ACM International Conference Proceeding Series (pp. 700–713). Association for Computing Machinery. https://doi.org/10.1145/3607199.3607220

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free