Brief Announcement: Privacy Preserving Mining of Distributed Data Using a Trusted and Partitioned Third Party
- 1.2k Downloads
We like to discuss the usability of new architecture of partitioned third party, offered in  for conducting a new protocols for data mining algorithms over shared data base between multiple data holders. Current solution for data mining over partitioned data base are: Data anonimization , homomorphic encryption , trusted third party  or secure multiparty computation algorithms . Current solutions suffer from different problems such as expensive algorithms in terms of computation overhead and required communication rounds, revealing private information to third party. The new architecture offered by Sherman et al. allow the data holders to use simple masking techniques that are not expensive in computation nor assume trust in the third party, yet allow to perform simple and complex data mining algorithms between multiple data owners while private data is not revealed. That come with the assumption of no collude between the two parts of the PTTP.
KeywordsPrivacy Preserving Mining Requires Communication Rounds Multiple Data Owners Data-based Partitioning Shared Data Base
The authors would like to thank Tassa Tamir, for providing very helpful comments on the algorithms presented here.
- 1.Chow, S.S.M., Lee, J.-H., Subramanian, L.: Two-party computation model for privacy-preserving queries over distributed databases. In: NDSS 2009Google Scholar