为汇总统计实现隐私保护和实用数据交易

IF 3 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Fan Yang;Xiaofeng Liao;Xinyu Lei;Nankun Mu;Di Zhang
{"title":"为汇总统计实现隐私保护和实用数据交易","authors":"Fan Yang;Xiaofeng Liao;Xinyu Lei;Nankun Mu;Di Zhang","doi":"10.1109/TSUSC.2023.3331179","DOIUrl":null,"url":null,"abstract":"Data trading is an effective way for commercial companies to obtain massive personal data to develop their data-driven businesses. However, when data owners may want to sell their data without revealing privacy, data consumers also face the dilemma of high purchase costs due to purchasing too much invalid data. Therefore, there is an urgent need for a data trading scheme that can protect personal privacy and save expenses simultaneously. In this paper, we design a priv\n<bold>AC</b>\ny-preserving and pra\n<bold>C</b>\ntical aggr\n<bold>E</b>\ngate \n<bold>S</b>\ntati\n<bold>S</b>\ntic trading scheme (named as ACCESS). Technically, we focus on the group-level pricing strategy to make ACCESS easier to implement. The differential privacy technique is applied to protect the data owners’ privacy, and the sampling algorithm is adopted to reduce the data consumers’ costs. Specifically, to provide a maximum tolerant privacy loss guarantee for the data owners, we design a decision algorithm to detect whether a conflict occurs between the consumer-specified accuracy level and the maximum tolerable privacy loss budget. Besides, to minimize the purchase cost for the data brokers, we develop a sampling-based aggregation method consisting of two sampling algorithms (called as BUSA and BKSA, respectively). BUSA enables reducing purchase costs with no additional background knowledge. Once the data broker knows the data boundary, BKSA can significantly reduce the amount of data that needs to be purchased, thereby the purchase cost is reduced. Rigorous theoretical analysis and extensive experiments (over four real-world and public datasets) further demonstrate the practicability of ACCESS.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 3","pages":"452-463"},"PeriodicalIF":3.0000,"publicationDate":"2023-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Towards Privacy-Preserving and Practical Data Trading for Aggregate Statistic\",\"authors\":\"Fan Yang;Xiaofeng Liao;Xinyu Lei;Nankun Mu;Di Zhang\",\"doi\":\"10.1109/TSUSC.2023.3331179\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Data trading is an effective way for commercial companies to obtain massive personal data to develop their data-driven businesses. However, when data owners may want to sell their data without revealing privacy, data consumers also face the dilemma of high purchase costs due to purchasing too much invalid data. Therefore, there is an urgent need for a data trading scheme that can protect personal privacy and save expenses simultaneously. In this paper, we design a priv\\n<bold>AC</b>\\ny-preserving and pra\\n<bold>C</b>\\ntical aggr\\n<bold>E</b>\\ngate \\n<bold>S</b>\\ntati\\n<bold>S</b>\\ntic trading scheme (named as ACCESS). Technically, we focus on the group-level pricing strategy to make ACCESS easier to implement. The differential privacy technique is applied to protect the data owners’ privacy, and the sampling algorithm is adopted to reduce the data consumers’ costs. Specifically, to provide a maximum tolerant privacy loss guarantee for the data owners, we design a decision algorithm to detect whether a conflict occurs between the consumer-specified accuracy level and the maximum tolerable privacy loss budget. Besides, to minimize the purchase cost for the data brokers, we develop a sampling-based aggregation method consisting of two sampling algorithms (called as BUSA and BKSA, respectively). BUSA enables reducing purchase costs with no additional background knowledge. Once the data broker knows the data boundary, BKSA can significantly reduce the amount of data that needs to be purchased, thereby the purchase cost is reduced. Rigorous theoretical analysis and extensive experiments (over four real-world and public datasets) further demonstrate the practicability of ACCESS.\",\"PeriodicalId\":13268,\"journal\":{\"name\":\"IEEE Transactions on Sustainable Computing\",\"volume\":\"9 3\",\"pages\":\"452-463\"},\"PeriodicalIF\":3.0000,\"publicationDate\":\"2023-11-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Sustainable Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10316186/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Sustainable Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10316186/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

数据交易是商业公司获取海量个人数据以发展数据驱动型业务的有效途径。然而,当数据拥有者希望在不泄露隐私的情况下出售数据时,数据消费者也面临着因购买过多无效数据而导致购买成本过高的窘境。因此,我们迫切需要一种既能保护个人隐私又能节省开支的数据交易方案。在本文中,我们设计了一种既能保护个人隐私,又能提高效率的数据交易方案(命名为 ACCESS)。在技术上,我们将重点放在组级定价策略上,以使 ACCESS 更容易实施。采用差分隐私技术保护数据所有者的隐私,采用抽样算法降低数据消费者的成本。具体来说,为了给数据所有者提供最大可容忍隐私损失保证,我们设计了一种决策算法来检测消费者指定的准确度水平与最大可容忍隐私损失预算之间是否存在冲突。此外,为了使数据经纪商的购买成本最小化,我们开发了一种基于采样的聚合方法,该方法由两种采样算法(分别称为 BUSA 和 BKSA)组成。BUSA 无需额外的背景知识就能降低购买成本。一旦数据经纪人知道了数据边界,BKSA 就能大大减少需要购买的数据量,从而降低购买成本。严谨的理论分析和广泛的实验(超过四个真实世界和公共数据集)进一步证明了 ACCESS 的实用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Towards Privacy-Preserving and Practical Data Trading for Aggregate Statistic
Data trading is an effective way for commercial companies to obtain massive personal data to develop their data-driven businesses. However, when data owners may want to sell their data without revealing privacy, data consumers also face the dilemma of high purchase costs due to purchasing too much invalid data. Therefore, there is an urgent need for a data trading scheme that can protect personal privacy and save expenses simultaneously. In this paper, we design a priv AC y-preserving and pra C tical aggr E gate S tati S tic trading scheme (named as ACCESS). Technically, we focus on the group-level pricing strategy to make ACCESS easier to implement. The differential privacy technique is applied to protect the data owners’ privacy, and the sampling algorithm is adopted to reduce the data consumers’ costs. Specifically, to provide a maximum tolerant privacy loss guarantee for the data owners, we design a decision algorithm to detect whether a conflict occurs between the consumer-specified accuracy level and the maximum tolerable privacy loss budget. Besides, to minimize the purchase cost for the data brokers, we develop a sampling-based aggregation method consisting of two sampling algorithms (called as BUSA and BKSA, respectively). BUSA enables reducing purchase costs with no additional background knowledge. Once the data broker knows the data boundary, BKSA can significantly reduce the amount of data that needs to be purchased, thereby the purchase cost is reduced. Rigorous theoretical analysis and extensive experiments (over four real-world and public datasets) further demonstrate the practicability of ACCESS.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Sustainable Computing
IEEE Transactions on Sustainable Computing Mathematics-Control and Optimization
CiteScore
7.70
自引率
2.60%
发文量
54
×
引用
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学术官方微信