Privacy preserving frequency mining in 2-part fully distributed setting

7Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

Recently, privacy preservation has become one of the key issues in data mining. In many data mining applications, computing frequencies of values or tuples of values in a data set is a fundamental operation repeatedly used. Within the context of privacy preserving data mining, several privacy preserving frequency mining solutions have been proposed. These solutions are crucial steps in many privacy preserving data mining tasks. Each solution was provided for a particular distributed data scenario. In this paper, we consider privacy preserving frequency mining in a so-called 2-part fully distributed setting. In this scenario, the dataset is distributed across a large number of users in which each record is owned by two different users, one user only knows the values for a subset of attributes, while the other knows the values for the remaining attributes. A miner aims to compute the frequencies of values or tuples of values while preserving each user's privacy. Some solutions based on randomization techniques can address this problem, but suffer from the tradeoff between privacy and accuracy. We develop a cryptographic protocol for privacy preserving frequency mining, which ensures each user's privacy without loss of accuracy. The experimental, results show that our protocol is efficient as well. Copyright © 2010 The Institute of Electronics, Information and Communication Engineers.

Cite

CITATION STYLE

APA

Luong, D., & Ho, T. B. (2010). Privacy preserving frequency mining in 2-part fully distributed setting. IEICE Transactions on Information and Systems, E93-D(10), 2702–2708. https://doi.org/10.1587/transinf.E93.D.2702

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free