Private evaluation of a decision tree based on secret sharing

DOI10.1007/978-3-031-29371-9_9OpenAlexW4361854673MaRDI QIDQ6176061

Kana Shimizu, Mohammad Nabil Ahmed

Publication date: 21 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-29371-9_9

zbMATH Keywords

secret sharingprivate decision tree evaluationprivacy preserving machine learning

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer security (68M25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear construction of secret sharing schemes
• An efficient private evaluation of a decision graph
• Homomorphic encryption and secure comparison
• Two Halves Make a Whole
• How to share a secret
• Improved Garbled Circuit: Free XOR Gates and Applications
• Improved Primitives for Secure Multiparty Integer Computation
• Efficient and Secure Comparison for On-Line Auctions
• Secret Sharing Comparison by Transformation and Rotation
• Foundations of Cryptography
• Non-interactive Proofs for Integer Multiplication
• Practical and Secure Solutions for Integer Comparison
• Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
• Theory of Cryptography

This page was built for publication: Private evaluation of a decision tree based on secret sharing