Faster private decision tree evaluation for batched input from homomorphic encryption

DOI10.1007/978-3-031-71073-5_1MaRDI QIDQ6660541zbMATH OpenFDO

Authors Kelong Cong, Jiayi Kang, Georgio Nicolas, Jeongeun Park

Publication date 10 January 2025

Full work available at URL https://doi.org/10.1007/978-3-031-71073-5_1

zbMATH Keywords

homomorphic encryptionmachine learningprivate decision tree evaluation

Mathematics Subject Classification ID

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

Recommendations

• Efficient and privacy-preserving tree-based inference via additive homomorphic encryption
• Private Decision Tree Evaluation with Constant Rounds via (Only) Fair SS-4PC
• Private decision tree evaluation with constant rounds via (only) SS-3PC over ring
• Public verifiable private decision tree prediction
• Efficient secure multi-party protocols for decision tree classification

Cites work

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

Cited in

(1)

• Two-party decision tree training from updatable order-revealing encryption

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)