Efficient Homomorphically Encrypted Convolutional Neural Network Without Rotation
Sajjad Akherati, Xinmiao Zhang

TL;DR
This paper introduces a new method for homomorphic encryption-based neural network inference that eliminates ciphertext rotations, significantly reducing computation time and communication costs while maintaining security.
Contribution
It proposes a novel joint computation procedure and filter coefficient packing scheme that remove ciphertext rotations in HE neural network inference.
Findings
Reduces convolutional and fully-connected layer runtimes by 15.5%.
Cuts communication costs between server and client by over 50%.
Maintains security while improving efficiency.
Abstract
Privacy-preserving neural network (NN) inference can be achieved by utilizing homomorphic encryption (HE), which allows computations to be directly carried out over ciphertexts. Popular HE schemes are built over large polynomial rings. To allow simultaneous multiplications in the convolutional (Conv) and fully-connected (FC) layers, multiple input data are mapped to coefficients in the same polynomial, so are the weights of NNs. However, ciphertext rotations are necessary to compute the sums of products and/or incorporate the outputs of different channels into the same polynomials. Ciphertext rotations have much higher complexity than ciphertext multiplications and contribute to the majority of the latency of HE-evaluated Conv and FC layers. This paper proposes a novel reformulated server-client joint computation procedure and a new filter coefficient packing scheme to eliminate…
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
TopicsChaos-based Image/Signal Encryption · Cryptography and Data Security · Biometric Identification and Security
