mlsanityData to 14 Oct 2026

Breaking the Layer Barrier: Remodeling Private Transformer Inference with Hybrid CKKS and MPC

arXiv 2508.19525 ↗First posted 27 Aug 2025cs.CRcited by 7

Not on the map. Why?

Abstract (arXiv)

This paper presents an efficient framework for private Transformer inference that combines Homomorphic Encryption (HE) and Secure Multi-party Computation (MPC) to protect data privacy. Existing methods often leverage HE for linear layers (e.g., matrix multiplications) and MPC for non-linear layers (e.g., Softmax activation functions), but the conversion between HE and MPC introduces significant communication costs. The proposed framework, dubbed BLB, overcomes this by breaking down layers into fine-grained operators and further fusing adjacent linear operators, reducing the need for HE/MPC conversions. To manage the increased ciphertext bit width from the fused linear operators, BLB proposes the first secure conversion protocol between CKKS and MPC and enables CKKS-based computation of the fused operators. Additionally, BLB proposes an efficient matrix multiplication protocol for fused computation in Transformers. Extensive evaluations on BERT-base, BERT-large, and GPT2-base show that BLB achieves a 21× reduction in communication overhead compared to BOLT (S&P'24) and a 2× reduction compared to Bumblebee (NDSS'25), along with latency reductions of 13× and 1.8×, respectively, when leveraging GPU acceleration.

Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). First posted on arXiv 27 Aug 2025.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 7.

7 papers.