A High Collusion-Resistant Approach to Distributed Privacy-preserving Data Mining
スポンサーリンク
概要
- 論文の詳細を見る
Data mining across different companies, organizations, online shops, or the likes, called sites, is necessary so as to discover valuable shared patterns, associations, trends, or dependencies in their shared data. Privacy, however, is a concern. In many situations it is required that data mining should be conducted without any privacy being violated. In response to this requirement, this paper proposes an effective distributed privacy-preserving data mining approach called CRDM (Collusion-Resistant Data Mining). CRDM is characterized by its ability to resist the collusion. Unless all sites but the victim collude, privacy of a site cannot be violated. Considering that for such applications that need not so high a level of security, excess security assurance would incur extra costs in communication, an extension scheme is also presented so that communication cost can be restrained while still maintaining a user-specified level of security. Results of both analytical and experimental performance study demonstrate the effectiveness of CRDM.
- 一般社団法人情報処理学会の論文
- 2007-06-15
著者
-
Takata Toyoo
Faculty Of Software And Information Science Iwate Prefectural University
-
Takata Toyoo
Iwate Prefectural University
-
Wang Jiahong
Faculty Of Software And Information Science Iwate Prefectural University
-
URABE SHINTARO
Faculty of Software and Information Science, Iwate Prefectural University
-
KODAMA EIICHIRO
Faculty of Software and Information Science, Iwate Prefectural University
-
WANG JIAHONG
Iwate Prefectural University
-
Urabe Shintaro
Faculty Of Software And Information Science Iwate Prefectural University:(present Office)hitachi Eas
-
Kodama Eiichiro
Faculty Of Software And Information Science Iwate Prefectural University
-
Wang Jiahong
Faculty of Software and Information Science, Iwate Prefectural University
関連論文
- 4K-1 Load Balancing in Parallel Database Systems
- A Soft-Decision Iterative Decoding Algorithm Using a Top-Down and Recursive Minimum Distance Search(Special Section on Information Theory and Its Applications)
- Improving Performance of Parallel Database Systems by Reorganizing Database On-Line
- On the Number of Minimum Weight Codewords of Subcodes of Reed-Muller Codes (Special Section on Information Theory and Its Applications)
- A High Collusion-Resistant Approach to Distributed Privacy-preserving Data Mining
- Mining Sequential Patterns More Efficiently by Reducing the Cost of Scanning Sequence Databases(Data Mining)
- Mining Frequent Patterns Securely in Distributed System(Data Mining)
- Assuring Interoperability of Heterogeneous Multi-Agent Systems(Agento-Based Systems)(Assurance Systems and Networks)
- Mining Sequential Patterns More Efficiently by Reducing the Cost of Scanning Sequence Databases
- Mining Sequential Patterns More Efficiently by Reducing the Cost of Scanning Sequence Databases
- A High Collusion-Resistant Approach to Distributed Privacy-preserving Data Mining
- A High Collusion-Resistant Approach to Distributed Privacy-preserving Data Mining