Pith. sign in

REVIEW 3 cited by

LLMs Can Understand Encrypted Prompt: Towards Privacy-Computing Friendly Transformers

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2305.18396 v3 pith:CU62JVTE submitted 2023-05-28 cs.LG cs.CLcs.CR

LLMs Can Understand Encrypted Prompt: Towards Privacy-Computing Friendly Transformers

classification cs.LG cs.CLcs.CR
keywords inferenceprivatefriendlyllmsmodelprivacy-computingframeworksinputs
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The community explored to build private inference frameworks for transformer-based large language models (LLMs) in a server-client setting, where the server holds the model parameters and the client inputs its private data (or prompt) for inference. However, these frameworks impose significant overhead when the private inputs are forward propagated through the original LLMs. In this paper, we show that substituting the computation- and communication-heavy operators in the transformer architecture with privacy-computing friendly approximations can greatly reduce the private inference costs while incurring very minor impact on model performance. Compared to state-of-the-art Iron (NeurIPS 2022), our privacy-computing friendly model inference pipeline achieves a $5\times$ acceleration in computation and an 80% reduction in communication overhead, while retaining nearly identical accuracy.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Power-Softmax: Towards Secure LLM Inference over Encrypted Data

    cs.LG 2024-10 unverdicted novelty 7.0

    Power-Softmax is a new HE-compatible attention variant that permits training and inference of billion-parameter polynomial LLMs with performance matching standard transformers.

  2. ConfusionPrompt: Practical Private Inference for Online Large Language Models

    cs.CR 2023-12 unverdicted novelty 6.0

    ConfusionPrompt enables private black-box LLM inference via prompt decomposition and pseudo-prompt mixing, claiming better privacy-utility trade-off than perturbation methods and lower memory use than open-source loca...

  3. SharedRequest: Privacy-Preserving Model-Agnostic Inference for Large Language Models

    cs.CR 2026-06 unverdicted novelty 5.0

    SharedRequest is a model-agnostic batch-level framework that mixes prompts with noise and groups equivalent instructions to achieve higher utility and lower query cost than individual differential privacy methods for ...