Privacy-preserving speaker verification system based on binary I-vectors

5Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

Speaker verification is a key technology in many services and applications like smartphones and intelligent digital assistants. These applications usually require users to transmit their recordings, features, or models from their voices over untrusted public networks which stored and processed them on cloud-based infrastructure. Furthermore, the voice signal contains a great deal of the speaker's personal and private information which raises several privacy issues. Therefore, it is necessary to develop speaker verification systems that protect the user's voice against such threats. Herein, the cancellable biometric systems have been introduced as a privacy-preserving solution. A cancellable method for speaker verification systems is proposed using speaker i-vector embeddings. This method includes two stages: (i) i-vector binarisation and (ii) the protection of the binary i-vector with a shuffling scheme derived from a user-specific key. Privacy evaluation of this method according to the standards of biometric information protection (ISO/IEC 24745) shows that the proposed cancellable speaker verification system achieves the revocability, unlinkability, and irreversibility requirements. Moreover, the cancellable system improves biometric performance compared with the unprotected system and makes it resistant to different attack scenarios. Additionally, we demonstrate that this method can also operate to protect deep neural network speaker embeddings such as x-vectors.

Cite

CITATION STYLE

APA

Mtibaa, A., Petrovska-Delacrétaz, D., Boudy, J., & Ben Hamida, A. (2021). Privacy-preserving speaker verification system based on binary I-vectors. IET Biometrics, 10(3), 233–245. https://doi.org/10.1049/bme2.12013

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free