Abstract

Data mining is an important task to understand the valuable information for making right decision. There are numerous mature technologies for mining self-owned data of a party. However, how to perform distributed data mining to obtain information from data owned by multi-party without privacy leak is still a challenge. In recent years, secure multi-party computation (MPC) shows its potential capability for solving this problem. Meanwhile, there are a number of problems to be solved before utilizing in business environment. In this paper, we point out two unsupported tasks of MPC that are common in real-world. Towards this end, we design algorithms based on optimized matrix computation with one-hot encoding and LU decomposition to support these in MPC context requirements. In addition, we implement them based on a SPDZ protocol, a computation framework of MPC. The experimental evaluation results demonstrate that our design and implementation are feasible and effective for privacy preserving distributed data mining.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.