Paper 2026/935

SoK: Private LLM Inference using Approximate Homomorphic Encryption

Ahmad Al Badawi, Duality Technologies
Andreea Alexandru, Duality Technologies
Yuriy Polyakov, Duality Technologies
Vinod Vaikuntanathan, Duality Technologies, Massachusetts Institute of Technology
Abstract

Although recent surveys on privacy-enhancing technologies concluded that FHE cannot feasibly evaluate non-linear activation functions in modern ML architectures, 21 CKKS-based frameworks have since demonstrated end-to-end private inference of LLMs with up to 8B parameters. However, as the field grows rapidly, the literature has become fragmented. Frameworks differ in ciphertext packing layouts, model fidelity, software and hardware stacks, and reported metrics, that hinder direct comparison and reproducibility. This paper presents the first systematization of knowledge for non-interactive, CKKS-based private LLM inference. We categorize the design space across two axes: a model-level axis (packing layout for linear blocks and model preservation for non-linear blocks) and a system-level axis (covering hardware, compilers, bootstrapping management, and hybrid execution). To standardize reporting framework configurations and results among researchers, we propose a Private LLM Card System (PLCS). Furthermore, we introduce POLARIS, a model-preserving reference framework for CKKS-based private LLM inference and provide it as an open-source proof-of-concept. POLARIS evaluates encrypted inference for the entire BERT family, from BERT-Tiny to BERT-Base, on CPU and GPU backends, the first framework to demonstrate this. Our analysis shows that only 5 out of the 21 surveyed frameworks are model-preserving, that is, they evaluate standard, unmodified LLMs without retraining or architectural substitutions while keeping the entire prompt encrypted. We also show that model-preserving CKKS approximations maintain high downstream task accuracy from BERT-Tiny up to Llama-3-8B. We identify a runtime gap of roughly four orders of magnitude between the best encrypted and plaintext inference as the primary barrier to practical use. While our analysis confirms that CKKS-based inference is now algorithmically feasible for non-linear functions and large models, we conclude that it remains operationally impractical for many human-facing applications until the efficiency gap is narrowed. We outline promising research directions to close this gap.

Metadata
Available format(s)
PDF
Category
Applications
Publication info
Preprint.
Keywords
Fully Homomorphic EncryptionPrivate LLMPrivacy-preserving Machine LearningSystematization of KnowledgeCKKS
Contact author(s)
aalbadawi @ dualitytech com
aalexandru @ dualitytech com
ypolyakov @ dualitytech com
vinodv @ mit edu
History
2026-10-23: last of 3 revisions
2026-05-12: received
See all versions
Short URL
https://ia.cr/2026/935
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2026/935,
      author = {Ahmad Al Badawi and Andreea Alexandru and Yuriy Polyakov and Vinod Vaikuntanathan},
      title = {{SoK}: Private {LLM} Inference using Approximate Homomorphic Encryption},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/935},
      year = {2026},
      url = {https://eprint.iacr.org/2026/935}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.