.png){kind=icon}
返回
Distributed anonymous data perturbation method for privacy-preserving data mining
.png){kind=icon}
PRE
AI
DOI：10.1631/jzus.A0820320.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Privacy is a critical requirement in distributed data mining. Cryptography-based secure multiparty computation is a main approach for privacy preserving. However, it shows poor performance in large scale distributed systems. Meanwhile, data perturbation techniques are comparatively efficient but are mainly used in centralized privacy-preserving data mining (PPDM). In this paper, we propose a light-weight anonymous data perturbation method for efficient privacy preserving in distributed data mining. We first define the privacy constraints for data perturbation based PPDM in a semi-honest distributed environment. Two protocols are proposed to address these constraints and protect data statistics and the randomization process against collusion attacks: the adaptive privacy-preserving summary protocol and the anonymous exchange protocol. Finally, a distributed data perturbation framework based on these protocols is proposed to realize distributed PPDM. Experiment results show that our approach achieves a high security level and is very efficient in a large scale distributed environment.
Keyword:
Privacy-preserving data mining (PPDM)
Distributed data mining
Data perturbation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.9
论文数:
2.1K
被引数:
4.6K
机构
引用论文
.png){kind=icon}
Reichardt, C., Solvents and Solvent Effects in Organic Chemistry, Weinheim: Wiley-VCH, 2003, 630 p.
PREAI
分享收藏分享收藏
查看更多内容