Speaker anonymisation using the McAdams coefficient

• URL: http://arxiv.org/abs/2011.01130v2
• Date: Wed, 1 Sep 2021 14:28:56 GMT
• Title: Speaker anonymisation using the McAdams coefficient
• Authors: Jose Patino, Natalia Tomashenko, Massimiliano Todisco, Andreas Nautsch, Nicholas Evans
• Abstract summary: This paper reports an approach to anonymisation that, unlike other current approaches, requires no training data. The proposed solution uses the McAdams coefficient to transform the spectral envelope of speech signals. Results show that random, optimised transformations can outperform competing solutions in terms of anonymisation.
• Score: 19.168733328810962
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Anonymisation has the goal of manipulating speech signals in order to degrade the reliability of automatic approaches to speaker recognition, while preserving other aspects of speech, such as those relating to intelligibility and naturalness. This paper reports an approach to anonymisation that, unlike other current approaches, requires no training data, is based upon well-known signal processing techniques and is both efficient and effective. The proposed solution uses the McAdams coefficient to transform the spectral envelope of speech signals. Results derived using common VoicePrivacy 2020 databases and protocols show that random, optimised transformations can outperform competing solutions in terms of anonymisation while causing only modest, additional degradations to intelligibility, even in the case of a semi-informed privacy adversary.

Related papers

• A Benchmark for Multi-speaker Anonymization [9.990701310620368]
  We present an attempt to provide a multi-speaker anonymization benchmark for real-world applications. A cascaded system uses speaker diarization to aggregate the speech of each speaker and speaker anonymization to conceal speaker privacy and preserve speech content. Experiments conducted on both non-overlap simulated and real-world datasets demonstrate the effectiveness of the multi-speaker anonymization system.
  arXiv  Detail & Related papers  (2024-07-08T04:48:43Z)
• TernaryVote: Differentially Private, Communication Efficient, and Byzantine Resilient Distributed Optimization on Heterogeneous Data [50.797729676285876]
  We propose TernaryVote, which combines a ternary compressor and the majority vote mechanism to realize differential privacy, gradient compression, and Byzantine resilience simultaneously. We theoretically quantify the privacy guarantee through the lens of the emerging f-differential privacy (DP) and the Byzantine resilience of the proposed algorithm.
  arXiv  Detail & Related papers  (2024-02-16T16:41:14Z)
• Anonymizing Speech: Evaluating and Designing Speaker Anonymization Techniques [1.2691047660244337]
  The growing use of voice user interfaces has led to a surge in the collection and storage of speech data. This thesis proposes solutions for anonymizing speech and evaluating the degree of the anonymization.
  arXiv  Detail & Related papers  (2023-08-05T16:14:17Z)
• Adversarial Representation Learning for Robust Privacy Preservation in Audio [11.409577482625053]
  Sound event detection systems may inadvertently reveal sensitive information about users or their surroundings. We propose a novel adversarial training method for learning representations of audio recordings. The proposed method is evaluated against a baseline approach with no privacy measures and a prior adversarial training method.
  arXiv  Detail & Related papers  (2023-04-29T08:39:55Z)
• Breaking the Communication-Privacy-Accuracy Tradeoff with $f$-Differential Privacy [51.11280118806893]
  We consider a federated data analytics problem in which a server coordinates the collaborative data analysis of multiple users with privacy concerns and limited communication capability. We study the local differential privacy guarantees of discrete-valued mechanisms with finite output space through the lens of $f$-differential privacy (DP) More specifically, we advance the existing literature by deriving tight $f$-DP guarantees for a variety of discrete-valued mechanisms.
  arXiv  Detail & Related papers  (2023-02-19T16:58:53Z)
• V-Cloak: Intelligibility-, Naturalness- & Timbre-Preserving Real-Time Voice Anonymization [0.0]
  We develop a voice anonymization system, named V-Cloak, which attains real-time voice anonymization. Our designed anonymizer features a one-shot generative model that modulates the features of the original audio at different frequency levels. Experiment results confirm that V-Cloak outperforms five baselines in terms of anonymity performance.
  arXiv  Detail & Related papers  (2022-10-27T02:58:57Z)
• Improving Security in McAdams Coefficient-Based Speaker Anonymization by Watermarking Method [8.684378639046642]
  We propose a method to improve the security for speaker anonymization based on the McAdams coefficient. The proposed method consists of two main processes: one for embedding and one for detection.
  arXiv  Detail & Related papers  (2021-07-15T09:56:08Z)
• Towards Robust Speech-to-Text Adversarial Attack [78.5097679815944]
  This paper introduces a novel adversarial algorithm for attacking the state-of-the-art speech-to-text systems, namely DeepSpeech, Kaldi, and Lingvo. Our approach is based on developing an extension for the conventional distortion condition of the adversarial optimization formulation. Minimizing over this metric, which measures the discrepancies between original and adversarial samples' distributions, contributes to crafting signals very close to the subspace of legitimate speech recordings.
  arXiv  Detail & Related papers  (2021-03-15T01:51:41Z)
• Speaker De-identification System using Autoencoders and Adversarial Training [58.720142291102135]
  We propose a speaker de-identification system based on adversarial training and autoencoders. Experimental results show that combining adversarial learning and autoencoders increase the equal error rate of a speaker verification system.
  arXiv  Detail & Related papers  (2020-11-09T19:22:05Z)
• Class-Conditional Defense GAN Against End-to-End Speech Attacks [82.21746840893658]
  We propose a novel approach against end-to-end adversarial attacks developed to fool advanced speech-to-text systems such as DeepSpeech and Lingvo. Unlike conventional defense approaches, the proposed approach does not directly employ low-level transformations such as autoencoding a given input signal. Our defense-GAN considerably outperforms conventional defense algorithms in terms of word error rate and sentence level recognition accuracy.
  arXiv  Detail & Related papers  (2020-10-22T00:02:02Z)
• Design Choices for X-vector Based Speaker Anonymization [48.46018902334472]
  We present a flexible pseudo-speaker selection technique as a baseline for the first VoicePrivacy Challenge. Experiments are performed using datasets derived from LibriSpeech to find the optimal combination of design choices in terms of privacy and utility.
  arXiv  Detail & Related papers  (2020-05-18T11:32:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.