Efficient secure multi-party protocols for decision tree classification

DOI10.1007/978-3-030-21548-4_20MaRDI QIDQ2183936zbMATH OpenOpenAlexFDO

Authors Atsunori Ichikawa, Wakaha Ogata, Koki Hamada, Ryo Kikuchi

Publication date 27 May 2020

Full work available at URL https://doi.org/10.1007/978-3-030-21548-4_20

zbMATH Keywords

decision treemulti-party computationoblivious RAM

Mathematics Subject Classification ID

Computer security (68M25) Privacy of data (68P27) Communication complexity, information complexity (68Q11) Learning and adaptive systems in artificial intelligence (68T05) Cryptography (94A60)

Recommendations

• Private Decision Tree Evaluation with Constant Rounds via (Only) Fair SS-4PC
• An efficient private evaluation of a decision graph
• Privacy-preserving classifier learning
• Private decision tree evaluation with constant rounds via (only) SS-3PC over ring
• Batching multiple protocols to improve efficiency of multi-party computation

Cited in

(8)

• An efficient private evaluation of a decision graph
• Public verifiable private decision tree prediction
• Private decision tree evaluation with constant rounds via (only) SS-3PC over ring
• Leakage-Free Dissemination of Authenticated Tree-Structured Data With Multi-Party Control
• Efficient unconditionally secure comparison and privacy preserving machine learning classification protocols
• Private Decision Tree Evaluation with Constant Rounds via (Only) Fair SS-4PC
• Two-party decision tree training from updatable order-revealing encryption
• Faster private decision tree evaluation for batched input from homomorphic encryption

This page was built for publication: Efficient secure multi-party protocols for decision tree classification

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