Accelerating Private Large Transformers Inference Through Fine-Grained Collaborative Computation
Homomorphic encryption (HE) and secret sharing (SS) enable computations on encrypted data, providing significant privacy benefits for large transformer-based models (TBM) in sensitive sectors like medicine and finance. However, private TBM inference incurs significant costs due to the coarse-grained application of HE and SS. We present FASTLMPI, a new approach to accelerate private TBM inference through fine-grained computation optimization. Specifically, through the fine-grained co-design of homomorphic encryption and secret sharing, FASTLMPI achieves efficient protocols for matrix multiplication, SoftMax, LayerNorm, and GeLU. In addition, FASTLMPI introduces a precise segmented approximation technique for differentiable non-linear functions, improving its fitting accuracy while maintaining a low polynomial degree. Compared to solution BOLT (S&P’24), FASTLMPI shows a remarkable 25.1% to 55.3% decrease in runtime and an impressive 39.0% reduction in communication costs.
Authors
- Bingsheng Zhang (ORCID: https://orcid.org/0000-0002-8961-0723)
- Tianpei Lu (ORCID: https://orcid.org/0009-0007-2360-0470)
- Yuntian Chen (ORCID: https://orcid.org/0000-0001-8815-9267)
- Zhanyong Tang (ORCID: https://orcid.org/0000-0002-4333-2334)
- Zhiying Shi (ORCID: https://orcid.org/0009-0000-0392-7416)
- Zheng Wang (ORCID: https://orcid.org/0000-0001-6157-0662)
Institutions
- University of Leeds (GB)
- Xi'an International Studies University (CN)
- Northwest University (CN)
- Tianjin International Joint Academy of Biomedicine (CN)
- Zhejiang University (CN)
Publication Details
- Journal
- IEEE Transactions on Information Forensics and Security
- Published
- 2025-01-01
- DOI
- https://doi.org/10.1109/tifs.2025.3584639
- Citations
- 1
- Primary Topic
- Quantum Computing Algorithms and Architecture
- Type
- article
- Field-Weighted Citation Impact
- 2.48