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

DOI10.1007/978-3-031-54770-6_12MaRDI QIDQ6547984zbMATH OpenFDO

Authors Robin M. Berger, Felix Dörre, Alexander K. Koch

Publication date 31 May 2024

Full work available at URL https://doi.org/10.1007/978-3-031-54770-6_12

zbMATH Keywords

decision-tree learningenclavesorder-revealing encryptionprivacy-preserving machine learningsecure computation

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Privacy of data (68P27) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Learning and adaptive systems in artificial intelligence (68T05) Cryptography (94A60)

Recommendations

• Efficient secure multi-party protocols for decision tree classification
• Order-revealing encryption and the hardness of private learning
• Faster private decision tree evaluation for batched input from homomorphic encryption
• ML confidential: machine learning on encrypted data
• Efficient multi-client order-revealing encryption and its applications

Cites work

• An introduction to machine learning
• Practical order-revealing encryption with limited leakage
• Semantically secure order-revealing encryption: multi-input functional encryption without obfuscation

Cited in

(1)

• PAORE: public-key authenticated order-revealing encryption

This page was built for publication: Two-party decision tree training from updatable order-revealing encryption

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