Programmable Bootstrapping Enables Efficient Homomorphic Inference of Deep Neural Networks
Authors:
- 1 July 2021
- book chapter
- Published by Springer Nature
- p. 1-19
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- (Leveled) Fully Homomorphic Encryption without BootstrappingACM Transactions on Computation Theory, 2014
- Worst-case to average-case reductions for module latticesDesigns, Codes and Cryptography, 2014
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$SIAM Journal on Computing, 2014
- On Ideal Lattices and Learning with Errors over RingsJournal of the ACM, 2013
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based2013
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller2012
- Computing arbitrary functions of encrypted dataCommunications of the ACM, 2010
- Fully Homomorphic Encryption over the Integers2010
- On lattices, learning with errors, random linear codes, and cryptographyJournal of the ACM, 2009
- Efficient Public Key Encryption Based on Ideal Lattices2009