Unsupervised Machine Learning on encrypted data
From MaRDI portal
Publication:1726695
DOI10.1007/978-3-030-10970-7_21zbMath1447.94046OpenAlexW2810818034MaRDI QIDQ1726695
Angela Jäschke, Frederik Armknecht
Publication date: 20 February 2019
Full work available at URL: https://madoc.bib.uni-mannheim.de/46393/1/2018-411.pdf
Related Items (2)
A visual analysis method of randomness for classifying and ranking pseudo-random number generators ⋮ \textsf{ComBo}: a novel functional bootstrapping method for efficient evaluation of nonlinear functions in the encrypted domain
Cites Work
- Unnamed Item
- Unnamed Item
- Group homomorphic encryption: characterizations, impossibility results, and applications
- Oblivious sampling with applications to two-party \(k\)-means clustering
- Accelerating Homomorphic Computations on Rational Numbers
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Algorithms in HElib
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
- Fully Homomorphic Encryption over the Integers
- ML Confidential: Machine Learning on Encrypted Data
- Fully homomorphic encryption using ideal lattices
- Scale-Invariant Fully Homomorphic Encryption over the Integers
- Data and Applications Security XIX
- (Finite) field work: choosing the best encoding of numbers for FHE computation
This page was built for publication: Unsupervised Machine Learning on encrypted data
