Secure Computation of Hidden Markov Models

Mehrdad Aliasgari, Marina Blanton

2013

Abstract

Hidden Markov Model (HMM) is a popular statistical tool with a large number of applications in pattern recognition. In some of such applications, including speaker recognition in particular, the computation involves personal data that can identify individuals and must be protected. For that reason, we develop privacy preserving techniques for HMM and Gaussian mixture model (GMM) computation suitable for use in speaker recognition and other applications. Unlike prior work, our solution uses floating point arithmetic, which allows us to simultaneously achieve high accuracy, provable security guarantees, and reasonable performance. We develop techniques for both two-party HMM and GMM computation based on threshold homomorphic encryption and multi-party computation based on threshold linear secret sharing, which are suitable for secure collaborative computation as well as secure outsourcing.

References

  1. Aliasgari, M., Blanton, M., Zhang, Y., and Steele, A. (2013). Secure computation on floating point numbers. In Network and Distributed System Security Symposuim (NDSS).
  2. Baudron, O., Fouque, P.-A., Pointcheval, D., Stern, J., and Poupard, G. (2001). Practical multi-candidate election scheme. In ACM Symposium on Principles of Distributed Computing (PODC), pages 274-283.
  3. Beerliova-Trubiniova, Z. and Hirt, M. (2008). Perfectlysecure MPC with linear communication complexity. In Theory of Cryptography Conference (TCC), pages 213-230.
  4. Canetti, R. (2000). Security and composition of multiparty cryptographic protocols. Journal of Cryptology, 13(1):143-202.
  5. Catrina, O. and de Hoogh, S. (2010). Improved primitives for secure multiparty integer computation. In Security and Cryptography for Networks (SCN), pages 182- 199.
  6. Catrina, O. and Saxena, A. (2010). Secure computation with fixed-point numbers. In Financial Cryptography and Data Security (FC), pages 35-50.
  7. Cramer, R., Damga°rd, I., and Ishai, Y. (2005). Share conversion, pseudorandom secret-sharing and applications to secure computation. In Theory of Cryptography Conference (TCC), pages 342-362.
  8. Cramer, R., Damga°rd, I., and Maurer, U. (2000). General secure multi-party computation from any linear secret-sharing scheme. In Advances in Cryptology - EUROCRYPT, pages 316-334.
  9. Cramer, R., Damga°rd, I., and Nielsen, J. (2001). Multiparty computation from threshold homomorphic encryption. In Advances in Cryptology - EUROCRYPT, pages 280-289.
  10. Dahl, M., Ning, C., and Toft, T. (2012). On secure twoparty integer division. In Financial Cryptography and Data Security (FC), pages 164-178.
  11. Damga°rd, I., Ishai, Y., and Krøigaard, M. (2010). Perfectly secure multiparty computation and the computational overhead of cryptography. In Advances in Cryptology - EUROCRYPT, pages 445-465.
  12. Damga°rd, I., Ishai, Y., Krøigaard, M., Nielsen, J., and Smith, A. (2008). Scalable multiparty computation with nearly optimal work and resilience. In Advances in Cryptology - CRYPTO, pages 241-261.
  13. Damga°rd, I. and Jurik, M. (2001). A generalisation, a simplification and some applications of Paillier's probabilistic public-key system. In International Workshop on Practice and Theory in Public Key Cryptography (PKC), pages 119-136.
  14. Damga°rd, I. and Thorbek, R. (2008). Efficient conversion of secret-shared values between different fields. ePrint Archive Report 2008/221.
  15. Franz, M., Deiseroth, B., Hamacher, K., Jha, S., Katzenbeisser, S., and Schröder, H. (2012). Towards secure bioinformatics services (short paper). In Financial Cryptography and Data Security (FC), pages 276- 283. Springer.
  16. Gennaro, R., Rabin, M., and Rabin, T. (1998). Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In ACM Symposium on Principles of Distributed Computing (PODC), pages 101-111.
  17. Hirt, M. and Maurer, U. (2001). Robustness for free in unconditional multi-party computation. In Advances in Cryptology - CRYPTO, pages 101-118.
  18. Kerschbaum, F., Biswas, D., and de Hoogh, S. (2009). Performance comparison of secure comparison protocols. In International Workshop on Database and Expert Systems Application (DEXA), pages 133-136.
  19. Lipmaa, H., Asokan, N., and Niemi, V. (2002). Secure Vickrey auctions without threshold trust. In Financial Cryptography (FC), pages 87-101.
  20. Nguyen, H. and Roughan, M. (2012a). Multi-observer privacy-preserving hidden markov models. In Network Operations and Management Symposium (NOMS), pages 514-517.
  21. Nguyen, H. and Roughan, M. (2012b). On the identifiability of multi-observer hidden markov models. In International Conference on Acoustics, Speech and Signal Processing (ICASSP), pages 1873-1876.
  22. Paillier, P. (1999). Public-key cryptosystems based on composite degree residuosity classes. In Advances in Cryptology - EUROCRYPT, pages 223-238.
  23. Pathak, M., Portelo, J., Raj, B., and Trancoso, I. (2012). Privacy-preserving speaker authentication. Information Security Conference (ISC), pages 1-22.
  24. Pathak, M. and Raj, B. (2011). Privacy preserving speaker verification using adapted gmms.
  25. pages 2405-2408.
  26. Pathak, M., Rane, S., Sun, W., and Raj, B. (2011). Privacy preserving probabilistic inference with hidden Markov models. In International Conference on Acoustics, Speech and Signal Processing (ICASSP), pages 5868-5871.
  27. Peng, K. and Bao, F. (2010). An efficient range proof scheme. In IEEE International Conference on Information Privacy, Security, Risk and Trust (PASSAT), pages 826-833.
  28. Rabiner, L. (1989). A tutorial on hidden Markov-models and selected applications in speech recognition. Proceedings of the IEEE, 77(2):257-286.
  29. Shamir, A. (1979). How to share a secret. Communications of the ACM, 22(11):612-613.
  30. Shashanka, M. (2010). A privacy preserving framework for gaussian mixture models. In IEEE International Conference on Data Mining Workshops (ICDMW), pages 499-506. IEEE.
  31. Smaragdis, P. and Shashanka, M. (2007). A framework for secure speech recognition. IEEE Transactions on Audio, Speech, and Language Processing, 15(4):1404- 1413.
Download


Paper Citation


in Harvard Style

Aliasgari M. and Blanton M. (2013). Secure Computation of Hidden Markov Models . In Proceedings of the 10th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2013) ISBN 978-989-8565-73-0, pages 242-253. DOI: 10.5220/0004533502420253


in Bibtex Style

@conference{secrypt13,
author={Mehrdad Aliasgari and Marina Blanton},
title={Secure Computation of Hidden Markov Models},
booktitle={Proceedings of the 10th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2013)},
year={2013},
pages={242-253},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004533502420253},
isbn={978-989-8565-73-0},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 10th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2013)
TI - Secure Computation of Hidden Markov Models
SN - 978-989-8565-73-0
AU - Aliasgari M.
AU - Blanton M.
PY - 2013
SP - 242
EP - 253
DO - 10.5220/0004533502420253