메뉴 건너뛰기




Volumn , Issue , 2012, Pages 1849-1852

Privacy-preserving speaker verification as password matching

Author keywords

LSH; Privacy; Speaker Verification

Indexed keywords

ACCURACY EXPERIMENT; BIT-STRINGS; COMPUTATIONAL OVERHEADS; CRYPTOGRAPHIC HASH FUNCTIONS; DATA SETS; EXECUTION TIME; LOCALITY SENSITIVE HASHING; LSH; NEAREST NEIGHBORS; PASSWORD-BASED AUTHENTICATION; PRIVACY CONSTRAINTS; PRIVACY PRESERVING; SPEAKER VERIFICATION; SPEAKER VERIFICATION SYSTEM; SPEECH INPUT; STRING COMPARISON; VERIFICATION DATA;

EID: 84867598353     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.2012.6288262     Document Type: Conference Paper
Times cited : (28)

References (11)
  • 1
    • 84865702898 scopus 로고    scopus 로고
    • Privacy preserving speaker verification using adapted GMMs
    • Manas Pathak and Bhiksha Raj, "Privacy preserving speaker verification using adapted GMMs," in Interspeech, 2011.
    • (2011) Interspeech
    • Pathak, M.1    Raj, B.2
  • 2
    • 33947696754 scopus 로고    scopus 로고
    • SVM based speaker verification using a GMM supervector kernel and NAP variability compensation
    • William M. Campbell, Douglas E. Sturim, Douglas A. Reynolds, and Alex Solomonoff, "SVM based speaker verification using a GMM supervector kernel and NAP variability compensation," in ICASSP, 2006.
    • (2006) ICASSP
    • Campbell, W.M.1    Sturim, D.E.2    Reynolds, D.A.3    Solomonoff, A.4
  • 3
    • 0031644241 scopus 로고    scopus 로고
    • Approximate nearest neighbors: Towards removing the curse of dimensionality
    • Piotr Indyk and Rajeev Motwani, "Approximate nearest neighbors: Towards removing the curse of dimensionality," in ACM Symposium on Theory of Computing, 1998, pp. 604-613.
    • ACM Symposium on Theory of Computing, 1998 , pp. 604-613
    • Indyk, P.1    Motwani, R.2
  • 4
    • 0033884858 scopus 로고    scopus 로고
    • Speaker verification using adapted gaussian mixture models
    • Douglas A. Reynolds, Thomas F. Quatieri, and Robert B. Dunn, "Speaker verification using adapted gaussian mixture models," Digital Signal Processing, vol. 10, no. 1-3, pp. 19-41, 2000.
    • (2000) Digital Signal Processing , vol.10 , Issue.1-3 , pp. 19-41
    • Reynolds, D.A.1    Quatieri, T.F.2    Dunn, R.B.3
  • 6
    • 37549058056 scopus 로고    scopus 로고
    • Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
    • Alexandr Andoni and Piotr Indyk, "Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions," Communications of the ACM, vol. 51, pp. 117-122, 2008.
    • (2008) Communications of the ACM , vol.51 , pp. 117-122
    • Andoni, A.1    Indyk, P.2
  • 7
    • 77953184849 scopus 로고    scopus 로고
    • Kernelized locality-sensitive hashing for scalable image search
    • Brian Kulis and Kristen Grauman, "Kernelized locality-sensitive hashing for scalable image search," in ICCV, 2009, pp. 2130-2137.
    • (2009) ICCV , pp. 2130-2137
    • Kulis, B.1    Grauman, K.2
  • 10
    • 0028996937 scopus 로고
    • Testing with the YOHO CD-ROM voice verification corpus
    • Joseph P. Campbell, "Testing with the YOHO CD-ROM voice verification corpus," in ICASSP, 1995, pp. 341-344.
    • (1995) ICASSP , pp. 341-344
    • Campbell, J.P.1
  • 11
    • 84867611440 scopus 로고    scopus 로고
    • "OpenSSL," http://www.openssl.org/docs/crypto/bn.html.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.