Papers › Spoofing-Robust Speaker Verification Based on Time-Domain Embedding

Spoofing-Robust Speaker Verification Based on Time-Domain Embedding

12 Dec 2024Cyber Security, Cryptology, and Machine Learning 2024 12archive 2025-07-28

Avishai Weizman, Yehuda Ben-Shimol, Itshak Lapidot

Spoofing-robust speaker verification technology serves to safeguard voice-based authentication systems from fraudulent attempts. Such a system should be capable of detecting spoofed voice segments and verifying voice segments identified as genuine as originating from the real speaker. This research employs an understandable and explainable embedding based on the probability mass function of waveform amplitudes in the time domain. The results demonstrate that the performance of the countermeasure (CM) system is enhanced when it is gender dependent. The ASVspoof2019 challenge, logical access (LA) database was employed for evaluation purposes. The CM system demonstrated an equal error rate (EER) of 9.2% on the evaluation set for the male gender, with an EER of 10.1% for the female gender. In contrast, a gender-independent CM system exhibited an EER of 10.2%. The system’s performance, as quantified by the detection cost function for tandem assessment (t-DCF), is 0.262 for the gender-dependent system and 0.328 for the gender-independent system.

Code

No code repository is listed for this paper in the archive or in Syntology's graph.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Results from the paper archive 2025-07-28

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections