Pith. sign in

REVIEW 1 cited by

TensorFHE: Achieving Practical Computation on Encrypted Data Using GPGPU

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2212.14191 v1 pith:62MESOTG submitted 2022-12-29 cs.AR cs.CR

classification cs.ARcs.CR
keywords tensorfhegpgpudataperformancestate-of-the-artaccelerationacceleratorsapplications
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this paper, we propose TensorFHE, an FHE acceleration solution based on GPGPU for real applications on encrypted data. TensorFHE utilizes Tensor Core Units (TCUs) to boost the computation of Number Theoretic Transform (NTT), which is the part of FHE with highest time-cost. Moreover, TensorFHE focuses on performing as many FHE operations as possible in a certain time period rather than reducing the latency of one operation. Based on such an idea, TensorFHE introduces operation-level batching to fully utilize the data parallelism in GPGPU. We experimentally prove that it is possible to achieve comparable performance with GPGPU as with state-of-the-art ASIC accelerators. TensorFHE performs 913 KOPS and 88 KOPS for NTT and HMULT (key FHE kernels) within NVIDIA A100 GPGPU, which is 2.61x faster than state-of-the-art FHE implementation on GPGPU; Moreover, TensorFHE provides comparable performance to the ASIC FHE accelerators, which makes it even 2.9x faster than the F1+ with a specific workload. Such a pure software acceleration based on commercial hardware with high performance can open up usage of state-of-the-art FHE algorithms for a broad set of applications in real systems.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. FLASH-FHE: A Heterogeneous Architecture for Fully Homomorphic Encryption Acceleration

    cs.AR 2025-01 conditional novelty 6.0 of 10

    The paper proposes FLASH-FHE, a heterogeneous FHE accelerator with bootstrappable and swift clusters, and reports speedups of 1.4x to 11.2x for deep workloads and up to 8x for parallel shallow workloads in cycle-accur...

Pith tools