基于分层同态加密的隐私保护分布式关联规则挖掘

Shubhra Rana, P. S. Thilagam
{"title":"基于分层同态加密的隐私保护分布式关联规则挖掘","authors":"Shubhra Rana, P. S. Thilagam","doi":"10.1109/ICIT.2014.14","DOIUrl":null,"url":null,"abstract":"Privacy is an important issue in the field of distributed association rule mining, where multiple parties collaborate to perform mining on the collective data. The parties do not want to reveal sensitive data to other parties. Most of the existing techniques for privacy preserving distributed association rule mining suffer from weak privacy guarantees and have a high computational cost involved. We propose a novel privacy preserving distributed association rule mining scheme based on Paillier additive homomorphic cryptosystem. The experimental results demonstrate that the proposed scheme is more efficient and scalable compared to the existing techniques based on homomorphic encryption.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"72 1","pages":"379-385"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Hierarchical Homomorphic Encryption Based Privacy Preserving Distributed Association Rule Mining\",\"authors\":\"Shubhra Rana, P. S. Thilagam\",\"doi\":\"10.1109/ICIT.2014.14\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Privacy is an important issue in the field of distributed association rule mining, where multiple parties collaborate to perform mining on the collective data. The parties do not want to reveal sensitive data to other parties. Most of the existing techniques for privacy preserving distributed association rule mining suffer from weak privacy guarantees and have a high computational cost involved. We propose a novel privacy preserving distributed association rule mining scheme based on Paillier additive homomorphic cryptosystem. The experimental results demonstrate that the proposed scheme is more efficient and scalable compared to the existing techniques based on homomorphic encryption.\",\"PeriodicalId\":6486,\"journal\":{\"name\":\"2014 17th International Conference on Computer and Information Technology (ICCIT)\",\"volume\":\"72 1\",\"pages\":\"379-385\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 17th International Conference on Computer and Information Technology (ICCIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIT.2014.14\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 17th International Conference on Computer and Information Technology (ICCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIT.2014.14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

隐私是分布式关联规则挖掘领域的一个重要问题,在分布式关联规则挖掘中,多方协作对集体数据进行挖掘。双方不希望将敏感数据泄露给其他各方。现有的保护隐私的分布式关联规则挖掘技术大多存在隐私保障不强、计算成本高的问题。提出了一种新的基于Paillier加性同态密码系统的隐私保护分布式关联规则挖掘方案。实验结果表明,与现有的基于同态加密的方案相比,该方案具有更高的效率和可扩展性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Hierarchical Homomorphic Encryption Based Privacy Preserving Distributed Association Rule Mining
Privacy is an important issue in the field of distributed association rule mining, where multiple parties collaborate to perform mining on the collective data. The parties do not want to reveal sensitive data to other parties. Most of the existing techniques for privacy preserving distributed association rule mining suffer from weak privacy guarantees and have a high computational cost involved. We propose a novel privacy preserving distributed association rule mining scheme based on Paillier additive homomorphic cryptosystem. The experimental results demonstrate that the proposed scheme is more efficient and scalable compared to the existing techniques based on homomorphic encryption.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Android IR - Full-Text Search for Android Impurity Measurement in Selecting Decision Node Tree that Tolerate Noisy Cases A Comparative Study of IXP in Europe and US from a Complex Network Perspective Ensemble Features Selection Algorithm by Considering Features Ranking Priority User Independency of SSVEP Based Brain Computer Interface Using ANN Classifier: Statistical Approach
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1