Faster private decision tree evaluation for batched input from homomorphic encryption

DOI10.1007/978-3-031-71073-5_1MaRDI QIDQ6660541

Jeongeun Park, Georgio Nicolas, Kelong Cong, Jiayi Kang

Publication date: 10 January 2025

zbMATH Keywords

machine learninghomomorphic encryptionprivate decision tree evaluation

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Fully homomorphic SIMD operations
• (Leveled) fully homomorphic encryption without bootstrapping
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
• Random forests
• FINAL: faster FHE instantiated with NTRU and LWE
• The Elements of Statistical Learning

This page was built for publication: Faster private decision tree evaluation for batched input from homomorphic encryption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6660541)