{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:33:09Z","timestamp":1762522389042,"version":"3.37.3"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","award":["201706690030"],"award-info":[{"award-number":["201706690030"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2974909","type":"journal-article","created":{"date-parts":[[2020,2,18]],"date-time":"2020-02-18T21:33:43Z","timestamp":1582061623000},"page":"49775-49784","source":"Crossref","is-referenced-by-count":5,"title":["Privacy-Aware Sensing-Quality-Based Budget Feasible Incentive Mechanism for Crowdsourcing Fingerprint Collection"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1637-1386","authenticated-orcid":false,"given":"Wei","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2135-7546","authenticated-orcid":false,"given":"Cheng","family":"Zhang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3344-222X","authenticated-orcid":false,"given":"Yoshiaki","family":"Tanaka","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2015.10.020"},{"key":"ref38","first-page":"429","article-title":"Local privacy and statistical minimax rates","author":"duchi","year":"2013","journal-title":"Proc Annu IEEE Symp Foundations Comput Sci"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1287\/moor.6.1.58"},{"article-title":"A note on the budgeted maximization of submodular functions","year":"2005","author":"krause","key":"ref32"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00031-9"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2015.2490679"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832252"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/IPIN.2014.7275492"},{"key":"ref35","first-page":"685","article-title":"On the approximability of budget feasible mechanisms","author":"chen","year":"2013","journal-title":"Proc Annu ACM-SIAM Symp Discrete Algorithm"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.78"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3168389"},{"key":"ref11","first-page":"1","article-title":"Secure limitation analysis of public-key cryptography for smart card settings","volume":"23","author":"tian","year":"2019","journal-title":"World Wide Web"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2947233"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1561\/0400000042"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2019.2948068"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3197390"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2017.1600737"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2421897"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2894578"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2019.1800580"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2016.7842170"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2018.2874251"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.pmcj.2017.06.010"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2014.2320254"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2014.2363842"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-017-6520-z"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MPRV.2018.03367734"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2018.2805383"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2015.2415528"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2015.7180511"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.3789"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848053"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2902882"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ITNEC.2017.8284887"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2019.2907059"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2019.2900363"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2017.2654355"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2840098"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09001141.pdf?arnumber=9001141","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:51:44Z","timestamp":1639770704000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9001141\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2974909","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}