You are looking at a specific version 20190829:145413 of this paper. See the latest version.

Paper 2019/976

Towards real-time hidden speaker recognition by means of fully homomorphic encryption

Martin Zuber and Sergiu Carpov and Renaud Sirdey

Abstract

Securing Neural Network (NN) computations through the use of Fully Homomorphic Encryption (FHE) is the subject of a growing interest in both communities. Among different possible approaches to that topic, our work focuses on applying FHE to hide the model of a neural network-based system in the case of a plain input. In this paper, using the TFHE homomorphic encryption scheme, we propose an efficient fully homomorphic method for an argmin computation on an arbitrary number of encrypted inputs and an asymptotically faster - though levelled - equivalent scheme. Using these schemes and a unifying framework for LWE-based homomorphic encryption schemes (Chimera), we implement a very time-wise efficient, homomorphic speaker recognition scheme using the neural-based embedding system VGGVox. This work can be generalized to all other similar Euclidean embedding-based recognition systems. While maintaining the best-of-class classification rate of the VGGVox system, we implement a speaker-recognition system that can classify a speech sample as coming from one of a 100 hidden model speakers in less than one second.

Metadata
Available format(s)
PDF
Category
Applications
Publication info
Preprint. MINOR revision.
Keywords
Fully Homomorphic EncryptionNeural NetworksLWENearest Neighbour problemembedding-based recognition systemsspeaker-recognitionFHE performance
Contact author(s)
zubersmartin @ gmail com
sergiu carpov @ cea fr
renaud sirdey @ cea fr
History
2019-08-29: last of 2 revisions
2019-08-29: received
See all versions
Short URL
https://ia.cr/2019/976
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.