Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > eess > arXiv:2509.14959

Help | Advanced Search

Electrical Engineering and Systems Science > Audio and Speech Processing

arXiv:2509.14959 (eess)
[Submitted on 18 Sep 2025 ]

Title: Discrete optimal transport is a strong audio adversarial attack

Title: 离散最优传输是一种强大的音频对抗攻击

Authors:Anton Selitskiy, Akib Shahriyar, Jishnuraj Prakasan
Abstract: In this paper, we show that discrete optimal transport (DOT) is an effective black-box adversarial attack against modern audio anti-spoofing countermeasures (CMs). Our attack operates as a post-processing, distribution-alignment step: frame-level WavLM embeddings of generated speech are aligned to an unpaired bona fide pool via entropic OT and a top-$k$ barycentric projection, then decoded with a neural vocoder. Evaluated on ASVspoof2019 and ASVspoof5 with AASIST baselines, DOT yields consistently high equal error rate (EER) across datasets and remains competitive after CM fine-tuning, outperforming several conventional attacks in cross-dataset transfer. Ablation analysis highlights the practical impact of vocoder overlap. Results indicate that distribution-level alignment is a powerful and stable attack surface for deployed CMs.
Abstract: 在本文中,我们表明离散最优传输(DOT)是对现代音频防欺骗对策(CMs)的有效黑盒对抗攻击。 我们的攻击作为一个后处理、分布对齐步骤运行:通过熵最优传输和一个 top-$k$重心投影,将生成语音的帧级 WavLM 嵌入对齐到一个无配对的真品池,然后通过神经声码器解码。 在 ASVspoof2019 和 ASVspoof5 上使用 AASIST 基线进行评估,DOT 在不同数据集上始终表现出较高的等错误率(EER),并且在 CM 微调后仍具有竞争力,在跨数据集迁移中优于几种传统攻击。 消融分析突出了声码器重叠的实际影响。 结果表明,分布级对齐是部署的 CMs 的强大且稳定的攻击面。
Subjects: Audio and Speech Processing (eess.AS) ; Artificial Intelligence (cs.AI)
Cite as: arXiv:2509.14959 [eess.AS]
  (or arXiv:2509.14959v1 [eess.AS] for this version)
  https://doi.org/10.48550/arXiv.2509.14959
arXiv-issued DOI via DataCite

Submission history

From: Anton Selitskiy [view email]
[v1] Thu, 18 Sep 2025 13:46:16 UTC (1,013 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
eess.AS
< prev   |   next >
new | recent | 2025-09
Change to browse by:
cs
cs.AI
eess

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号