Converting Transformers to Polynomial Form for Secure Inference Over Homomorphic Encryption
Itamar Zimerman, Moran Baruch, Nir Drucker, Gilad Ezov, Omri Soceanu,, Lior Wolf

TL;DR
This paper introduces the first polynomial transformer architecture enabling secure inference over homomorphic encryption, demonstrating its effectiveness on language and image classification tasks with comparable performance to traditional models.
Contribution
The paper presents a novel polynomial transformer design and a method to convert transformer operators into polynomial form, facilitating privacy-preserving inference with homomorphic encryption.
Findings
Achieved secure inference on language and image datasets
Models perform comparably to traditional transformers
Conducted ablations to analyze component contributions
Abstract
Designing privacy-preserving deep learning models is a major challenge within the deep learning community. Homomorphic Encryption (HE) has emerged as one of the most promising approaches in this realm, enabling the decoupling of knowledge between the model owner and the data owner. Despite extensive research and application of this technology, primarily in convolutional neural networks, incorporating HE into transformer models has been challenging because of the difficulties in converting these models into a polynomial form. We break new ground by introducing the first polynomial transformer, providing the first demonstration of secure inference over HE with transformers. This includes a transformer architecture tailored for HE, alongside a novel method for converting operators to their polynomial equivalent. This innovation enables us to perform secure inference on LMs with…
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 · Complexity and Algorithms in Graphs · Privacy-Preserving Technologies in Data
