mlsanityData to 14 Oct 2026

Exploiting and Defending Against the Approximate Linearity of Apple's NeuralHash

arXiv 2207.14258 ↗First posted 28 Jul 2022cs.CR cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Perceptual hashes map images with identical semantic content to the same n-bit hash value, while mapping semantically-different images to different hashes. These algorithms carry important applications in cybersecurity such as copyright infringement detection, content fingerprinting, and surveillance. Apple's NeuralHash is one such system that aims to detect the presence of illegal content on users' devices without compromising consumer privacy. We make the surprising discovery that NeuralHash is approximately linear, which inspires the development of novel black-box attacks that can (i) evade detection of "illegal" images, (ii) generate near-collisions, and (iii) leak information about hashed images, all without access to model parameters. These vulnerabilities pose serious threats to NeuralHash's security goals; to address them, we propose a simple fix using classical cryptographic standards.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 5 of its 18 references that are in the map. First posted on arXiv 28 Jul 2022.

Builds on

5 of 18 references.

References · 5

  1. 2014Explaining and Harnessing Adversarial Examplescited by 7,364
  2. 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,845
  3. 2019Adversarial Examples Are Not Bugs, They Are Featurescited by 953
  4. 2021Learning to Break Deep Perceptual Hashing: The Use Case NeuralHashcited by 25
  5. 2021Bugs in our Pockets: The Risks of Client-Side Scanningcited by 6

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.