SecPE: Secure Prompt Ensembling for Private and Robust Large Language Models
Jiawen Zhang, Kejia Chen, Zunlei Feng, Jian Lou, Mingli Song, Jian Liu, and Xiaohu Yang

TL;DR
SecPE introduces a novel approach that combines private inference and prompt ensembling using homomorphic encryption to achieve robust, privacy-preserving large language model inference with minimal efficiency loss.
Contribution
It is the first to integrate private inference with prompt ensembling for LLMs, designing efficient FHE-based algorithms to enhance robustness and privacy simultaneously.
Findings
SecPE maintains high accuracy with only 2.5% efficiency overhead.
SecPE significantly improves robustness over baseline methods.
SecPE's encrypted Argmax is 35.4x faster than existing solutions.
Abstract
With the growing popularity of LLMs among the general public users, privacy-preserving and adversarial robustness have become two pressing demands for LLM-based services, which have largely been pursued separately but rarely jointly. In this paper, to the best of our knowledge, we are among the first attempts towards robust and private LLM inference by tightly integrating two disconnected fields: private inference and prompt ensembling. The former protects users' privacy by encrypting inference data transmitted and processed by LLMs, while the latter enhances adversarial robustness by yielding an aggregated output from multiple prompted LLM responses. Although widely recognized as effective individually, private inference for prompt ensembling together entails new challenges that render the naive combination of existing techniques inefficient. To overcome the hurdles, we propose SecPE,…
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
TopicsTopic Modeling
