Abstract
In this chapter we present a privacy-preserving framework for isolated word recognition based on Hidden Markov Models (HMMs). Classification based on HMMs is common in machine learning and is nearly ubiquitous in applications related to speech processing. We consider a multi-party scenario in which the data and the HMMs belong to different individuals and cannot be shared. For example, Alice wants to analyze speech data from telephone calls. She outsources the speech recognition task to Bob, who possesses accurate HMMs obtained via extensive training. Alice cannot share the speech data with Bob owing to privacy concerns while Bob cannot disclose the HMM parameters because this might leak valuable information about his own training database.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
See (Rane and Sun 2010) for more details.
References
Rane S, Sun W (2010) Privacy preserving string comparisons based on Levenshtein distance. In: Proceedings of IEEE international workshop on information forensics and security (WIFS), Seattle, Dec 2010
Smaragdis P, Shashanka M (2007) A framework for secure speech recognition. IEEE Trans Audio Speech Lang Process 15(4):1404–1413
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this chapter
Cite this chapter
Pathak, M.A. (2013). Privacy-Preserving Isolated-Word Recognition. In: Privacy-Preserving Machine Learning for Speech Processing. Springer Theses. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-4639-2_11
Download citation
DOI: https://doi.org/10.1007/978-1-4614-4639-2_11
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-4638-5
Online ISBN: 978-1-4614-4639-2
eBook Packages: EngineeringEngineering (R0)