An Efficient Cacheable Secure Scalar Product Protocol for Privacy-Preserving Data Mining

  • Duc H. Tran
  • Wee Keong Ng
  • Hoon Wei Lim
  • Hai-Long Nguyen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6862)

Abstract

Computing scalar products amongst private vectors in a secure manner is a frequent operation in privacy-preserving data mining algorithms, especially when data is vertically partitioned on many parties. Existing secure scalar product protocols based on cryptography are costly, particularly when they are performed repeatedly in privacy-preserving data mining algorithms. To address this issue, we propose an efficient cacheable secure scalar product protocol called CSSP that is built upon a homomorphic multiplicative cryptosystem. CSSP allows one to reuse the already cached data and thus, it greatly reduces the running time of any privacy-preserving data mining algorithms that adopt it. We also conduct experiments on real-life datasets to show the efficiency of the protocol.

Keywords

Secret Share Association Rule Mining Data Mining Algorithm Oblivious Transfer Minimum Support Threshold 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aggarwal, C.C., Yu, P.S.: Privacy-Preserving Data Mining: Models and Algorithms. Advances in Database Systems, vol. 34. Springer, Heidelberg (2008)Google Scholar
  2. 2.
    Du, W., Atallah, M.J.: Privacy-preserving cooperative statistical analysis. In: Proceedings of the 17th Annual Computer Security Applications Conference (2001)Google Scholar
  3. 3.
    Du, W., Han, Y., Chen, S.: Privacy-preserving multivariate statistical analysis: Linear regression and classification. In: Proceedings of the 4th SDM (2004)Google Scholar
  4. 4.
    Du, W., Zhan, Z.: Building decision tree classifier on private data. In: Proceedings of the IEEE International Conference on Privacy, Security and Data Mining (2002)Google Scholar
  5. 5.
    El Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 10–18. Springer, Heidelberg (1985)CrossRefGoogle Scholar
  6. 6.
    Frank, A., Asuncion, A.: UCI machine learning repository (2010)Google Scholar
  7. 7.
    Goethals, B., Laur, S., Lipmaa, H., Mielikäinen, T.: On private scalar product computation for privacy-preserving data mining. In: Park, C.-s., Chee, S. (eds.) ICISC 2004. LNCS, vol. 3506, pp. 104–120. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  8. 8.
    Goldreich, O.: Secure multi-party computation (2002) (manuscript)Google Scholar
  9. 9.
    Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: Proceedings of the Annual ACM Symposium on Theory of Computing (1999)Google Scholar
  10. 10.
    Okamoto, T., Uchiyama, S.: A new public-key cryptosystem as secure as factoring. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 308–318. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  11. 11.
    Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  12. 12.
    Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120–126 (1978)CrossRefMATHGoogle Scholar
  13. 13.
    Vaidya, J., Clifton, C.: Privacy preserving association rule mining in vertically partitioned data. In: The Eighth ACM SIGKDD, pp. 639–644 (2002)Google Scholar
  14. 14.
    Vaidya, J., Clifton, C.: Privacy-preserving decision trees over vertically partitioned data. In: Jajodia, S., Wijesekera, D. (eds.) Data and Applications Security 2005. LNCS, vol. 3654, pp. 139–152. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  15. 15.
    Vaidya, J., Clifton, C.: Secure set intersection cardinality with application to association rule mining. J. Comput. Secur. 13(4), 593–622 (2005)CrossRefGoogle Scholar
  16. 16.
    Witten, I., Frank, E., Holmes, G., Mayo, M.: Weka 3 software, http://www.cs.waikato.ac.nz/ml/weka/
  17. 17.
    Yang, Z., Wright, R.N., Subramaniam, H.: Experimental analysis of a privacy-preserving scalar product protocol. International Journal of CSSE (2006)Google Scholar
  18. 18.
    Zhai, K., Ng, W.K., Herianto, A.R., Han, S.: Speeding up secure computations via embedded caching. In: 9th SDM (2009)Google Scholar
  19. 19.
    Zhan, J., Matwin, S., Chang, L.: Privacy-preserving collaborative association rule mining. Journal of Network and Computer Applications (2007)Google Scholar
  20. 20.
    Zhong, S.: Privacy-preserving algorithms for distributed mining of frequent itemsets. Information Sciences 177(2), 490–503 (2007)CrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Duc H. Tran
    • 1
  • Wee Keong Ng
    • 1
  • Hoon Wei Lim
    • 1
  • Hai-Long Nguyen
    • 1
  1. 1.Nanyang Technological UniversitySingapore

Personalised recommendations