REVIEW 2 cited by
HeLayers: A Tile Tensors Framework for Large Neural Networks on Encrypted Data
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
Privacy-preserving solutions enable companies to offload confidential data to third-party services while fulfilling their government regulations. To accomplish this, they leverage various cryptographic techniques such as Homomorphic Encryption (HE), which allows performing computation on encrypted data. Most HE schemes work in a SIMD fashion, and the data packing method can dramatically affect the running time and memory costs. Finding a packing method that leads to an optimal performant implementation is a hard task. We present a simple and intuitive framework that abstracts the packing decision for the user. We explain its underlying data structures and optimizer, and propose a novel algorithm for performing 2D convolution operations. We used this framework to implement an HE-friendly version of AlexNet, which runs in three minutes, several orders of magnitude faster than other state-of-the-art solutions that only use HE.
Forward citations
Cited by 2 Pith papers
-
Towards Efficient Privacy-Preserving Machine Learning: A Systematic Review from Protocol, Model, and System Perspectives
A structured survey of PPML efficiency optimizations, grouped into protocol, model, and system levels, with comparisons and future directions.
-
DESIGN: Encrypted GNN Inference via Server-Side Input Graph Pruning
DESIGN uses encrypted node degrees to prune graphs and adaptively choose polynomial activations, reporting 1.7x-2.4x speedups over a basic FHE GNN baseline.
Discussion (0). Sign in to comment.