LLM-Guided Program Evolution for Targeted Black-Box Attacks on Perceptual Hash Algorithms
A. Krylov, D. Rakhov, V. Veselova, D. Bolokhov, Oleg Y. Rogov
cs.CR
Submitted: 2026-07-13
Comments: 15 pages, 2 figures, 9 tables
Code: https://github.com/algorithmicsuperintelligence/openevolve
License: http://creativecommons.org/licenses/by-nc-sa/4.0/
The gist: Perceptual hash algorithms (PHAs) are widely deployed to detect image forgery under benign transformations, yet their robustness against adversarially chosen perturbations remains poorly understood
Terminology
Abstract
Perceptual hash algorithms (PHAs) are widely deployed to detect image forgery under benign transformations, yet their robustness against adversarially chosen perturbations remains poorly understood and rarely comes with provable guarantees. We propose a novel evolutionary framework based on GigaEvo and OpenEvolve for targeted second-image attacks on perceptual hash algorithms. We assess attack performance using a composite score that jointly accounts for the fraction of adversarial images whose normalized Hamming distance to the target hash falls below threshold p (Attack Success Rate), the number of queries issued to the hash function, and the L2 distortion relative to the original image. Experiments on four deployed PHAs (pHash, PDQ, PhotoDNA, NeuralHash) across 30 ImageNet image pairs demonstrate that our evolutionary approach achieves comparable or better ASR than existing black-box baselines using substantially fewer queries to the hash function, while simultaneously producing adversarial images with lower L2 distortion relative to the originals. The best evolved programs reduce the pre-defined composite attack score relative to the best optimized seed by 41.2% for NeuralHash, 38.3% for PDQ, 34.0% for pHash, and 8.1% for PhotoDNA. Unlike gradient-based methods, our framework requires no internal knowledge of PHA architectures and naturally handles the non-differentiable, discretized nature of hash outputs. These results reveal previously unreported vulnerabilities in widely deployed content-moderation pipelines and motivate the development of provably robust perceptual hashing 1schemes.
Sources
- Optuna: A Next-generation Hyperparameter Optimization Framework
- Adversarial collision attacks on image hashing functions
- Uncertainty Quantification for Regression using Proper Scoring Rules
- Simple Black-box Adversarial Attacks
- Black-box Adversarial Attacks with Limited Queries and Information
- GigaEvo: An Open Source Optimization Framework Powered By LLMs And Evolution Algorithms
- Adam: A Method for Stochastic Optimization
- Robustness of Practical Perceptual Hashing Algorithms to Hash-Evasion and Hash-Inversion Attacks
- AlphaEvolve: A coding agent for scientific and algorithmic discovery
- Tree-Structured Parzen Estimator: Understanding Its Algorithm Components and Their Roles for Better Empirical Performance
- The Unreasonable Effectiveness of Deep Features as a Perceptual Metric
Related papers
- SoK: AI-Augmented Binary Reversing
- Relaxed Sender Anonymity for CBDC Interbank Settlement: A Zero-Knowledge Approach on Permissioned EVM
- Calibration-Family Overfit: Why Trusted Sabotage Monitors Don't Transfer Across Lineages
- Efficient Fuzzy PSI under One-Sided Assumptions
- Sealing the Audit-Runtime Gap for LLM Skills
- Token Composition: A Graph Based on EVM Logs