An Efficient Solution for Privacy-preserving Naïve Bayes Classification in Fully Distributed Data Model


  • Vu Duy Hien



privacy-preserving data mining and machine learning, secure multi-party computation, Naïve Bayes classification, Homomorphic encryption, Data privacy

Tóm tắt

AbstractRecently, privacy preservation has become one of the most important problems in data mining and machine learning. In this paper, we propose a novel privacy-preserving Naïve Bayes classifier for the fully distributed data scenario where each record is only kept by a unique owner. Our proposed solution is based on a secure multi-party computation protocol, so that it has the capability to securely protect each data owner’s privacy, as well as accurately guarantee the classification model. Furthermore, our experimental results show that the new solution is efficient enough for practical applications.


Download data is not yet available.


Y. Lindell and B. Pinkas, “Secure Multiparty Computation for Privacy-Preserving Data Mining,” J. Priv. Confidentiality, vol. 1, no. 1, pp. 59–98, 2009, doi:

M. Kantarcıoˇglu, J. Vaidya, and C. Clifton, “Privacy Preserving Naive Bayes Classifier for Horizontally Partitioned Data,” presented at the IEEE ICDM workshop on privacy preserving data mining, 1-7, 2003. [Online]. Available: /1.pdf

J. Vaidya, M. Kantarcioglu, and C. Clifton, “Privacy-preserving Naïve Bayes classification,” VLDB J., vol. 17, pp. 879–898, 2008, doi:

B. Schneier, Applied Cryptography, 2nd ed. John Wiley & Sons, 1996.

C. Clifton, M. Kantarcioglu, J. Vaidya, X. Lin, and M. Y. Zhu, “Tools for Privacy Preserving Distributed Data Mining,” ACM SIGKDD Explor. Newsl., vol. 4, no. 2, pp. 28–34, 2002, doi:

Z. Yang, S. Zhong, and R. N. Wright, “PrivacyPreserving Classiflcation of Customer Data without Loss of Accuracy,” in Proceedings of the 2005 SIAM International Conference on Data Mining, 2005, pp. 92–102. doi:

X. Yi and Y. Zhang, “Privacy-preserving Naive Bayes classification on distributed data via semitrusted mixers,” Inf. Syst., vol. 34, pp. 371–380, 2009, doi:

M. E. Skarkala, M. Maragoudakis, S. Gritzalis, and L. Mitrou, “PPDM-TAN: A PrivacyPreserving Multi-Party Classifier,” Computation, vol. 9, no. 6, pp. 1–25, 2021, doi:

P. Paillier, “Public-Key Cryptosystems Based on Composite Degree Residuosity Classes,” in International Conference on the Theory and Applications of Cryptographic Techniques, 1999, pp. 223–238. doi: 48910-X_16.

C. Gentry, “Fully homomorphic encryption using ideal lattices,” in Proceedings of the forty-first annual ACM symposium on Theory of computing, 2009, pp. 169–178. doi:

P. Li, J. Li, Z. Huang, C.-Z. Gao, W.-B. Chen, and K. Chen, “Privacy-preserving outsourced classification in cloud computing,” Clust. Comput., vol. 21, pp. 277–286, 2018, doi:

M. Huai, L. Huang, W. Yang, L. Li, and M. Qi, “Privacy-preserving Naive Bayes classification,” in International conference on knowledge science, engineering and management, 2015, pp. 627–638. doi: 25159-2_57.

T. Li, J. Li, Z. Liu, P. Li, and C. Jia, “Differentially private Naive Bayes learning over multiple data sources,” Inf. Sci., vol. 444, pp. 89– 104, 2018, doi:

P. Li, T. Li, H. Ye, J. Li, X. Chen, and Y. Xiang, “Privacy-preserving machine learning with multiple data providers,” Future Gener. Comput. Syst., vol. 87, pp. 341–350, 2018, doi:

V. Duy Hien, L. The Dung, and H. Tu Bao, “An efficient approach for secure multi-party computation without authenticated channel,” Inf. Sci., vol. 527, pp. 356–368, 2020, doi:

O. Goldreich, “Basic Applications,” in Foundations of Cryptography, vol. II, Cambridge University Press, 2004.

F. Hao, P. Y. A. Ryan, and P. Zielin´ski, “Anonymous voting by two-round public discussion,” IET Inf. Secur., vol. 4, no. 2, pp. 62– 67, 2010, doi:

H. Hofmann, “Statlog (German Credit Data) Data Set,” 1994. erman+credit+data)


Abstract views: 133 / PDF downloads: 35



How to Cite

Hien, V. D. (2022). An Efficient Solution for Privacy-preserving Naïve Bayes Classification in Fully Distributed Data Model. Journal of Science and Technology on Information Security, 1(15), 56-61.