Fast homomorphic evaluation of deep discretized neural networks
From MaRDI portal
Publication:775993
DOI10.1007/978-3-319-96878-0_17zbMATH Open1462.94031OpenAlexW2794888826MaRDI QIDQ775993FDOQ775993
Authors: Florian Bourse, Michele Minelli, Matthias Minihold, Pascal Paillier 
Publication date: 30 June 2020
Full work available at URL: https://zenodo.org/record/2594563
Recommendations
- Practical Fully Homomorphic Encryption for Fully Masked Neural Networks
- TFHE: fast fully homomorphic encryption over the torus
- New techniques for multi-value input homomorphic evaluation and applications
- FHEW: bootstrapping homomorphic encryption in less than a second
- Large FHE gates from tensored homomorphic accumulator
Cited In (11)
- SecureBiNN: 3-party secure computation for binarized neural network inference
- \textsf{ComBo}: a novel functional bootstrapping method for efficient evaluation of nonlinear functions in the encrypted domain
- Discretization error reduction for high precision torus fully homomorphic encryption
- ML confidential: machine learning on encrypted data
- Fast secure comparison for medium-sized integers and its application in binarized neural networks
- Utility/privacy trade-off as regularized optimal transport
- High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function
- PRIORIS: Enabling Secure Detection of Suicidal Ideation from Speech Using Homomorphic Encryption
- Practical Fully Homomorphic Encryption for Fully Masked Neural Networks
- Secure transfer learning for machine fault diagnosis under different operating conditions
- Encrypted classification using secure K-nearest neighbour computation
This page was built for publication: Fast homomorphic evaluation of deep discretized neural networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q775993)
