{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:22:27Z","timestamp":1753885347981,"version":"3.41.2"},"reference-count":41,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,3,17]],"date-time":"2021-03-17T00:00:00Z","timestamp":1615939200000},"content-version":"vor","delay-in-days":75,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61741111","61662039","61962029","61762055"],"award-info":[{"award-number":["61741111","61662039","61962029","61762055"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Wireless Communications and Mobile Computing"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>The arrival of cloud computing age makes data outsourcing an important and convenient application. More and more individuals and organizations outsource large amounts of graph data to the cloud computing platform (CCP) for the sake of saving cost. As the server on CCP is not completely honest and trustworthy, the outsourcing graph data are usually encrypted before they are sent to CCP. The optimal route finding on graph data is a popular operation which is frequently used in many fields. The optimal route finding with support for semantic search has stronger query capabilities, and a consumer can use similar words of graph vertices as query terms to implement optimal route finding. Due to encrypting the outsourcing graph data before they are sent to CCP, it is not easy for data customers to manipulate and further use the encrypted graph data. In this paper, we present a solution to execute privacy\u2010guarding optimal route finding with support for semantic search on the encrypted graph in the cloud computing scenario (PORF). We designed a scheme by building secure query index to implement optimal route finding with support for semantic search based on searchable encryption idea and stemmer mechanism. We give formal security analysis for our scheme. We also analyze the efficiency of our scheme through the experimental evaluation.<\/jats:p>","DOI":"10.1155\/2021\/6617959","type":"journal-article","created":{"date-parts":[[2021,3,17]],"date-time":"2021-03-17T19:35:05Z","timestamp":1616009705000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Privacy\u2010Guarding Optimal Route Finding with Support for Semantic Search on Encrypted Graph in Cloud Computing Scenario"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4848-7316","authenticated-orcid":false,"given":"Bin","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianyi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zongda","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiqiang","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhuolin","family":"Mei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Caicai","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2021,3,17]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"BaekJ. Safavi-NainiR. andSusiloW. Public key encryption with keyword search revisited Computational Science and Its Applications - ICCSA 2008 International Conference 2008 Perugia Italy 1249\u20131259.","key":"e_1_2_10_1_2","DOI":"10.1007\/978-3-540-69839-5_96"},{"doi-asserted-by":"publisher","key":"e_1_2_10_2_2","DOI":"10.1002\/net.21757"},{"doi-asserted-by":"publisher","key":"e_1_2_10_3_2","DOI":"10.1109\/TPDS.2013.45"},{"doi-asserted-by":"crossref","unstructured":"CaoN. YangZ. WangC. RenK. andLouW. Privacy-preserving query over encrypted graph-structured data in cloud computing 2011 International Conference on Distributed Computing Systems (ICDCS) 2011 Minneapolis MN USA 393\u2013402.","key":"e_1_2_10_4_2","DOI":"10.1109\/ICDCS.2011.84"},{"doi-asserted-by":"crossref","unstructured":"ChangY.-C.andMitzenmacherM. Privacy preserving keyword searches on remote encrypted data Third International Conference on Applied Cryptography and Network Security (ACNS 2015) 2005 Berlin Heidelberg 442\u2013455.","key":"e_1_2_10_5_2","DOI":"10.1007\/11496137_30"},{"doi-asserted-by":"crossref","unstructured":"ChaseM.andKamaraS. Structured encryption and controlled disclosure Advances in Cryptology - ASIACRYPT 2010 - 16th International Conference on the Theory and Application of Cryptology and Information Security 2010 Singapore 577\u2013594.","key":"e_1_2_10_6_2","DOI":"10.1007\/978-3-642-17373-8_33"},{"doi-asserted-by":"crossref","unstructured":"CiucanuR.andLafourcadeP. GOOSE: a secure framework for graph outsourcing and SPARQL evaluation Data and Applications Security and Privacy -34th Annual IFIP WG 11.3 Conference DBSec 2020 2020 Regensburg Germany 347\u2013366.","key":"e_1_2_10_7_2","DOI":"10.1007\/978-3-030-49669-2_20"},{"doi-asserted-by":"publisher","key":"e_1_2_10_8_2","DOI":"10.1109\/ACCESS.2020.2991068"},{"doi-asserted-by":"publisher","key":"e_1_2_10_9_2","DOI":"10.1016\/j.knosys.2016.07.017"},{"doi-asserted-by":"crossref","unstructured":"CurtmolaR. GarayJ. A. KamaraS. andOstrovskyR. Searchable symmetric encryption: improved definitions and efficient constructions Proceedings of the 13th ACM Conference on Computer and Communications Security (CCS 2006) 2006 Alexandria VA USA 79\u201388.","key":"e_1_2_10_10_2","DOI":"10.1145\/1180405.1180417"},{"doi-asserted-by":"publisher","key":"e_1_2_10_11_2","DOI":"10.1016\/j.future.2020.02.036"},{"doi-asserted-by":"publisher","key":"e_1_2_10_12_2","DOI":"10.1016\/j.ins.2019.08.014"},{"doi-asserted-by":"crossref","unstructured":"FanZ. ChoiB. XuJ. andBhowmickS. S. Asymmetric structure-preserving subgraph queries for large graphs 31st IEEE International Conference on Data Engineering ICDE 2015 2015 Seoul South Korea 339\u2013350.","key":"e_1_2_10_13_2","DOI":"10.1109\/ICDE.2015.7113296"},{"doi-asserted-by":"publisher","key":"e_1_2_10_14_2","DOI":"10.1109\/LSP.2018.2844562"},{"doi-asserted-by":"publisher","key":"e_1_2_10_15_2","DOI":"10.1007\/s11042-013-1701-8"},{"doi-asserted-by":"publisher","key":"e_1_2_10_16_2","DOI":"10.1109\/LSP.2015.2459055"},{"unstructured":"GohE.-J. Secure indexes IACR Cryptology ePrint Archive 2003 2003.","key":"e_1_2_10_17_2"},{"volume-title":"The Foundations of Cryptography - Volume 2: Basic Applications","year":"2010","author":"Goldreich O.","key":"e_1_2_10_18_2"},{"doi-asserted-by":"publisher","key":"e_1_2_10_19_2","DOI":"10.1016\/0022-0000(84)90070-9"},{"doi-asserted-by":"publisher","key":"e_1_2_10_20_2","DOI":"10.1002\/cpe.5201"},{"doi-asserted-by":"publisher","key":"e_1_2_10_21_2","DOI":"10.1109\/TDSC.2017.2751476"},{"doi-asserted-by":"publisher","key":"e_1_2_10_22_2","DOI":"10.1109\/TCC.2015.2469649"},{"doi-asserted-by":"crossref","unstructured":"KayB. DateP. andSchumanC. D. Neuromorphic graph algorithms: extracting longest shortest paths and minimum spanning trees NICE \u203220: Neuro-inspired Computational Elements Workshop 2020 Heidelberg Germany 1\u20136.","key":"e_1_2_10_23_2","DOI":"10.1145\/3381755.3381762"},{"unstructured":"KlimtB.andYangY. Introducing the enron corpus CEAS 2004 - First Conference on Email and Anti-Spam 2004 Mountain View California USA.","key":"e_1_2_10_24_2"},{"doi-asserted-by":"publisher","key":"e_1_2_10_25_2","DOI":"10.1080\/15427951.2009.10129177"},{"doi-asserted-by":"publisher","key":"e_1_2_10_26_2","DOI":"10.1109\/TBDATA.2017.2787198"},{"doi-asserted-by":"publisher","key":"e_1_2_10_27_2","DOI":"10.1109\/TMC.2018.2873642"},{"doi-asserted-by":"publisher","key":"e_1_2_10_28_2","DOI":"10.1109\/TCC.2017.2769645"},{"doi-asserted-by":"crossref","unstructured":"LiL. ZhangM. HuaW. andZhouX. Fast query decomposition for batch shortest path processing in road networks 36th IEEE International Conference on Data Engineering ICDE 2020 2020 Dallas TX USA 1189\u20131200.","key":"e_1_2_10_29_2","DOI":"10.1109\/ICDE48307.2020.00107"},{"key":"e_1_2_10_30_2","article-title":"A survey of stemming algorithms in information retrieval","volume":"19","author":"Moral C.","year":"2014","journal-title":"Information Research"},{"doi-asserted-by":"publisher","key":"e_1_2_10_31_2","DOI":"10.1134\/S0005117920030108"},{"doi-asserted-by":"publisher","key":"e_1_2_10_32_2","DOI":"10.1109\/TIFS.2017.2774451"},{"unstructured":"SongD. X. WagnerD. andPerrigA. Practical techniques for searches on encrypted data 2000 IEEE Symposium on Security and Privacy 2000 Berkeley CA USA 44\u201355.","key":"e_1_2_10_33_2"},{"doi-asserted-by":"publisher","key":"e_1_2_10_34_2","DOI":"10.1016\/j.future.2018.05.048"},{"doi-asserted-by":"publisher","key":"e_1_2_10_35_2","DOI":"10.1109\/TPDS.2011.282"},{"doi-asserted-by":"crossref","unstructured":"WangC. RenK. YuS. andUrsK. M. R. Achieving usable and privacy-assured similarity search over outsourced cloud data Proceedings of the IEEE INFOCOM 2012 Orlando FL USA 451\u2013459.","key":"e_1_2_10_36_2","DOI":"10.1109\/INFCOM.2012.6195784"},{"doi-asserted-by":"publisher","key":"e_1_2_10_37_2","DOI":"10.1109\/TDSC.2016.2593444"},{"doi-asserted-by":"publisher","key":"e_1_2_10_38_2","DOI":"10.1109\/ACCESS.2019.2945177"},{"doi-asserted-by":"publisher","key":"e_1_2_10_39_2","DOI":"10.1007\/s00500-018-3151-8"},{"doi-asserted-by":"publisher","key":"e_1_2_10_40_2","DOI":"10.1145\/3383582"},{"doi-asserted-by":"publisher","key":"e_1_2_10_41_2","DOI":"10.1016\/j.adhoc.2019.101990"}],"container-title":["Wireless Communications and Mobile Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2021\/6617959.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2021\/6617959.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/6617959","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T11:07:52Z","timestamp":1723028872000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/6617959"}},"subtitle":[],"editor":[{"given":"Jun","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/6617959"],"URL":"https:\/\/doi.org\/10.1155\/2021\/6617959","archive":["Portico"],"relation":{},"ISSN":["1530-8669","1530-8677"],"issn-type":[{"type":"print","value":"1530-8669"},{"type":"electronic","value":"1530-8677"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2020-11-26","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-03-04","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-03-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"6617959"}}