Privacy Preserving Association Rules based on Compression and Cryptography (PPAR-CC)

W. A. Salman, S. Sadkhan
{"title":"Privacy Preserving Association Rules based on Compression and Cryptography (PPAR-CC)","authors":"W. A. Salman, S. Sadkhan","doi":"10.1109/ICOASE51841.2020.9436603","DOIUrl":null,"url":null,"abstract":"Privacy-Preserving Data Mining (PPDM) is a modern technique through which data is mined while maintaining the confidentiality and privacy of sensitive information from unauthorized persons. The Privacy-Preserving Association Rules Mining (PPARM) is the most important technique for privacy-preserving data mining. PPARM means the mining of association rules with preserving the non-disclosure of sensitive correlations among items or features for competitors or the public, especially data of sensitive organizations such as financial organizations and others. In this paper, we propose an approach to hiding association rules after performing the mining process and obtaining knowledge through vertical and horizontal compressing then encoded the compressing form by using cryptography methods. The proposed approach is resistant to many known attacks and is undetectable because it includes three stages of compression and encryption in which the basic representation and size of the data change dramatically. The proposed approach significantly reduces storage space, maintains knowledge security, reduces transmission time, and facilitates the transmission of knowledge over any network.","PeriodicalId":126112,"journal":{"name":"2020 International Conference on Advanced Science and Engineering (ICOASE)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Advanced Science and Engineering (ICOASE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOASE51841.2020.9436603","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Privacy-Preserving Data Mining (PPDM) is a modern technique through which data is mined while maintaining the confidentiality and privacy of sensitive information from unauthorized persons. The Privacy-Preserving Association Rules Mining (PPARM) is the most important technique for privacy-preserving data mining. PPARM means the mining of association rules with preserving the non-disclosure of sensitive correlations among items or features for competitors or the public, especially data of sensitive organizations such as financial organizations and others. In this paper, we propose an approach to hiding association rules after performing the mining process and obtaining knowledge through vertical and horizontal compressing then encoded the compressing form by using cryptography methods. The proposed approach is resistant to many known attacks and is undetectable because it includes three stages of compression and encryption in which the basic representation and size of the data change dramatically. The proposed approach significantly reduces storage space, maintains knowledge security, reduces transmission time, and facilitates the transmission of knowledge over any network.
基于压缩和加密的隐私保护关联规则(PPAR-CC)
隐私保护数据挖掘(PPDM)是一种现代技术,通过该技术可以在挖掘数据的同时保持敏感信息的机密性和隐私性。隐私保护关联规则挖掘(PPARM)是隐私保护数据挖掘中最重要的技术。PPARM是指对关联规则进行挖掘,同时保留竞争对手或公众的项目或特征之间的敏感相关性,特别是金融机构等敏感组织的数据。在本文中,我们提出了一种隐藏关联规则的方法,在进行挖掘过程后,通过垂直和水平压缩获取知识,然后使用密码学方法对压缩形式进行编码。所提出的方法可以抵抗许多已知的攻击,并且无法检测,因为它包括三个阶段的压缩和加密,其中数据的基本表示和大小发生了巨大的变化。该方法大大减少了存储空间,维护了知识的安全性,缩短了传输时间,并使知识在任何网络上都能方便地传输。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信