{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T22:28:15Z","timestamp":1768775295790,"version":"3.49.0"},"reference-count":31,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972048"],"award-info":[{"award-number":["61972048"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61976024"],"award-info":[{"award-number":["61976024"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62072051"],"award-info":[{"award-number":["62072051"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1016\/j.ins.2023.03.014","type":"journal-article","created":{"date-parts":[[2023,3,8]],"date-time":"2023-03-08T10:59:27Z","timestamp":1678273167000},"page":"343-356","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"special_numbering":"C","title":["Publishing locally private high-dimensional synthetic data efficiently"],"prefix":"10.1016","volume":"633","author":[{"given":"Hua","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Kaixuan","family":"Li","sequence":"additional","affiliation":[]},{"given":"Teng","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Wenmin","family":"Li","sequence":"additional","affiliation":[]},{"given":"Zhengping","family":"Jin","sequence":"additional","affiliation":[]},{"given":"Fei","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Minghui","family":"Gao","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ins.2023.03.014_br0010","series-title":"54th IEEE Annual Symposium on Foundations of Computer Science","first-page":"429","article-title":"Local privacy and statistical minimax rates","author":"Duchi","year":"2013"},{"issue":"4","key":"10.1016\/j.ins.2023.03.014_br0020","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3134428","article-title":"Privbayes: private data release via Bayesian networks","volume":"42","author":"Zhang","year":"2017","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/j.ins.2023.03.014_br0030","series-title":"23rd IEEE International Conference on Data Engineering","first-page":"136","article-title":"On randomization, public information and the curse of dimensionality","author":"Aggarwal","year":"2007"},{"issue":"01","key":"10.1016\/j.ins.2023.03.014_br0040","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/TDSC.2020.3015886","article-title":"Efficient and secure outsourcing of differentially private data publishing with multiple evaluators","volume":"19","author":"Li","year":"2022","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"10.1016\/j.ins.2023.03.014_br0050","series-title":"33rd ACM SIGMOD International Conference on Management of Data","first-page":"1435","article-title":"Priview: practical differentially private release of marginal contingency tables","author":"Qardaji","year":"2014"},{"key":"10.1016\/j.ins.2023.03.014_br0060","series-title":"21st ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"129","article-title":"Differentially private high-dimensional data publication via sampling-based inference","author":"Chen","year":"2015"},{"key":"10.1016\/j.ins.2023.03.014_br0070","doi-asserted-by":"crossref","first-page":"2151","DOI":"10.1109\/TIFS.2018.2812146","article-title":"Lopub: high-dimensional crowdsourced data publication with local differential privacy","author":"Ren","year":"2018","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"10.1016\/j.ins.2023.03.014_br0080","author":"Lyu"},{"key":"10.1016\/j.ins.2023.03.014_br0090","series-title":"Calibrating noise to sensitivity in private data analysis","first-page":"265","author":"Dwork","year":"2006"},{"key":"10.1016\/j.ins.2023.03.014_br0100","series-title":"21st ACM SIGSAC Conference on Computer and Communications Security","first-page":"1054","article-title":"Rappor: randomized aggregatable privacy-preserving ordinal response","author":"Erlingsson","year":"2014"},{"key":"10.1016\/j.ins.2023.03.014_br0110","first-page":"41","article-title":"Building a rappor with the unknown: privacy-preserving learning of associations and data dictionaries","volume":"3","author":"Fanti","year":"2016","journal-title":"Proc. Priv. Enh. Technol."},{"key":"10.1016\/j.ins.2023.03.014_br0120","series-title":"47th Annual ACM Symposium on Theory of Computing","first-page":"127","article-title":"Local, private, efficient protocols for succinct histograms","author":"Bassily","year":"2015"},{"key":"10.1016\/j.ins.2023.03.014_br0130","series-title":"23rd ACM SIGSAC Conference on Computer and Communications Security","first-page":"192","article-title":"Heavy hitter estimation over set-valued data with local differential privacy","author":"Qin","year":"2016"},{"key":"10.1016\/j.ins.2023.03.014_br0140","series-title":"40th IEEE Symposium on Security and Privacy (SP)","first-page":"317","article-title":"Privkv: key-value data collection with local differential privacy","author":"Ye","year":"2019"},{"key":"10.1016\/j.ins.2023.03.014_br0150","first-page":"1430","article-title":"Privacy aware learning","author":"Wainwright","year":"2012","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.ins.2023.03.014_br0160","author":"Nguy\u00ean"},{"key":"10.1016\/j.ins.2023.03.014_br0170","series-title":"24th ACM SIGSAC Conference on Computer and Communications Security","first-page":"425","article-title":"Generating synthetic decentralized social graphs with local differential privacy","author":"Qin","year":"2017"},{"issue":"5","key":"10.1016\/j.ins.2023.03.014_br0180","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1109\/TDSC.2018.2853105","article-title":"Releasing correlated trajectories: towards high utility and optimal differential privacy","volume":"17","author":"Ou","year":"2018","journal-title":"IEEE Trans. Dependable Secure Comput."},{"issue":"06","key":"10.1016\/j.ins.2023.03.014_br0190","doi-asserted-by":"crossref","first-page":"2962","DOI":"10.1109\/TKDE.2020.3015835","article-title":"The dynamic privacy-preserving mechanisms for online dynamic social networks","volume":"34","author":"Zhu","year":"2022","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"11","key":"10.1016\/j.ins.2023.03.014_br0200","doi-asserted-by":"crossref","first-page":"9674","DOI":"10.1002\/int.23001","article-title":"Understanding adaptive gradient clipping in dp-sgd, empirically","volume":"37","author":"Lin","year":"2022","journal-title":"Int. J. Intell. Syst."},{"issue":"188","key":"10.1016\/j.ins.2023.03.014_br0210","first-page":"10","article-title":"Generalizing data to provide anonymity when disclosing information","volume":"98","author":"Samarati","year":"1998","journal-title":"PODS"},{"key":"10.1016\/j.ins.2023.03.014_br0220","series-title":"60th GLOBECOM 2017-2017 IEEE Global Communications Conference","first-page":"1","article-title":"Copula-based multi-dimensional crowdsourced data synthesis and release with local privacy","author":"Yang","year":"2017"},{"key":"10.1016\/j.ins.2023.03.014_br0230","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.ins.2020.09.064","article-title":"Ppcl: privacy-preserving collaborative learning for mitigating indirect information leakage","volume":"548","author":"Yan","year":"2021","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2023.03.014_br0240","series-title":"28th ACM SIGMOD International Conference on Management of Data","first-page":"19","article-title":"Privacy integrated queries: an extensible platform for privacy-preserving data analysis","author":"McSherry","year":"2009"},{"issue":"309","key":"10.1016\/j.ins.2023.03.014_br0250","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1080\/01621459.1965.10480775","article-title":"Randomized response: a survey technique for eliminating evasive answer bias","volume":"60","author":"Warner","year":"1965","journal-title":"J. Am. Stat. Assoc."},{"key":"10.1016\/j.ins.2023.03.014_br0260","author":"Kingma"},{"key":"10.1016\/j.ins.2023.03.014_br0270","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1016\/j.ins.2021.05.073","article-title":"Pnas: a privacy preserving framework for neural architecture search services","volume":"573","author":"Pan","year":"2021","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2023.03.014_br0280","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/j.ins.2020.10.010","article-title":"Privacy-preserving and verifiable online crowdsourcing with worker updates","volume":"548","author":"Zhang","year":"2021","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2023.03.014_br0290","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/j.ins.2017.08.008","article-title":"A hybrid user similarity model for collaborative filtering","volume":"418","author":"Wang","year":"2017","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2023.03.014_br0300","author":"Bache"},{"key":"10.1016\/j.ins.2023.03.014_br0310","author":"Steven"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025523003109?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025523003109?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T06:08:32Z","timestamp":1758089312000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025523003109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7]]},"references-count":31,"alternative-id":["S0020025523003109"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2023.03.014","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2023,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Publishing locally private high-dimensional synthetic data efficiently","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2023.03.014","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}