{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T15:53:06Z","timestamp":1775145186298,"version":"3.50.1"},"reference-count":16,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1109\/globecom38437.2019.9014247","type":"proceedings-article","created":{"date-parts":[[2020,2,28]],"date-time":"2020-02-28T04:59:24Z","timestamp":1582865964000},"page":"1-6","source":"Crossref","is-referenced-by-count":7,"title":["Privacy-Preserving Graph Encryption for Approximate Constrained Shortest Distance Queries"],"prefix":"10.1109","author":[{"given":"Meng","family":"Shen","sequence":"first","affiliation":[]},{"given":"Siqi","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Liehuang","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Renyi","family":"Xiao","sequence":"additional","affiliation":[]},{"given":"Ke","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Xiaojiang","family":"Du","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813672"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2018.2871607"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2017.2774451"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2019.2901840"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2014.23298"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/11940128_40"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.14778\/3015274.3015277"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516417"},{"key":"ref3","first-page":"577","article-title":"Structured encryption and controlled disclosure","author":"chase","year":"0","journal-title":"ASIACRYPT"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180417"},{"key":"ref5","first-page":"937","article-title":"Reachability and distance queries via 2-hop labels","volume":"32","author":"cohen","year":"2002","journal-title":"SIAM Journal on Computing"},{"key":"ref8","first-page":"457","article-title":"Analyzing graphs with node differential privacy","author":"kasiviswanathan","year":"0","journal-title":"Theory of Cryptography"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/moor.17.1.36"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813700"},{"key":"ref1","first-page":"325","article-title":"Evaluating 2-dnf formulas on ciphertexts","author":"boneh","year":"0","journal-title":"TCC"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.08.084"}],"event":{"name":"GLOBECOM 2019 - 2019 IEEE Global Communications Conference","location":"Waikoloa, HI, USA","start":{"date-parts":[[2019,12,9]]},"end":{"date-parts":[[2019,12,13]]}},"container-title":["2019 IEEE Global Communications Conference (GLOBECOM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8968653\/9013108\/09014247.pdf?arnumber=9014247","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T17:50:31Z","timestamp":1658080231000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9014247\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/globecom38437.2019.9014247","relation":{},"subject":[],"published":{"date-parts":[[2019,12]]}}}