安全的双方和多方关联规则挖掘

Saeed Samet, A. Miri
{"title":"安全的双方和多方关联规则挖掘","authors":"Saeed Samet, A. Miri","doi":"10.1109/CISDA.2009.5356544","DOIUrl":null,"url":null,"abstract":"Association rule mining provides useful knowledge from raw data in different applications such as health, insurance, marketing and business systems. However, many real world applications are distributed among two or more parties, each of which wants to keep its sensitive information private, while they collaboratively gaining some knowledge from their data. Therefore, secure and distributed solutions are needed that do not have a central or third party accessing the parties' original data. In this paper, we present a new protocol for privacy-preserving association rule mining to overcome the security flaws in existing solutions, with better performance, when data is vertically partitioned among two or more parties. Two sub-protocols for secure binary dot product and cardinality of set intersection for binary vectors are also designed which are used in the main protocols as building blocks.","PeriodicalId":6407,"journal":{"name":"2009 IEEE Symposium on Computational Intelligence for Security and Defense Applications","volume":"111 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Secure two and multi-party association rule mining\",\"authors\":\"Saeed Samet, A. Miri\",\"doi\":\"10.1109/CISDA.2009.5356544\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Association rule mining provides useful knowledge from raw data in different applications such as health, insurance, marketing and business systems. However, many real world applications are distributed among two or more parties, each of which wants to keep its sensitive information private, while they collaboratively gaining some knowledge from their data. Therefore, secure and distributed solutions are needed that do not have a central or third party accessing the parties' original data. In this paper, we present a new protocol for privacy-preserving association rule mining to overcome the security flaws in existing solutions, with better performance, when data is vertically partitioned among two or more parties. Two sub-protocols for secure binary dot product and cardinality of set intersection for binary vectors are also designed which are used in the main protocols as building blocks.\",\"PeriodicalId\":6407,\"journal\":{\"name\":\"2009 IEEE Symposium on Computational Intelligence for Security and Defense Applications\",\"volume\":\"111 1\",\"pages\":\"1-6\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-07-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE Symposium on Computational Intelligence for Security and Defense Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISDA.2009.5356544\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE Symposium on Computational Intelligence for Security and Defense Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISDA.2009.5356544","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

关联规则挖掘从不同应用程序(如健康、保险、营销和业务系统)中的原始数据中提供有用的知识。然而,许多现实世界的应用程序分布在两个或多个参与方之间,每个参与方都希望保持其敏感信息的私密性,同时他们协作地从他们的数据中获取一些知识。因此,需要安全的分布式解决方案,这些解决方案不需要中央或第三方访问双方的原始数据。在本文中,我们提出了一种新的保护隐私的关联规则挖掘协议,以克服现有解决方案中的安全缺陷,并在数据在两个或多个参与方之间垂直分区时具有更好的性能。设计了安全二进制点积和二进制向量集交基数两个子协议,作为主协议的构建块。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Secure two and multi-party association rule mining
Association rule mining provides useful knowledge from raw data in different applications such as health, insurance, marketing and business systems. However, many real world applications are distributed among two or more parties, each of which wants to keep its sensitive information private, while they collaboratively gaining some knowledge from their data. Therefore, secure and distributed solutions are needed that do not have a central or third party accessing the parties' original data. In this paper, we present a new protocol for privacy-preserving association rule mining to overcome the security flaws in existing solutions, with better performance, when data is vertically partitioned among two or more parties. Two sub-protocols for secure binary dot product and cardinality of set intersection for binary vectors are also designed which are used in the main protocols as building blocks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Evolving spiking neural networks: A novel growth algorithm corrects the teacher Emitter geolocation using low-accuracy direction-finding sensors Secure two and multi-party association rule mining Passive multitarget tracking using transmitters of opportunity Bias phenomenon and analysis of a nonlinear transformation in a mobile passive sensor network
×
引用
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