{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T15:53:07Z","timestamp":1775145187786,"version":"3.50.1"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2018,4,1]],"date-time":"2018-04-01T00:00:00Z","timestamp":1522540800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"publisher","award":["61602039"],"award-info":[{"award-number":["61602039"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004826","name":"Beijing Natural Science Foundation","doi-asserted-by":"publisher","award":["4164098"],"award-info":[{"award-number":["4164098"]}],"id":[{"id":"10.13039\/501100004826","id-type":"DOI","asserted-by":"publisher"}]},{"name":"China National Key Research and Development Program","award":["2016YFB0800301"],"award-info":[{"award-number":["2016YFB0800301"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1109\/tifs.2017.2774451","type":"journal-article","created":{"date-parts":[[2017,11,16]],"date-time":"2017-11-16T19:09:21Z","timestamp":1510859361000},"page":"940-953","source":"Crossref","is-referenced-by-count":174,"title":["Cloud-Based Approximate Constrained Shortest Distance Queries Over Encrypted Graphs With Privacy Protection"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1867-0972","authenticated-orcid":false,"given":"Meng","family":"Shen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6878-2860","authenticated-orcid":false,"given":"Baoli","family":"Ma","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3277-3887","authenticated-orcid":false,"given":"Liehuang","family":"Zhu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0797-9034","authenticated-orcid":false,"given":"Rashid","family":"Mijumbi","sequence":"additional","affiliation":[]},{"given":"Xiaojiang","family":"Du","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0230-1432","authenticated-orcid":false,"given":"Jiankun","family":"Hu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-2011-0426"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2014.23298"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"ref32","first-page":"937","article-title":"Reachability and distance queries via 2-hop labels","volume":"32","author":"cohen","year":"2002","journal-title":"SIAM J Comput"},{"key":"ref31","author":"bayatbabolghani","year":"2017","journal-title":"Secure fingerprint alignment and matching protocols"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2390231.2390238"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2014.23264"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382298"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180417"},{"key":"ref34","first-page":"44","article-title":"Practical techniques for searches on encrypted data","author":"song","year":"2000","journal-title":"Proc IEEE Symp Secur Privacy"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/moor.17.1.36"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813651"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-007-9096-4"},{"key":"ref12","first-page":"46","article-title":"Route planning for bicycles-exact constrained shortest paths made practical via contraction hierarchy","volume":"4","author":"storandt","year":"2012","journal-title":"Proc ICAPS"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902291"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978376"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-52993-5_24"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_33"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2425407"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2014.6849284"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39884-1_21"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/IWQoS.2014.6914301"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2484313.2484341"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2017.2692682"},{"key":"ref6","first-page":"340","article-title":"GraphLab: A new framework for parallel machine learning","author":"low","year":"2010","journal-title":"Proc 26th Conf Uncertainty Artif Intell (UAI)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45608-8_27"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2392760"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487581"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.14778\/3015274.3015277"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-48782-8_9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813672"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.07.019"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2014.6766089"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN.2014.6911743"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455804"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2011.84"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978347"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2006.05.012"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487601"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_26"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206\/8245900\/08113498.pdf?arnumber=8113498","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:23:14Z","timestamp":1642004594000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8113498\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":42,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tifs.2017.2774451","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4]]}}}