mlsanityData to 14 Oct 2026

ENSI: Efficient Non-Interactive Secure Inference for Large Language Models

arXiv 2509.09424 ↗First posted 11 Sep 2025cs.CR cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

Secure inference enables privacy-preserving machine learning by leveraging cryptographic protocols that support computations on sensitive user data without exposing it. However, integrating cryptographic protocols with large language models (LLMs) presents significant challenges, as the inherent complexity of these protocols, together with LLMs' massive parameter scale and sophisticated architectures, severely limits practical usability. In this work, we propose ENSI, a novel non-interactive secure inference framework for LLMs, based on the principle of co-designing the cryptographic protocols and LLM architecture. ENSI employs an optimized encoding strategy that seamlessly integrates CKKS scheme with a lightweight LLM variant, BitNet, significantly reducing the computational complexity of encrypted matrix multiplications. In response to the prohibitive computational demands of softmax under homomorphic encryption (HE), we pioneer the integration of the sigmoid attention mechanism with HE as a seamless, retraining-free alternative. Furthermore, by embedding the Bootstrapping operation within the RMSNorm process, we efficiently refresh ciphertexts while markedly decreasing the frequency of costly bootstrapping invocations. Experimental evaluations demonstrate that ENSI achieves approximately an 8x acceleration in matrix multiplications and a 2.6x speedup in softmax inference on CPU compared to state-of-the-art method, with the proportion of bootstrapping is reduced to just 1%.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 17 of its 42 references that are in the map. First posted on arXiv 11 Sep 2025.

Builds on

17 of 42 references.

References · 17

  1. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  2. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
  3. 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,703
  4. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
  5. 2020GLU Variants Improve Transformercited by 1,804
  6. 2024The Era of 1-bit LLMs: All Large Language Models are in 1.58 Bitscited by 308
  7. 2023Can LLMs Keep a Secret? Testing Privacy Implications of Language Models via Contextual Integrity Theorycited by 230
  8. 2018Gazelle: A Low Latency Framework for Secure Neural Network Inferencecited by 193
  9. 2023BitNet: Scaling 1-bit Transformers for Large Language Modelscited by 189
  10. 2022MPCFormer: fast, performant and private Transformer inference with MPCcited by 69
  11. 2024Theory, Analysis, and Best Practices for Sigmoid Self-Attentioncited by 64
  12. 2022THE-X: Privacy-Preserving Transformer Inference with Homomorphic Encryptioncited by 57
5 more
  1. 2023PUMA: Secure Inference of LLaMA-7B in Five Minutescited by 48
  2. 2024Encryption-Friendly LLM Architecturecited by 17
  3. 2024Nimbus: Secure and Efficient Two-Party Inference for Transformerscited by 16
  4. 2024A Fast, Performant, Secure Distributed Training Framework For Large Language Modelcited by 8
  5. 2024TEESlice: Protecting Sensitive Neural Network Models in Trusted Execution Environments When Attackers have Pre-Trained Modelscited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.