Privacy-Preserved Approximate Classification Based on Homomorphic Encryption

Privacy is a crucial issue for outsourcing computation, which means that clients utilize cloud infrastructure to perform online prediction without disclosing sensitive information. Homomorphic encryption (HE) is one of the promising cryptographic tools resolving privacy issue in this scenario. However, a bottleneck in application of HE is relatively high computational overhead. In this paper, we study the privacy-preserving classification problem. To this end, we propose a novel privacy-preserved approximate classification algorithm. It exploits a set of decision trees to reduce computational complexity during homomorphic evaluation computation formula, the time complexity of evaluating a polynomial is degraded from O n to O log n . As a result, for an MNIST dataset, the Micro- f 1 score of the proposed algorithm is 0.882 , compared with 0.912 of the standard method. For the Credit dataset, the algorithm achieves 0.601 compared with 0.613 of the method. These results show that our algorithm is feasible and practical in real world problems. View Full-Tex