Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2505.15252 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912385469513728 |
|---|---|
| author | Li, Zhengyi Guan, Yue Yang, Kang Feng, Yu Liu, Ning Yu, Yu Leng, Jingwen Guo, Minyi |
| author_facet | Li, Zhengyi Guan, Yue Yang, Kang Feng, Yu Liu, Ning Yu, Yu Leng, Jingwen Guo, Minyi |
| contents | The wide deployment of the generative pre-trained transformer (GPT) has raised privacy concerns for both clients and servers. While cryptographic primitives can be employed for secure GPT inference to protect the privacy of both parties, they introduce considerable performance overhead.To accelerate secure inference, this study proposes a public decoding and secure verification approach that utilizes public GPT models, motivated by the observation that securely decoding one and multiple tokens takes a similar latency. The client uses the public model to generate a set of tokens, which are then securely verified by the private model for acceptance. The efficiency of our approach depends on the acceptance ratio of tokens proposed by the public model, which we improve from two aspects: (1) a private sampling protocol optimized for cryptographic primitives and (2) model alignment using knowledge distillation. Our approach improves the efficiency of secure decoding while maintaining the same level of privacy and generation quality as standard secure decoding. Experiments demonstrate a $2.1\times \sim 6.0\times$ speedup compared to standard decoding across three pairs of public-private models and different network conditions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_15252 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | An Efficient Private GPT Never Autoregressively Decodes Li, Zhengyi Guan, Yue Yang, Kang Feng, Yu Liu, Ning Yu, Yu Leng, Jingwen Guo, Minyi Cryptography and Security Machine Learning The wide deployment of the generative pre-trained transformer (GPT) has raised privacy concerns for both clients and servers. While cryptographic primitives can be employed for secure GPT inference to protect the privacy of both parties, they introduce considerable performance overhead.To accelerate secure inference, this study proposes a public decoding and secure verification approach that utilizes public GPT models, motivated by the observation that securely decoding one and multiple tokens takes a similar latency. The client uses the public model to generate a set of tokens, which are then securely verified by the private model for acceptance. The efficiency of our approach depends on the acceptance ratio of tokens proposed by the public model, which we improve from two aspects: (1) a private sampling protocol optimized for cryptographic primitives and (2) model alignment using knowledge distillation. Our approach improves the efficiency of secure decoding while maintaining the same level of privacy and generation quality as standard secure decoding. Experiments demonstrate a $2.1\times \sim 6.0\times$ speedup compared to standard decoding across three pairs of public-private models and different network conditions. |
| title | An Efficient Private GPT Never Autoregressively Decodes |
| topic | Cryptography and Security Machine Learning |
| url | https://arxiv.org/abs/2505.15252 |