CipherFormer: Efficient Transformer Private Inference with Low Round Complexity

被引:0
|
作者
Wang, Weize [1 ]
Kuang, Yi [1 ]
机构
[1] Shanghai Jiao Tong Univ, Sch Cyber Sci & Engn, Shanghai, Peoples R China
来源
PROCEEDINGS OF THE 2024 27 TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN, CSCWD 2024 | 2024年
关键词
Private Inference; Transformer; Homomorphic Encryption; Garbled Circuit;
D O I
10.1109/CSCWD61410.2024.10580655
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
There is a growing trend to outsource the inference task of large transformer models to cloud servers. However, this poses a severe threat to users' private data as they are exposed to cloud servers after uploading. Although several works attempted to provide private inference for transformer models, their hundreds of communication rounds limit the application scenarios. Motivated by the desire to minimize round complexity, we propose CipherFormer, a novel transformer private inference scheme using homomorphic encryption and garbled circuits. We present a protocol for quickly computing homomorphic matrix multiplications. We then modify the attention mechanism and design the corresponding garbled circuits. Furthermore, we show how to use a lightweight attention mechanism and mixed-bitwidth to reduce the inference latency while maintaining accuracy. In comparison with an advanced homomorphic encryption scheme on text classification tasks, our model improves accuracy by 3% to 11% while performing private inference with a 7.7x-11.9x speedup.
引用
收藏
页码:3054 / 3059
页数:6
相关论文
共 50 条
  • [41] Tradeoffs between low complexity, low latency, and fairness with deficit round-robin schedulers
    Lenzini, L
    Mingozzi, E
    Stea, G
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2004, 12 (04) : 681 - 693
  • [42] Constraint-aware and Ranking-distilled Token Pruning for Efficient Transformer Inference
    Li, Junyan
    Zhang, Li Lyna
    Xu, Jiahang
    Wang, Yujing
    Yan, Shaoguang
    Xia, Yunqing
    Yang, Yuqing
    Cao, Ting
    Sun, Hao
    Deng, Weiwei
    Zhang, Qi
    Yang, Mao
    PROCEEDINGS OF THE 29TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, KDD 2023, 2023, : 1280 - 1290
  • [43] I-ViT: Integer-only Quantization for Efficient Vision Transformer Inference
    Li, Zhikai
    Gu, Qingyi
    2023 IEEE/CVF INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV 2023), 2023, : 17019 - 17029
  • [44] Knowledge Encryption and Its Applications to Simulatable Protocols with Low Round-Complexity
    Deng, Yi
    Zhang, Xinxuan
    ADVANCES IN CRYPTOLOGY-ASIACRYPT 2022, PT III, 2022, 13793 : 334 - 362
  • [45] A hybrid scheduling algorithm with low complexity: Jumping virtual clock round robin
    Hwang, LC
    Hsu, SJ
    Wang, SY
    Huang, YH
    25th IEEE International Conference on Distributed Computing Systems Workshops, Proceedings, 2005, : 698 - 703
  • [46] A Private Lookup Protocol with Low Online Complexity for Secure Multiparty Computation
    Laud, Peeter
    INFORMATION AND COMMUNICATIONS SECURITY, ICICS 2014, 2015, 8958 : 143 - 157
  • [47] Highly Efficient and Re-Executable Private Function Evaluation With Linear Complexity
    Bicer, Osman
    Bingol, Muhammed Ali
    Kiraz, Mehmet Sabr
    Levi, Albert
    IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2022, 19 (02) : 835 - 847
  • [48] Multiparty Threshold Private Set Intersection Protocol with Low Communication Complexity
    Yu, Xiaopeng
    Li, Fagen
    Zhao, Wei
    Dai, Zhengyi
    Tang, Dianhua
    SECURITY AND COMMUNICATION NETWORKS, 2022, 2022
  • [49] Multiparty Threshold Private Set Intersection Protocol with Low Communication Complexity
    Yu, Xiaopeng
    Li, Fagen
    Zhao, Wei
    Dai, Zhengyi
    Tang, Dianhua
    Security and Communication Networks, 2022, 2022
  • [50] Round-Efficient Secure Inference Based on Masked Secret Sharing for Quantized Neural Network
    Wei, Weiming
    Tang, Chunming
    Chen, Yucheng
    ENTROPY, 2023, 25 (02)