Advertisement

Future Work

  • Manas A. Pathak
Chapter
Part of the Springer Theses book series (Springer Theses)

Abstract

In this thesis, we introduced the problem of privacy-preserving speech processing through a few applications: speaker verification, speaker identification, and speech recognition. There are, however, many problems in speech processing where the similar techniques can be adapted to. Additionally, there are other algorithmic improvements that will allow us to create more accurate or more efficient privacy-preserving solutions for these problems. We discuss a few directions for future research below.

References

  1. Gentry C (2009) Fully homomorphic encryption using ideal lattices. In: ACM symposium on theory of computing, pp 169–178Google Scholar
  2. Gentry C (2010a) Toward basing fully homomorphic encryption on worst-case hardness. In: CRYPTO, pp 116–137Google Scholar
  3. Gentry C (2010b) Computing arbitrary functions of encrypted data. Commun ACM 53(3):97–105Google Scholar
  4. Kearns M, Tan J, Jennifer W (2007) Privacy-preserving belief propagation and sampling. In: Neural information processing systemsGoogle Scholar
  5. Lauter K, Naehrig M, Vaikuntanathan V (2011) Can homomorphic encryption be practical? In: ACM cloud computing security workshopGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Carnegie Mellon UniversityPittsburghUSA

Personalised recommendations