首次对生成式OCR模型发起纯黑盒攻击,仅通过输出字符串就能触发严重识别错误。
Adversarial Attacks on Deep OCR Systems

- 将攻击转化为无梯度的零阶优化问题,仅依赖输出字符串反馈进行扰动
- 在Deep-OCR上成功实现不可察觉的干扰,导致重复、截断等严重识别失败
- 适用于安全评估人员,尤其关注生成式OCR系统鲁棒性与隐私泄露风险
深度文档识别模型Deep-OCR通过将视觉模态视为光学压缩媒介,实现了低标记成本的长上下文识别。然而其复杂性可能引入新的安全漏洞。本文首次提出纯黑盒对抗攻击,仅能查询解码后的字符串,无法获取梯度、logits或模型内部信息。我们将攻击建模为基于序列相似性的标量损失函数的零阶优化问题,并采用随机方向有限差分法估计梯度,查询代价与图像维度无关。通过带ℓ∞投影的Adam更新,生成了针对未定向和定向目标的不可察觉扰动。初步实验验证了攻击与评估流程的有效性,暴露出严重解码失败现象,包括重复、截断及提示泄露。结果还表明,可控定向重写仍远难于非定向破坏;我们未在预注册评估完成前宣称定向成功。
原文摘要 · Abstract (English)
Deep-OCR (DeepSeek-OCR) advances document recognition by treating the visual modality as an optical compression medium, enabling long-context OCR at low token cost. However, its increased complexity may introduce new security vulnerabilities. In this paper, we present, to the best of our knowledge, the first pure black-box adversarial attack against a generative OCR vision-language model, where only the decoded string can be queried and no gradients, logits, or model internals are available. We recast the attack as a zeroth-order optimization problem driven by a bounded scalar loss defined directly on the string output via sequence similarity, and estimate the gradient with a random-direction finite-difference scheme whose query cost is independent of the image dimension. An Adam update with ell_infinity projection yields imperceptible perturbations for both untargeted and targeted objectives. Pilot experiments on Deep-OCR validate the string-only attack and evaluation pipeline and expose severe qualitative decoder failures, including repetition, truncation, and prompt leakage. They also show that controlled targeted rewriting remains substantially harder than untargeted degradation; we avoid claiming targeted success until the pre-registered evaluation is complete.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。