{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T14:24:01Z","timestamp":1770906241273,"version":"3.50.1"},"reference-count":60,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key R&D Program of China","award":["2021YFB3100300"],"award-info":[{"award-number":["2021YFB3100300"]}]},{"name":"National Key R&D Program of China","award":["NSFC-62372226"],"award-info":[{"award-number":["NSFC-62372226"]}]},{"name":"National Key R&D Program of China","award":["NSFC-62002159"],"award-info":[{"award-number":["NSFC-62002159"]}]},{"name":"National Key R&D Program of China","award":["NSFC-61872176"],"award-info":[{"award-number":["NSFC-61872176"]}]},{"name":"National Key R&D Program of China","award":["NSFC-62272215"],"award-info":[{"award-number":["NSFC-62272215"]}]},{"name":"Leading-edge Technology Program of Jiangsu NSF","award":["BK20202001"],"award-info":[{"award-number":["BK20202001"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Mobile Comput."],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1109\/tmc.2024.3464744","type":"journal-article","created":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T17:31:32Z","timestamp":1726767092000},"page":"276-292","source":"Crossref","is-referenced-by-count":5,"title":["Secure Two-Party Frequent Itemset Mining With Guaranteeing Differential Privacy"],"prefix":"10.1109","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9020-129X","authenticated-orcid":false,"given":"Wenjie","family":"Chen","sequence":"first","affiliation":[{"name":"State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-4899-9119","authenticated-orcid":false,"given":"Haoyu","family":"Chen","sequence":"additional","affiliation":[{"name":"State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-7578-9126","authenticated-orcid":false,"given":"Tingxuan","family":"Han","sequence":"additional","affiliation":[{"name":"State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8427-6068","authenticated-orcid":false,"given":"Wei","family":"Tong","sequence":"additional","affiliation":[{"name":"State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6581-8730","authenticated-orcid":false,"given":"Sheng","family":"Zhong","sequence":"additional","affiliation":[{"name":"State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3468791.3468807"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-010-9059-9"},{"key":"ref3","first-page":"487","article-title":"Fast algorithms for mining association rules in large databases","volume-title":"Proc. 20th Int. Conf. Very Large Data Bases","author":"Agrawal"},{"key":"ref4","first-page":"487","article-title":"Fast algorithms for mining association rules","volume-title":"Proc. 20th Int. Conf. Very Large Data Bases","author":"Agrawal"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159702"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835869"},{"key":"ref7","first-page":"2147","article-title":"Secure multi-party computation of differentially private median","volume-title":"Proc. 29th USENIX Secur. Symp.","author":"B\u00f6hler"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2020.24150"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484557"},{"issue":"12","key":"ref10","doi-asserted-by":"crossref","first-page":"1422","DOI":"10.14778\/2536274.2536329","article-title":"Mining frequent patterns with differential privacy","volume":"6","author":"Bonomi","year":"2013","journal-title":"Proc. VLDB Endowment"},{"key":"ref11","first-page":"1109","article-title":"Differentially private top-k selection via stability on unknown domain","volume-title":"Proc. 36th Conf. Uncertainty Artif. Intell.","author":"Carvalho"},{"key":"ref12","article-title":"LDP-FPMiner: FP-tree based frequent itemset mining with local differential privacy","author":"Chen","year":"2022"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020579"},{"key":"ref14","volume-title":"Introduction to Algorithms, 3rd ed","author":"Cormen","year":"2009"},{"key":"ref15","article-title":"Crypto: Free C class library of cryptographic schemes","author":"Dai","year":"2022"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23318-5_12"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2015.23113"},{"key":"ref18","article-title":"Optimal differential privacy composition for exponential mechanisms and the cost of adaptivity","author":"Dong","year":"2019"},{"key":"ref19","first-page":"3527","article-title":"Practical differentially private top-k selection with pay-what-you-get composition","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Durfee"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_29"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536466"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1561\/9781601988195"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660348"},{"key":"ref25","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"The Foundations of Cryptography - Volume 2: Basic Applications","author":"Goldreich","year":"2004"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802212"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488650"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582418"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP48549.2020.00032"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.45"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623723"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2016.2561241"},{"issue":"11","key":"ref35","doi-asserted-by":"crossref","first-page":"1340","DOI":"10.14778\/2350229.2350251","article-title":"PrivBasis: Frequent itemset mining with differential privacy","volume":"5","author":"Li","year":"2012","journal-title":"Proc. VLDB Endowment"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91458-9_6"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.14778\/3055330.3055331"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/tdsc.2018.2868190"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.66"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3363204"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/2818000.2818027"},{"key":"ref42","first-page":"8672","article-title":"Oneshot differentially private top-k selection","volume-title":"Proc. 38th Int. Conf. Mach. Learn.","author":"Qiao"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978409"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref45","article-title":"Differentially private top-k selection via canonical lipschitz mechanism","author":"Shekelyan","year":"2022"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2015.2399310"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/icde.2016.7498427"},{"key":"ref48","first-page":"819","article-title":"Differentially private feature selection via stability arguments, and the robustness of the lasso","volume-title":"Proc. 26th Annu. Conf. Learn. Theory","author":"Thakurta"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/icdcs57875.2023.00045"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/icde.2017.131"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00035"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/infocom48880.2022.9796719"},{"key":"ref53","article-title":"Jaccard index \u2013 Wikipedia, the free encyclopedia","year":"2020"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/3532090"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2014.2327053"},{"key":"ref56","first-page":"162","article-title":"How to generate and exchange secrets (extended abstract)","volume-title":"Proc. 27th Annu. Symp. Found. Comput. Sci.","author":"Yao"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.14778\/2428536.2428539"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2006.08.010"},{"key":"ref59","first-page":"3837","article-title":"Federated heavy hitters discovery with differential privacy","volume-title":"Proc. 23rd Int. Conf. Artif. Intell. Statist.","author":"Zhu"},{"key":"ref60","article-title":"Adaptive private-k-selection with adaptive K and application to multi-label PATE","author":"Zhu","year":"2022"}],"container-title":["IEEE Transactions on Mobile Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/7755\/10777875\/10684534.pdf?arnumber=10684534","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T06:00:28Z","timestamp":1733378428000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10684534\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":60,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tmc.2024.3464744","relation":{},"ISSN":["1536-1233","1558-0660","2161-9875"],"issn-type":[{"value":"1536-1233","type":"print"},{"value":"1558-0660","type":"electronic"},{"value":"2161-9875","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1]]}}}