Privacy-Preserving Speaker Identification as String Comparison
In this chapter, we present a framework for speaker identification using locality sensitive hashing (LSH) and supervectors. Instead of GMM evaluation that we considered in the previous chapter, we transform the problem of speaker identification into string comparison. The motivation behind doing so is to perform speaker identification with privacy while having minimal computational overhead. Similar to the speaker verification framework of Chapter 6, we convert the utterances into supervector features [CampbellSRS et al., 2006] that are invariant with the length of the utterance. By applying the LSH transformation to the supervectors, we reduce the problem of nearest-neighbor classification into string comparison. As LSH is not privacy-preserving, we apply the cryptographic hash function to the LSH keys. This allows us to check if two LSH keys match without knowing their contents.
- Campbell JP (1995) Testing with the YOHO CD-ROM voice verification corpus. In: IEEE international conference on acoustics, speech and signal processing, pp 341–344Google Scholar
- Campbell WM, Sturim DE, Reynolds DA, Solomonoff A (2006) SVM based speaker verification using a GMM supervector kernel and NAP variability compensation. In: IEEE international conference on acoustics, speech and signal processingGoogle Scholar
- De Cristofaro E, Tsudik G (2010) Practical private set intersection protocols with linear complexity. In: Financial cryptographyGoogle Scholar
- Diffie W, Hellman ME (1976) New directions in cryptography. IEEE Trans Inform Theor IT-22(6):644–654Google Scholar
- OpenSSL (2010) http://www.openssl.org/docs/crypto/bn.html