{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T09:18:00Z","timestamp":1766049480285,"version":"3.40.5"},"reference-count":38,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T00:00:00Z","timestamp":1602720000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Security and Communication Networks"],"published-print":{"date-parts":[[2020,10,15]]},"abstract":"<jats:p>Budget factor is an important factor to measure the intensity of differential privacy, and its allocation scheme has a great impact on privacy protection. This paper studies the selection of the parameter <jats:inline-formula>\n                     <a:math xmlns:a=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M2\">\n                        <a:mi>\u03b5<\/a:mi>\n                     <\/a:math>\n                  <\/jats:inline-formula> in several cases of differential privacy. Firstly, this paper proposes a differential privacy protection parameter configuration method based on fault tolerance interval and analyzes the adversary\u02bcs fault tolerance under different noise distribution location parameters and scale parameters. Secondly, this paper proposes an algorithm to optimize the application scenarios of multiquery, studies the location parameters and scale parameters in detail, and proposes a differential privacy mechanism to solve the multiuser query scenarios. Thirdly, this paper proposes the differential privacy parameter selection methods based on the single attack and repeated attacks and calculates the upper bound of the parameter <jats:inline-formula>\n                     <c:math xmlns:c=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M3\">\n                        <c:mi>\u03b5<\/c:mi>\n                     <\/c:math>\n                  <\/jats:inline-formula> based on the sensitivity <jats:inline-formula>\n                     <e:math xmlns:e=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M4\">\n                        <e:mi mathvariant=\"normal\">\u0394<\/e:mi>\n                        <e:mi>q<\/e:mi>\n                     <\/e:math>\n                  <\/jats:inline-formula>, the length of the fault tolerance interval <jats:inline-formula>\n                     <h:math xmlns:h=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M5\">\n                        <h:mi>L<\/h:mi>\n                     <\/h:math>\n                  <\/jats:inline-formula>, and the success probability<jats:inline-formula>\n                     <j:math xmlns:j=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M6\">\n                        <j:mi>p<\/j:mi>\n                     <\/j:math>\n                  <\/jats:inline-formula> as long as the fault tolerance interval. Finally, we have carried out a variety of simulation experiments to verify our research scheme and give the corresponding analysis results.<\/jats:p>","DOI":"10.1155\/2020\/8845038","type":"journal-article","created":{"date-parts":[[2020,10,24]],"date-time":"2020-10-24T07:58:49Z","timestamp":1603526329000},"page":"1-12","source":"Crossref","is-referenced-by-count":2,"title":["Research on Selection Method of Privacy Parameter <a:math xmlns:a=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M1\">\n                     <a:mi>\u03b5<\/a:mi>\n                  <\/a:math>"],"prefix":"10.1155","volume":"2020","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4634-5886","authenticated-orcid":true,"given":"Pan Jun","family":"Sun","sequence":"first","affiliation":[{"name":"School of Electronic Information and Electrical Engineering, Shanghai Jiao Tong University, 800 Dongchuan RD, Minhang, Shanghai, China"}]}],"member":"311","reference":[{"article-title":"Mechanism design via differential privacy","author":"F. McSherry","key":"1","doi-asserted-by":"crossref","DOI":"10.1109\/FOCS.2007.66"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1080\/1206212x.2017.1309222"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/cc.2017.7927579"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-016-3900-x"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1002\/dac.3795"},{"issue":"1","key":"6","doi-asserted-by":"crossref","DOI":"10.1002\/dac.3437","article-title":"Pseudonym changing strategy with multiple mix zones for trajectory privacy protection in road networks","volume":"31","author":"I. Memon","year":"2017","journal-title":"International Journal of Communication Systems"},{"issue":"4","key":"7","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1007\/s11280-016-0403-3","article-title":"Dynamic path privacy protection framework for continuous query service over road networks","volume":"20","author":"I. Memon","year":"2017","journal-title":"World Wide Web"},{"key":"8","article-title":"Security and privacy protection in cloud computing: discussions and challenges","volume":"160","author":"P. J. Sun","year":"2020","journal-title":"Journal of Network and Computer Applications"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2017.2715334"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2938759"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2906610"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2905278"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/tsusc.2017.2715038"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2019.2955503"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2018.2809790"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2939015"},{"key":"17","article-title":"RoD: Evaluating the risk of data disclosure using noise estimation for differential privacy","author":"Y.-T. Tsou","year":"2018","journal-title":"IEEE Transactions on Big Data"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.21629\/jsee.2017.01.19"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2020.2972001"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/tdsc.2015.2484326"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2988575"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.07.001"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2960283"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2018.2794384"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1109\/tcc.2015.2430316"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2015.2504967"},{"issue":"2","key":"27","doi-asserted-by":"crossref","DOI":"10.1109\/TCC.2015.2430316","article-title":"Towards privacy-preserving publishing of set-valued data on hybrid cloud","volume":"6","author":"H. Zhang","year":"2018","journal-title":"IEEE Transactions on Cloud Computing"},{"article-title":"Epsilon voting: mechanism design for parameter selection in differential privacy","author":"N. Kohli","key":"28","doi-asserted-by":"crossref","DOI":"10.1109\/PAC.2018.00009"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1109\/tifs.2019.2929446"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2019.2937245"},{"issue":"2","key":"31","doi-asserted-by":"crossref","DOI":"10.1109\/TNSM.2020.2982555","article-title":"Privacy-preserving approach PBCN in social network with differential privacy","volume":"17","author":"H. Huang","year":"2020","journal-title":"IEEE Transactions on Network and Service Management"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1109\/tpds.2013.132"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2947295"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2020.101951"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2951364"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2017.2777968"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1109\/tii.2017.2773646"},{"article-title":"Towards an axiomatization of statistical privacy and utility","author":"D. Kifer","key":"38","doi-asserted-by":"crossref","DOI":"10.1145\/1807085.1807106"}],"container-title":["Security and Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2020\/8845038.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2020\/8845038.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2020\/8845038.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,24]],"date-time":"2020-10-24T07:58:53Z","timestamp":1603526333000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/scn\/2020\/8845038\/"}},"subtitle":[],"editor":[{"given":"Vincenzo","family":"Conti","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2020,10,15]]},"references-count":38,"alternative-id":["8845038","8845038"],"URL":"https:\/\/doi.org\/10.1155\/2020\/8845038","relation":{},"ISSN":["1939-0122","1939-0114"],"issn-type":[{"type":"electronic","value":"1939-0122"},{"type":"print","value":"1939-0114"}],"subject":[],"published":{"date-parts":[[2020,10,15]]}}}