Mohammad Anagreh: “Privacy-preserving parallel computations for graph problems”
Introduction: Privacy-preserving computation is a crucial discipline that protects the privacy of confidential data while facilitating secure analysis. In graph problems, secure multiparty computation (SMC) presents a promising approach to performing these functionalities. This article delves into the notable advancements in privacy-preserving parallel algorithms recently introduced in a Ph.D. thesis. By integrating graph algorithms with […]