Client-side digit decomposition and block-diagonal packing enable server-side private embedding lookups in FHE, cutting embedding-lookup latency by up to 56x versus CodedHeLUT and enabling end-to-end encrypted DLRM inference in 24-489 seconds on a single CPU.
Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
HE-LRM: Encrypted Deep Learning Recommendation Models using Fully Homomorphic Encryption
Client-side digit decomposition and block-diagonal packing enable server-side private embedding lookups in FHE, cutting embedding-lookup latency by up to 56x versus CodedHeLUT and enabling end-to-end encrypted DLRM inference in 24-489 seconds on a single CPU.