An efficient private evaluation of a decision graph

DOI10.1007/978-3-030-12146-4_10MaRDI QIDQ1736045zbMATH OpenOpenAlexFDO

Authors Hiroki Sudo, Koji Nuida, Kana Shimizu

Publication date 29 March 2019

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

zbMATH Keywords

homomorphic encryptiondecision graphGLOUDS

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Privacy of data (68P27)

Recommendations

• Efficient secure multi-party protocols for decision tree classification
• Privacy-preserving classifier learning
• Private decision tree evaluation with constant rounds via (only) SS-3PC over ring
• Public verifiable private decision tree prediction
• Private Decision Tree Evaluation with Constant Rounds via (Only) Fair SS-4PC

Cited in

(4)

• Private evaluation of a decision tree based on secret sharing
• Public verifiable private decision tree prediction
• Efficient secure multi-party protocols for decision tree classification
• Private decision tree evaluation with constant rounds via (only) SS-3PC over ring

This page was built for publication: An efficient private evaluation of a decision graph

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