CRAfT: Constant-Round Non-Polynomial Approximation and P2P Network for Secure Transformer Inference (opens in new tab)

Transformer models have recently emerged as a game-changing technology for applications in content generation\. However, severe privacy concerns and the scalability bottlenecks of existing secure protocols limit their large-scale deployment\. To address these challenges, we present CRAfT, an innovative system designed for high-scalability and low-latency secure Transformer inference\. The core contributions of CRAfT are threefold: First, we propose a novel ciphertext packing strategy tailored...

Read the original article
Sign in to keep reading the full article.

Keyboard Shortcuts

Navigation

Next / previous post
j/k
Open post
oorEnter
Preview post
v

Post Actions

Love post
a
Like post
l
Dislike post
d
Undo reaction
u
Save / unsave
s

Recommendations

Add interest / feed
Enter
Not interested
x

Go to

Home
gh
Interests
gi
Feeds
gf
Likes
gl
History
gy
Changelog
gc
Settings
gs
Discover
gb
Search
/

General

Show this help
?
Submit feedback
!
Close modal / unfocus
Esc

Press ? anytime to show this help