REVIEW 1 cited by
FHEBench: Benchmarking Fully Homomorphic Encryption Schemes
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
read the original abstract
Fully Homomorphic Encryption (FHE) emerges one of the most promising solutions to privacy-preserving computing in an untrusted cloud. FHE can be implemented by various schemes, each of which has distinctive advantages, i.e., some are good at arithmetic operations, while others are efficient when implementing Boolean logic operations. Therefore, it is difficult for even cryptography experts let alone average users to choose the "right" FHE scheme to efficiently implement a specific application. Prior work only qualitatively compares few FHE schemes. In this paper, we present an empirical study, FHEBench, to quantitatively compare major FHE schemes
Forward citations
Cited by 1 Pith paper
-
Technical Evaluation of a Disruptive Approach in Homomorphic AI
A self-evaluation by the scheme's co-designer of a black-box 'homomorphic AI' hash reports perfect clustering on one dataset but degraded off-the-shelf accuracy on Fashion-MNIST, improved only after custom post-hoc tuning.
Discussion (0). Sign in to comment.