{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T09:37:48Z","timestamp":1774690668963,"version":"3.50.1"},"reference-count":36,"publisher":"Oxford University Press (OUP)","issue":"2","license":[{"start":{"date-parts":[[2020,12,22]],"date-time":"2020-12-22T00:00:00Z","timestamp":1608595200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"name":"National Key AI Program of China","award":["2018AAA0100503"],"award-info":[{"award-number":["2018AAA0100503"]}]},{"name":"National Key AI Program of China","award":["2018AAA0100500"],"award-info":[{"award-number":["2018AAA0100500"]}]},{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"publisher","award":["62072304"],"award-info":[{"award-number":["62072304"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"publisher","award":["61772341"],"award-info":[{"award-number":["61772341"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"publisher","award":["61472254"],"award-info":[{"award-number":["61472254"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"publisher","award":["61770238"],"award-info":[{"award-number":["61770238"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003399","name":"Shanghai Municipal Science and Technology Commission","doi-asserted-by":"publisher","award":["18511103002"],"award-info":[{"award-number":["18511103002"]}],"id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003399","name":"Shanghai Municipal Science and Technology Commission","doi-asserted-by":"publisher","award":["19510760500"],"award-info":[{"award-number":["19510760500"]}],"id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003399","name":"Shanghai Municipal Science and Technology Commission","doi-asserted-by":"publisher","award":["19511101500"],"award-info":[{"award-number":["19511101500"]}],"id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Program for Changjiang Young Scholars in the University of China"},{"name":"Program for China Top Young Talents"},{"name":"Program for Shanghai Top Young Talents"},{"name":"SJTU Global Strategic Partnership Fund"},{"name":"Oceanic Interdisciplinary Program of Shanghai Jiao Tong University","award":["SL2020MS032"],"award-info":[{"award-number":["SL2020MS032"]}]},{"name":"Scientific Research Fund of Second Institute of Oceanography","award":["SL2020MS032"],"award-info":[{"award-number":["SL2020MS032"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,2,19]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Data trading has attracted increasing attention over the years as a cost-effective business paradigm, probably producing a tremendous amount of economic value. However, the study of query-based trading in the user data market is still in the initial stage. To design a practical user data trading mechanism, we have to consider three major challenges: privacy concern, compensation cost minimization and revenue maximization in a Bayesian environment. By jointly considering these challenges, we propose a profit-maximizing mechanism for user data trading with personalized differential privacy, called READ, which comprised two components, READ-COST for cost minimization and READ-REV for revenue maximization. Especially, READ adopts personalized differential privacy to satisfy each data owner\u2019s diverse privacy preferences. READ-COST greedily selects the most cost-effective data owner to achieve the sub-optimal data query cost. Given this query cost, READ-REV calculates the maximum expected revenue in a Bayesian setting. Through rigorous theoretical analysis and real-data based experiments, we demonstrate that READ achieves all desired properties and approaches the optimal profit.<\/jats:p>","DOI":"10.1093\/comjnl\/bxaa157","type":"journal-article","created":{"date-parts":[[2020,11,26]],"date-time":"2020-11-26T12:19:05Z","timestamp":1606393145000},"page":"264-280","source":"Crossref","is-referenced-by-count":6,"title":["A Profit-maximizing Mechanism for Query-based Data Trading with Personalized Differential Privacy"],"prefix":"10.1093","volume":"64","author":[{"given":"Hui","family":"Cai","sequence":"first","affiliation":[{"name":"College of Computer, Nanjing University of Posts and Telecommunications, Nanjing, Jiangsu 210023, China"},{"name":"Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai 200240, China"}]},{"given":"Yanmin","family":"Zhu","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai 200240, China"}]},{"given":"Jie","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai 200240, China"}]},{"given":"Jiadi","family":"Yu","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai 200240, China"}]}],"member":"286","published-online":{"date-parts":[[2020,12,22]]},"reference":[{"key":"2021021509575280300_ref1","author":"(2008), Gnip"},{"key":"2021021509575280300_ref2","author":"(2009), AggData"},{"key":"2021021509575280300_ref3","author":"(2014), Microsoft Azure Marketplace"},{"key":"2021021509575280300_ref4","author":"(2009), Infochimps"},{"key":"2021021509575280300_ref5","article-title":"Behavior targeting","author":"(2017), Twitter"},{"key":"2021021509575280300_ref6","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1145\/3139457","article-title":"A theory of pricing private data","volume":"60","author":"Li","year":"2017","journal-title":"Commun. ACM"},{"key":"2021021509575280300_ref7","doi-asserted-by":"crossref","first-page":"26:1","DOI":"10.1145\/3084041.3084044","article-title":"An Online Pricing Mechanism for Mobile Crowdsensing Data Markets","volume-title":"Proc. 18th ACM Int. Symposium on Mobile Ad Hoc Networking and Computing","author":"Zheng","year":"2017"},{"key":"2021021509575280300_ref8","first-page":"2031","article-title":"Unlocking the Value of Privacy: Trading Aggregate Statistics Over Private Correlated Data","volume-title":"KDD 2018","author":"Niu","year":"2018"},{"key":"2021021509575280300_ref9","author":"(2000), Big"},{"key":"2021021509575280300_ref10","author":"(2014), Dataexchange"},{"key":"2021021509575280300_ref11","doi-asserted-by":"crossref","first-page":"25:1","DOI":"10.1145\/3326285.3329060","article-title":"Towards Privacy-Preserving Data Trading for Web Browsing History","volume-title":"Proc. Int. Symposium on Quality of Service, IWQoS 2019","author":"Cai","year":"2019"},{"key":"2021021509575280300_ref12","first-page":"1106","article-title":"Privacy-Preserving Social Media Data Outsourcing","volume-title":"INFOCOM 2018","author":"Zhang","year":"2018"},{"key":"2021021509575280300_ref13","first-page":"1","article-title":"Differential privacy In Proc. 33rd International Colloquium","volume-title":"ICALP 2006","author":"Dwork","year":"2011"},{"key":"2021021509575280300_ref14","first-page":"1023","article-title":"Conservative or Liberal? Personalized Differential Privacy","volume-title":"31st IEEE Int. Conf. Data Engineering, ICDE","author":"Jorgensen","year":"2015"},{"key":"2021021509575280300_ref15","doi-asserted-by":"crossref","first-page":"1339","DOI":"10.1109\/TC.2015.2470247","article-title":"Privacy protection for preventing data over-collection in smart city","volume":"65","author":"Li","journal-title":"IEEE Trans. Comput."},{"key":"2021021509575280300_ref16","first-page":"1","article-title":"How to balance privacy and money through pricing mechanism in personal data market","author":"Nget","year":"2017"},{"key":"2021021509575280300_ref17","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/2463676.2465335","article-title":"Toward Practical Query Pricing with Querymarket","volume-title":"Proc. ACM SIGMOD Int. Conf. Management of Data, SIGMOD 2013","author":"Koutris","year":"2013"},{"key":"2021021509575280300_ref18","first-page":"199","article-title":"Selling Privacy at Auction","volume-title":"Proc. 12th ACM Conf. Electronic Commerce (EC-2011)","author":"Ghosh","year":"2011"},{"key":"2021021509575280300_ref19","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1145\/2896377.2901461","article-title":"The Value of Privacy: Strategic Data Subjects, Incentive Mechanisms and Fundamental Limits","volume-title":"Proc. 2016 ACM SIGMETRICS Int. Conf. Measurement and Modeling of Computer Science","author":"Wang","year":"2016"},{"key":"2021021509575280300_ref20","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1287\/moor.6.1.58","article-title":"Optimal auction design","volume":"6","author":"Myerson","year":"1981","journal-title":"Math. Oper. Res."},{"key":"2021021509575280300_ref21","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1109\/JSAC.2017.2659258","article-title":"Trading data in the crowd: Profit-driven data acquisition for mobile crowdsensing","volume":"35","author":"Zheng","year":"2017","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"2021021509575280300_ref22","volume-title":"Algorithmic Game Theory","author":"Roughgarden","year":"2007"},{"key":"2021021509575280300_ref23","doi-asserted-by":"crossref","first-page":"98","DOI":"10.2307\/41165823","article-title":"Frames of reference and buyers\u2019 perception of price and value","volume":"38","author":"Smith","year":"1995","journal-title":"California Manag. Rev."},{"key":"2021021509575280300_ref24","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1145\/3148330.3148340","article-title":"Modeling User Intrinsic Characteristic on Social Media for Identity Linkage","volume-title":"Proc. 2018 ACM Conf. Supporting Groupwork, GROUP 2018","author":"Yu","year":"2018"},{"key":"2021021509575280300_ref25","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF02579435","article-title":"An analysis of the greedy algorithm for the submodular set covering problem","volume":"2","author":"Wolsey","year":"1982","journal-title":"Combinatorica"},{"key":"2021021509575280300_ref26","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1109\/MAHC.1984.10036","article-title":"A survey of Russian approaches to Perebor (brute-force searches) algorithms","volume":"6","author":"Trakhtenbrot","year":"1984","journal-title":"IEEE Ann. Hist. Comput."},{"key":"2021021509575280300_ref27","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.elerap.2013.11.001","article-title":"Approximations to auctions of digital goods with share-averse bidders","volume":"13","author":"Pei","year":"2014","journal-title":"Electron. Commer. Res. Appl."},{"key":"2021021509575280300_ref28","doi-asserted-by":"crossref","first-page":"1231","DOI":"10.1109\/INFOCOM.2014.6848055","article-title":"TRAC: Truthful Auction for Location-Aware Collaborative Sensing in Mobile Crowdsourcing","volume-title":"2014 IEEE Conf. Computer Communications, INFOCOM 2014","author":"Feng","year":"2014"},{"key":"2021021509575280300_ref29","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/MSP.2005.22","article-title":"Privacy and rationality in individual decision making","volume":"3","author":"Acquisti","year":"2005","journal-title":"IEEE Secur. Privacy"},{"key":"2021021509575280300_ref30","first-page":"261","article-title":"How Much Can Behavioral Targeting Help Online Advertising","volume-title":"Proc. 18th Int. Conf. World Wide Web","author":"Yan","year":"2009"},{"key":"2021021509575280300_ref31","first-page":"663","article-title":"Revenue Maximization for Finitely Repeated Ad Auctions","volume-title":"Proc. Thirty-First AAAI Conf. Artificial Intelligence","author":"Rong","year":"2017"},{"key":"2021021509575280300_ref32","first-page":"94","article-title":"Mechanism Design via Differential Privacy","volume-title":"48th Annual IEEE Symposium on Foundations of Computer Science","author":"McSherry","year":"2007"},{"key":"2021021509575280300_ref33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.5210\/fm.v17i5.4013","article-title":"A market for unbiased private data: Paying individuals according to their privacy attitudes","volume":"17","author":"Aperjis","year":"2012","journal-title":"First Monday"},{"key":"2021021509575280300_ref34","volume-title":"Game Theory","author":"Fudenberg","year":"1991"},{"key":"2021021509575280300_ref35","author":"(2011), Datatang"},{"key":"2021021509575280300_ref36","article-title":"A Profit-Maximizing Mechanism for Query-Based Data Trading with Personalized Differential Privacy","author":"Cai","year":"2019"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/64\/2\/264\/36258859\/bxaa157.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/64\/2\/264\/36258859\/bxaa157.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T23:59:05Z","timestamp":1669766345000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/64\/2\/264\/6043302"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,22]]},"references-count":36,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2020,12,22]]},"published-print":{"date-parts":[[2021,2,19]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxaa157","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2021,2]]},"published":{"date-parts":[[2020,12,22]]}}}