Pith. sign in

REVIEW 3 cited by

MPC-Minimized Secure LLM Inference

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 2408.03561 v1 pith:R2YT36PB submitted 2024-08-07 cs.CR cs.AIcs.LG

classification cs.CRcs.AIcs.LG
keywords inferencesecureduringacrossfine-tuningmarillbetterlarge
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Many inference services based on large language models (LLMs) pose a privacy concern, either revealing user prompts to the service or the proprietary weights to the user. Secure inference offers a solution to this problem through secure multi-party computation (MPC), however, it is still impractical for modern LLM workload due to the large overhead imposed by MPC. To address this overhead, we propose Marill, a framework that adapts LLM fine-tuning to minimize MPC usage during secure inference. Marill introduces high-level architectural changes during fine-tuning that significantly reduce the number of expensive operations needed within MPC during inference, by removing some and relocating others outside MPC without compromising security. As a result, Marill-generated models are more efficient across all secure inference protocols and our approach complements MPC-friendly approximations for such operations. Compared to standard fine-tuning, Marill results in 3.6-11.3x better runtime and 2.4-6.9x better communication during secure inference across various MPC settings, while typically preserving over 90% performance across downstream tasks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. FRAG: A Flexible Modular Framework for Retrieval-Augmented Generation based on Knowledge Graphs

    cs.CL 2025-01 conditional novelty 6.0 of 10

    FRAG routes knowledge-graph questions through a query-complexity classifier to BFS or shortest-path retrieval, improving KG-RAG accuracy without LLM fine-tuning or retrieval-time LLM calls.

  2. Towards Efficient Privacy-Preserving Machine Learning: A Systematic Review from Protocol, Model, and System Perspectives

    cs.CR 2025-07 conditional novelty 4.0 of 10

    A structured survey of PPML efficiency optimizations, grouped into protocol, model, and system levels, with comparisons and future directions.

  3. A Survey on Private Transformer Inference

    cs.CR 2024-12 reject

    A literature survey on private transformer inference that is too incomplete to support its promised comparisons and evaluation guidelines.

Pith tools