Abstract Most existing Secure Multi-Party Computation (MPC) protocols for privacy-preserving training of decision trees over distributed data assume that the features are categorical. In real-life applications, often numerical. The standard “in clear” algorithm to grow on with continuous values requires sorting examples each feature in quest an optimal cut-point range node. Sorting is expensive...