Secure Two-Party Frequent Itemset Mining With Guaranteeing Differential Privacy

IF 7.7 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Wenjie Chen;Haoyu Chen;Tingxuan Han;Wei Tong;Sheng Zhong
{"title":"Secure Two-Party Frequent Itemset Mining With Guaranteeing Differential Privacy","authors":"Wenjie Chen;Haoyu Chen;Tingxuan Han;Wei Tong;Sheng Zhong","doi":"10.1109/TMC.2024.3464744","DOIUrl":null,"url":null,"abstract":"Frequent itemset mining is an essential task in data analysis. Therefore, it is crucial to design practical methods for privacy-preserving frequent itemset mining, enabling private data analysis. For two-party data analysis tasks, each party possesses its portion of the data and is reluctant to share the data with the other. While secure computation can enable two-party frequent itemset mining, the output of exact top-\n<inline-formula><tex-math>$k$</tex-math></inline-formula>\n itemsets may still leave the adversary a chance to infer the sensitive information. Differential privacy has been utilized in various data analysis tasks to safeguard participating individuals. However, addressing how to ensure differential privacy for two-party frequent itemset mining remains unexplored. To prevent each party’s data from being leaked to the other while achieving differential privacy for releasing the output, this paper investigates the problem of differentially private two-party frequent itemset mining. We first propose a practical method that can efficiently select the frequent items of the union of two confidential databases in a differentially private way without the need to combine all elements. Then we extend this technique for general frequent itemset mining. Extensive experiments were conducted on real-world datasets, and the results show that the proposed method can achieve satisfactory utility with affordable overheads.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 1","pages":"276-292"},"PeriodicalIF":7.7000,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Mobile Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10684534/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Frequent itemset mining is an essential task in data analysis. Therefore, it is crucial to design practical methods for privacy-preserving frequent itemset mining, enabling private data analysis. For two-party data analysis tasks, each party possesses its portion of the data and is reluctant to share the data with the other. While secure computation can enable two-party frequent itemset mining, the output of exact top- $k$ itemsets may still leave the adversary a chance to infer the sensitive information. Differential privacy has been utilized in various data analysis tasks to safeguard participating individuals. However, addressing how to ensure differential privacy for two-party frequent itemset mining remains unexplored. To prevent each party’s data from being leaked to the other while achieving differential privacy for releasing the output, this paper investigates the problem of differentially private two-party frequent itemset mining. We first propose a practical method that can efficiently select the frequent items of the union of two confidential databases in a differentially private way without the need to combine all elements. Then we extend this technique for general frequent itemset mining. Extensive experiments were conducted on real-world datasets, and the results show that the proposed method can achieve satisfactory utility with affordable overheads.
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Mobile Computing
IEEE Transactions on Mobile Computing 工程技术-电信学
CiteScore
12.90
自引率
2.50%
发文量
403
审稿时长
6.6 months
期刊介绍: IEEE Transactions on Mobile Computing addresses key technical issues related to various aspects of mobile computing. This includes (a) architectures, (b) support services, (c) algorithm/protocol design and analysis, (d) mobile environments, (e) mobile communication systems, (f) applications, and (g) emerging technologies. Topics of interest span a wide range, covering aspects like mobile networks and hosts, mobility management, multimedia, operating system support, power management, online and mobile environments, security, scalability, reliability, and emerging technologies such as wearable computers, body area networks, and wireless sensor networks. The journal serves as a comprehensive platform for advancements in mobile computing research.
×
引用
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学术官方微信