EncFormer: Secure and Efficient Transformer Inference over Encrypted Data

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Zhu, Yufan, Jin, Chao, Aung, Khin Mi Mi, Xiao, Xiaokui
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866917400331419648
author Zhu, Yufan
Jin, Chao
Aung, Khin Mi Mi
Xiao, Xiaokui
author_facet Zhu, Yufan
Jin, Chao
Aung, Khin Mi Mi
Xiao, Xiaokui
contents Transformer inference in machine-learning-as-a-service (MLaaS) raises privacy concerns for sensitive user inputs. Prior secure solutions that combine fully homomorphic encryption (FHE) and secure multiparty computation (MPC) are bottlenecked by inefficient FHE kernels, communication-heavy MPC protocols, and expensive FHE-MPC conversions. We present EncFormer, a two-party private Transformer inference framework that introduces Stage Compatible Patterns so that FHE kernels compose efficiently, reducing repacking and conversions. EncFormer also provides a cost analysis model built around a minimal-conversion baseline, enabling principled selection of FHE-MPC boundaries. To further reduce communication, EncFormer proposes a secure complex CKKS-MPC conversion protocol and designs communication-efficient MPC protocols for nonlinearities. With GPU optimizations, evaluations on GPT- and BERT-style models show that EncFormer achieves 1.4x-30.4x lower online MPC communication and 1.3x-9.8x lower end-to-end latency against prior hybrid FHE-MPC systems, and 1.9x-3.5x lower end-to-end latency on BERT-base than FHE-only pipelines under a matched backend, while maintaining near-plaintext accuracy on selected GLUE tasks.
format Preprint
id arxiv_https___arxiv_org_abs_2604_09975
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle EncFormer: Secure and Efficient Transformer Inference over Encrypted Data
Zhu, Yufan
Jin, Chao
Aung, Khin Mi Mi
Xiao, Xiaokui
Cryptography and Security
C.2.4; I.2.7; E.3
Transformer inference in machine-learning-as-a-service (MLaaS) raises privacy concerns for sensitive user inputs. Prior secure solutions that combine fully homomorphic encryption (FHE) and secure multiparty computation (MPC) are bottlenecked by inefficient FHE kernels, communication-heavy MPC protocols, and expensive FHE-MPC conversions. We present EncFormer, a two-party private Transformer inference framework that introduces Stage Compatible Patterns so that FHE kernels compose efficiently, reducing repacking and conversions. EncFormer also provides a cost analysis model built around a minimal-conversion baseline, enabling principled selection of FHE-MPC boundaries. To further reduce communication, EncFormer proposes a secure complex CKKS-MPC conversion protocol and designs communication-efficient MPC protocols for nonlinearities. With GPU optimizations, evaluations on GPT- and BERT-style models show that EncFormer achieves 1.4x-30.4x lower online MPC communication and 1.3x-9.8x lower end-to-end latency against prior hybrid FHE-MPC systems, and 1.9x-3.5x lower end-to-end latency on BERT-base than FHE-only pipelines under a matched backend, while maintaining near-plaintext accuracy on selected GLUE tasks.
title EncFormer: Secure and Efficient Transformer Inference over Encrypted Data
topic Cryptography and Security
C.2.4; I.2.7; E.3
url https://arxiv.org/abs/2604.09975