Blind Faith: Privacy-Preserving Machine Learning using Function Approximation
Tanveer Khan, Alexandros Bakas, Antonis Michalas

TL;DR
Blind Faith introduces a privacy-preserving machine learning approach that enables classification on encrypted data by approximating activation functions with Chebyshev polynomials, ensuring user privacy in cloud-based models.
Contribution
It presents a novel method combining homomorphic encryption with function approximation to perform secure classification on encrypted data.
Findings
Achieves high accuracy on encrypted image classification
Uses Chebyshev polynomial approximation for activation functions
Maintains user privacy during model inference
Abstract
Over the past few years, a tremendous growth of machine learning was brought about by a significant increase in adoption of cloud-based services. As a result, various solutions have been proposed in which the machine learning models run on a remote cloud provider. However, when such a model is deployed on an untrusted cloud, it is of vital importance that the users' privacy is preserved. To this end, we propose Blind Faith -- a machine learning model in which the training phase occurs in plaintext data, but the classification of the users' inputs is performed on homomorphically encrypted ciphertexts. To make our construction compatible with homomorphic encryption, we approximate the activation functions using Chebyshev polynomials. This allowed us to build a privacy-preserving machine learning model that can classify encrypted images. Blind Faith preserves users' privacy since it can…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Privacy-Preserving Technologies in Data · Chaos-based Image/Signal Encryption
