A framework for secure speech recognition

IEEE Transactions on Audio, Speech and Language Processing

Volumn 15, Issue 4, 2007, Pages 1404-1413

  Smaragdis, Paris ^a   Shashanka, Madhusudana ^b  

^a MITSUBISHI ELECTRIC RESEARCH LABORATORIES   (United States)

^b BOSTON UNIVERSITY   (United States)

Author keywords

Gaussian mixture models; Hidden Markov model (HMM); Secure multiparty computation (SMC); Speech recognition

Indexed keywords

GAUSSIAN MIXTURE MODELS; HIDDEN MARKOV MODEL (HMM); PRIVACY-PRESERVING; PRIVATE INFORMATIONS; SECURE MULTIPARTY COMPUTATION (SMC); SPEECH DATUM; SPEECH RECOGNITION SYSTEMS;

COMMUNICATION CHANNELS (INFORMATION THEORY); HIDDEN MARKOV MODELS; OBJECT RECOGNITION; SPEECH ANALYSIS; SPEECH PROCESSING; TRELLIS CODES;

SPEECH RECOGNITION;

EID: 50249135964     PISSN: 15587916     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASL.2007.894526     Document Type: Article

References (21)

1. A. C.-C Yeo, "Protocols for secure computation," in Proc. 23rd IEEE Symp. Foundations Comput. Sci., 1982, pp. 160-164.
2. J. Vaidya and C. Clifton, "Privacy preserving k-means clustering over vertically partitioned data," in Proc. ACM SIGKDD Conf. Knowledge Discovery Data Mining, 2003, pp. 206-215.
3. E. Kiltz, G. Leander, and J. Malone-Lee, "Secure computation of the mean and related statistics," in Proc. Theory Cryptography Conf., 2005, vol. 3378, Lecture Notes in Computer Science, pp. 283-302.
4. S. Avidan and M. Butman, "Blind Vision," in Proc. ECCV, 2006, vol. 3, pp. 1-13.
5. O. Goldreich, "Secure multi-party computation," Working Draft, 2000 [Online]. Available: http://citeseer.ist.psu.edu/ goldreich98secure.html
6. L. R. Rabiner, "A tutorial on hidden Markov models and selected applications in speech recognition," Proc. IEEE, vol. 77, no. 2, pp. 257-286, Feb. 1989.
7. S. Laur and H. Lipmaa, "Additive conditional disclosure of secrets and applications," Cryptology ePrint Archive, 2005, Rep. 2005/378.
8. Y.-C. Chang and C.-J. Lu, "Oblivious polynomial evaluation and oblivious neural learning," in Proc. Adv. Cryptol-Asiacrypt'01, 2001, vol. 2248, Lecture Notes in Computer Science, pp. 369-384.
9. B. Goethals, S. Laur, H. Lipmaa, and T. Mielikainen, C. Park and S. Chee, Eds., "On private scalar product computation for privacy-preserving data mining," in Proc. Int. Conf. Inf. Security Cryptol., 2004, vol. 2506, Lecture Notes in Computer Science, pp. 104-120.
10. W. Du and M. J. Atallah, "Privacy-preserving cooperative statistical analysis," in Proc. 17th Annu. Comput. Security Applicat. Conf., New Orleans, LA, Dec. 2001, pp. 102-110.
11. W. Du and Z. Zhan, "A practical approach to solve secure multi-party computation problems," in Proc. New Security Paradigms Workshop, Virginia Beach, VA, Sep. 23-26, 2002, pp. 127-135.
12. I. Ioannidis, A. Grama, and M. Atallah, "A secure protocol for computing dot-products in clustered and distributed environments," in Proc. Int. Conf. Parallel Process., Vancouver, BC, Canada, 2002, pp. 379-384.
13. P. Ravikumar, W. W. Cohen, and S. E. Fienberg, "A secure protocol for computing string distance metrics," in Proc. Workshop Privacy and Security Aspects of Data Mining, Brighton, U.K., 2004, pp. 40-46.
14. J. Vaidya and C. Clifton, "Privacy preserving association rule mining in vertically partitioned data," in Proc. Int. Conf. Knowledge Discovery and Data Mining, Edmonton, AB, Canada, 2002, ACM SIGKDD.
15. M. J. Atallah, F. Kerschbaum, and W. Du, "Secure and private sequence comparisons," in Proc.Workshop Privacy Electron. Soc.,Washington, DC, Oct. 2003, pp. 39-44.
16. I. F. Blake and V. Kolesnikov, "Strong conditional oblivious transfer and computing on intervals," in Proc. Adv. Cryptol.- Asiacrypt'04, P. J. Lee, Ed. New York: Springer-Verlag, 2004, vol. 3329, LNCS, pp. 515-529.
17. H.-Y. Lin and W.-G. Tzeng, "An efficient solution to the millionaires' problem based on homomorphic encryption," in Proc Int. Conf. Appl. Cryptography Network Security, 2005, vol. 3531, LNCS, pp. 456-466.
18. Z. Yang, R. Wright, and H. Subramaniam, "Experimental analysis of a privacy-preserving scalar product protocol," Int. J. Comput. Syst. Sci. Eng., vol. 21, no. 1, pp. 47-52, 2006.
19. I. Damgard and M. Jurik, "A generalisation, simplification and some applications of Paillier's probabilistic public-key system," in Proc. Int. Workshop Practice Theory Public Key Cryptography, 2001, vol. 1992, Lecture Notes in Computer Science, pp. 119-136.
20. P. Paillier, J. Stern, Ed., "Public-key cryptosystems based on composite degree residuosity classes," in Proc. Adv. Cryptol.-Eurocrypt'99, 1999, vol. 1592, Lecture Notes in Computer Science, pp. 223-238.
21. M. Naor and B. Pinkas, "Oblivious transfer and polynomial evaluation," in Proc. 31st Annu. ACM Symp. Theory Comput., 1999, pp. 245-254.