PrivTI: Efficient End-to-End Privacy-Preserving Inference for Transformer-Based Models in MLaaS

IF 6.2 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
IEEE Transactions on Services Computing Pub Date : 2026-09-01 Epub Date: 2026-04-17 DOI:10.1109/TSC.2026.3685039
Mingshun Luo;Haolei He;Wenti Yang;Meng Li;Longfei Wu;Zijian Zhang;Zhitao Guan
{"title":"PrivTI: Efficient End-to-End Privacy-Preserving Inference for Transformer-Based Models in MLaaS","authors":"Mingshun Luo;Haolei He;Wenti Yang;Meng Li;Longfei Wu;Zijian Zhang;Zhitao Guan","doi":"10.1109/TSC.2026.3685039","DOIUrl":null,"url":null,"abstract":"Machine Learning as a Service (MLaaS) offers convenient access to high-quality transformer-based model inference without local deployment, but it requires uploading sensitive data to the server, raising significant privacy concerns. Recent advances in homomorphic encryption (HE) and secure multi-party computation (MPC) have shown great potential for enabling privacy-preserving inference. However, existing schemes face challenges with transformer-based models due to massive matrix multiplications and complex non-linear functions. To address these challenges, we propose PrivTI, an efficient end-to-end privacy-preserving inference framework for transformer-based models. Specifically, we design an HE-based single-instruction multiple-data (SIMD) encoding scheme to perform matrix multiplication efficiently. To handle non-linear functions, we develop MPC-friendly protocols for core functions like GELU, Softmax, and LayerNorm, and further extend support to SiLU and RMSNorm. Moreover, PrivTI supports conversions between HE and MPC, enabling end-to-end privacy-preserving inference. Experimental results demonstrate that PrivTI achieves speedups 1.9–45.2× in matrix multiplication and 1.1–18.9× in non-linear function evaluation compared to baseline schemes IRON, BOLT, and NEXUS under the Local Area Network (LAN) setting. Additionally, PrivTI reduces communication overhead by 1.1–4898.7×. Moreover, end-to-end benchmarks show 3.3–9.8× improvements in computation speed and 1.6–6.2× reductions in communication overhead.","PeriodicalId":13255,"journal":{"name":"IEEE Transactions on Services Computing","volume":"19 5","pages":"3198-3211"},"PeriodicalIF":6.2000,"publicationDate":"2026-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Services Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11482887/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/4/17 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Machine Learning as a Service (MLaaS) offers convenient access to high-quality transformer-based model inference without local deployment, but it requires uploading sensitive data to the server, raising significant privacy concerns. Recent advances in homomorphic encryption (HE) and secure multi-party computation (MPC) have shown great potential for enabling privacy-preserving inference. However, existing schemes face challenges with transformer-based models due to massive matrix multiplications and complex non-linear functions. To address these challenges, we propose PrivTI, an efficient end-to-end privacy-preserving inference framework for transformer-based models. Specifically, we design an HE-based single-instruction multiple-data (SIMD) encoding scheme to perform matrix multiplication efficiently. To handle non-linear functions, we develop MPC-friendly protocols for core functions like GELU, Softmax, and LayerNorm, and further extend support to SiLU and RMSNorm. Moreover, PrivTI supports conversions between HE and MPC, enabling end-to-end privacy-preserving inference. Experimental results demonstrate that PrivTI achieves speedups 1.9–45.2× in matrix multiplication and 1.1–18.9× in non-linear function evaluation compared to baseline schemes IRON, BOLT, and NEXUS under the Local Area Network (LAN) setting. Additionally, PrivTI reduces communication overhead by 1.1–4898.7×. Moreover, end-to-end benchmarks show 3.3–9.8× improvements in computation speed and 1.6–6.2× reductions in communication overhead.
MLaaS中基于变压器模型的高效端到端隐私保护推理
机器学习即服务(MLaaS)提供了方便的访问高质量的基于变压器的模型推理,而无需本地部署,但它需要将敏感数据上传到服务器,这引起了严重的隐私问题。同态加密(HE)和安全多方计算(MPC)的最新进展显示出实现隐私保护推理的巨大潜力。然而,由于矩阵乘法和复杂的非线性函数,现有的方案面临着基于变压器的模型的挑战。为了解决这些挑战,我们提出了PrivTI,一个有效的端到端基于变压器的模型隐私保护推理框架。具体来说,我们设计了一个基于he的单指令多数据(SIMD)编码方案来高效地执行矩阵乘法。为了处理非线性函数,我们为GELU、Softmax和LayerNorm等核心功能开发了mpc友好协议,并进一步扩展了对SiLU和RMSNorm的支持。此外,PrivTI支持HE和MPC之间的转换,从而实现端到端的隐私保护推理。实验结果表明,在局域网(LAN)设置下,与IRON、BOLT和NEXUS等基准方案相比,PrivTI在矩阵乘法方面的速度提高了1.9 ~ 45.2倍,在非线性函数求值方面的速度提高了1.1 ~ 18.9倍。此外,PrivTI减少了1.1 - 4898.7倍的通信开销。此外,端到端基准测试显示计算速度提高了3.3 - 9.8倍,通信开销降低了1.6 - 6.2倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Services Computing
IEEE Transactions on Services Computing COMPUTER SCIENCE, INFORMATION SYSTEMS-COMPUTER SCIENCE, SOFTWARE ENGINEERING
CiteScore
11.50
自引率
6.20%
发文量
278
审稿时长
>12 weeks
期刊介绍: IEEE Transactions on Services Computing encompasses the computing and software aspects of the science and technology of services innovation research and development. It places emphasis on algorithmic, mathematical, statistical, and computational methods central to services computing. Topics covered include Service Oriented Architecture, Web Services, Business Process Integration, Solution Performance Management, and Services Operations and Management. The transactions address mathematical foundations, security, privacy, agreement, contract, discovery, negotiation, collaboration, and quality of service for web services. It also covers areas like composite web service creation, business and scientific applications, standards, utility models, business process modeling, integration, collaboration, and more in the realm of Services Computing.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书