{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T11:46:32Z","timestamp":1762429592736},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T00:00:00Z","timestamp":1709164800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T00:00:00Z","timestamp":1709164800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Netw"],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1007\/s11276-024-03692-7","type":"journal-article","created":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T04:34:01Z","timestamp":1709181241000},"page":"2633-2646","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Secure shortest distance queries over encrypted graph in cloud computing"],"prefix":"10.1007","volume":"30","author":[{"given":"Jingjing","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiacong","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,29]]},"reference":[{"key":"3692_CR1","doi-asserted-by":"crossref","unstructured":"Sarwat, M., Elnikety, S., He, Y., & Kliot, G. (2012). Horton: Online query execution engine for large distributed graphs. In: Proceedings of IEEE 28th International Conference on Data Engineering (ICDE), Washington, DC, USA, 1-5 April, 2012, pp. 1289\u20131292","DOI":"10.1109\/ICDE.2012.129"},{"key":"3692_CR2","unstructured":"Low, Y., Gonzalez, J., Kyrola, A., Bickson, D., Guestrin, C., & Hellerstein, J.M. (2010). Graphlab: A new framework for parallel machine learning. In: Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI), Catalina Island, CA, USA, July 8\u201311, 2010, pp. 340\u2013349"},{"key":"3692_CR3","doi-asserted-by":"crossref","unstructured":"Han, W., Lee, S., Park, K., Lee, J., Kim, M., Kim, J., & Yu, H. (2013). Turbograph: a fast parallel graph engine handling billion-scale graphs in a single PC. In: Proceedings of 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) 2013, Chicago, IL, USA, August 11\u201314, 2013, pp. 77\u201385","DOI":"10.1145\/2487575.2487581"},{"key":"3692_CR4","unstructured":"Kyrola, A., & Guestrin, C. (2014). Graphchi-db: Simple design for a scalable graph database system - on just a PC. CoRR abs\/1403.0701"},{"key":"3692_CR5","doi-asserted-by":"crossref","unstructured":"Chase, M., & Kamara, S. (2010). Structured encryption and controlled disclosure. In: Proceedings of 16th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT), Singapore, December 5\u20139, 2010, vol. 6477, pp. 577\u2013594","DOI":"10.1007\/978-3-642-17373-8_33"},{"key":"3692_CR6","doi-asserted-by":"crossref","unstructured":"Meng, X., Kamara, S., Nissim, K., & Kollios, G. (2015). GRECS: graph encryption for approximate shortest distance queries. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security (CCS), Denver, CO, USA, October 12\u201316, 2015, pp. 504\u2013517","DOI":"10.1145\/2810103.2813672"},{"key":"3692_CR7","doi-asserted-by":"crossref","unstructured":"Wang, Q., Ren, K., Du, M., Li, Q., & Mohaisen, A. (2017). Secgdb: Graph encryption for exact shortest distance queries with efficient updates. In: Proceedings of 21st International Conference on Financial Cryptography and Data Security (FC), Sliema, Malta, April 3\u20137, 2017, vol. 10322, pp. 79\u201397","DOI":"10.1007\/978-3-319-70972-7_5"},{"issue":"11","key":"3692_CR8","doi-asserted-by":"publisher","first-page":"2401","DOI":"10.1109\/TIFS.2016.2573770","volume":"11","author":"X Liu","year":"2016","unstructured":"Liu, X., Deng, R. H., Choo, K. R., & Weng, J. (2016). An efficient privacy-preserving outsourced calculation toolkit with multiple keys. IEEE Transactions on Information Forensics and Security, 11(11), 2401\u20132414.","journal-title":"IEEE Transactions on Information Forensics and Security"},{"key":"3692_CR9","doi-asserted-by":"publisher","DOI":"10.1201\/b17668","volume-title":"Introduction to modern cryptography","author":"J Katz","year":"2014","unstructured":"Katz, J., & Lindell, Y. (2014). Introduction to modern cryptography (2nd ed.). Boca Raton: CRC Press.","edition":"2"},{"key":"3692_CR10","doi-asserted-by":"crossref","unstructured":"Bresson, E., Catalano, D., & Pointcheval, D. (2003). A simple public-key cryptosystem with a double trapdoor decryption mechanism and its applications. In: Proceedings of 9th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT), Taipei, Taiwan, November 30\u2013December 4, 2003, vol. 2894, pp. 37\u201354","DOI":"10.1007\/978-3-540-40061-5_3"},{"key":"3692_CR11","doi-asserted-by":"crossref","unstructured":"Katz, J., Ostrovsky, R., & Yung, M. (2001). Efficient password authenticated key exchange using human-memorable passwords. In: Proceedings of International Conference on Theory and Application of Cryptographic Techniques, Innsbruck, Austria, May 6\u201310, 2001, pp. 457\u2013494","DOI":"10.1007\/3-540-44987-6_29"},{"key":"3692_CR12","doi-asserted-by":"crossref","unstructured":"Katz, J., MacKenzie, P., Taban, G., & Gligor, V. (2005). Efficient password authenticated key exchange using human-memorable passwords. In: Proceedings of International Conference on Applied Cryptography and Network, New York, USA, June 7\u201310, 2005, pp. 1\u201316","DOI":"10.1007\/11496137_1"},{"issue":"9","key":"3692_CR13","doi-asserted-by":"publisher","first-page":"1773","DOI":"10.1109\/TPDS.2012.282","volume":"24","author":"X Yi","year":"2013","unstructured":"Yi, X., Ling, S., & Wang, H. (2013). Efficient two-server password-only authenticated key exchange. IEEE Transactions on Parallel Distributed System, 24(9), 1773\u20131782.","journal-title":"IEEE Transactions on Parallel Distributed System"},{"key":"3692_CR14","doi-asserted-by":"crossref","unstructured":"Curtmola, R., Garay, J.A., Kamara, S., & Ostrovsky, R. (2006). Searchable symmetric encryption: improved definitions and efficient constructions. In: Proceedings of the 13th ACM Conference on Computer and Communications Security (CCS), Alexandria, VA, USA, October 30\u2013November 3, 2006, pp. 79\u201388","DOI":"10.1145\/1180405.1180417"},{"key":"3692_CR15","doi-asserted-by":"crossref","unstructured":"Cash, D., Jarecki, S., Jutla, C.S., Krawczyk, H., Rosu, M., & Steiner, M. (2013). Highly-scalable searchable symmetric encryption with support for boolean queries. In: Proceedings of 33rd Annual Cryptology Conference (CRYPTO), Santa Barbara, CA, USA, August 18\u201322, 2013, vol. 8042, pp. 353\u2013373","DOI":"10.1007\/978-3-642-40041-4_20"},{"key":"3692_CR16","doi-asserted-by":"crossref","unstructured":"Hamlin, A., Shelat, A., Weiss, M., & Wichs, D. (2018). Multi-key searchable encryption, revisited. In: Proceedings of 21st IACR International Conference on Practice and Theory of Public-Key Cryptography (PKC), Rio de Janeiro, Brazil, March 25\u201329, 2018, vol. 10769, pp. 95\u2013124","DOI":"10.1007\/978-3-319-76578-5_4"},{"issue":"2","key":"3692_CR17","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1109\/TCC.2018.2799219","volume":"8","author":"X Liu","year":"2020","unstructured":"Liu, X., Deng, R. H., Choo, K. R., & Yang, Y. (2020). Privacy-preserving outsourced support vector machine design for secure drug discovery. IEEE Transactions on Cloud Computing, 8(2), 610\u2013622.","journal-title":"IEEE Transactions on Cloud Computing"},{"key":"3692_CR18","doi-asserted-by":"publisher","DOI":"10.6028\/NIST.SP.800-57p1r2006","volume-title":"Recommendation for key management: Part 1: General","author":"E Barker","year":"2006","unstructured":"Barker, E., Barker, E., Burr, W., Polk, W., Smid, M., et al. (2006). Recommendation for key management: Part 1: General. Technology Administration, New York: National Institute of Standards and Technology."},{"key":"3692_CR19","doi-asserted-by":"crossref","unstructured":"Liu, K., & Terzi, E. (2008). Towards identity anonymization on graphs. In: Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD), Vancouver, BC, Canada, June 10\u201312, 2008, pp. 93\u2013106","DOI":"10.1145\/1376616.1376629"},{"key":"3692_CR20","doi-asserted-by":"crossref","unstructured":"Cheng, J., Fu, A.W., & Liu, J. (2010). K-isomorphism: privacy preserving network publication against structural attacks. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD), Indianapolis, Indiana, USA, June 6\u201310, 2010, pp. 459\u2013470","DOI":"10.1145\/1807167.1807218"},{"key":"3692_CR21","doi-asserted-by":"crossref","unstructured":"Gao, J., Yu, J.X., Jin, R., Zhou, J., Wang, T., & Yang, D. (2011). Neighborhood-privacy protected shortest distance computing in cloud. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD), Athens, Greece, June 12\u201316, 2011, pp. 409\u2013420","DOI":"10.1145\/1989323.1989367"},{"key":"3692_CR22","doi-asserted-by":"crossref","unstructured":"Dwork, C., McSherry, F., Nissim, K., & Smith, A.D. (2006). Calibrating noise to sensitivity in private data analysis. In: Proceedings of 3rd International Conference on Theory of Cryptography (TCC), New York, NY, USA, March 4\u20137, 2006, vol. 3876, pp. 265\u2013284","DOI":"10.1007\/11681878_14"},{"key":"3692_CR23","doi-asserted-by":"crossref","unstructured":"Shen, E., & Yu, T. (2013). Mining frequent graph patterns with differential privacy. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) 2013, Chicago, IL, USA, August 11\u201314, 2013, pp. 545\u2013553","DOI":"10.1145\/2487575.2487601"},{"key":"3692_CR24","doi-asserted-by":"crossref","unstructured":"Kasiviswanathan, S.P., Nissim, K., Raskhodnikova, S., & Smith, A.D. (2013). Analyzing graphs with node differential privacy. In: Proceedings of the 10th International Conference on Theory of Cryptography (TCC), Tokyo, Japan, March 3\u20136, 2013, vol. 7785, pp. 457\u2013476","DOI":"10.1007\/978-3-642-36594-2_26"},{"issue":"8","key":"3692_CR25","doi-asserted-by":"publisher","first-page":"692","DOI":"10.14778\/2212351.2212352","volume":"5","author":"K Mouratidis","year":"2012","unstructured":"Mouratidis, K., & Yiu, M. L. (2012). Shortest path computation with no information leakage. Proceedings of the VLDB Endowment, 5(8), 692\u2013703.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"3692_CR26","doi-asserted-by":"crossref","unstructured":"Gentry, C. (2009). Fully homomorphic encryption using ideal lattices. In: Proceedings of 41st Annual ACM Symposium on Theory of Computing (STOC), Bethesda, MD, USA, May 31\u2013June 2, 2009, pp. 169\u2013178","DOI":"10.1145\/1536414.1536440"},{"key":"3692_CR27","doi-asserted-by":"crossref","unstructured":"Aly, A., Cuvelier, E., Mawet, S., Pereira, O., & Vyve, M.V. (2013). Securely solving simple combinatorial graph problems. In: Proceedings of 17th International Conference on Financial Cryptography and Data Security (FC), Okinawa, Japan, April 1\u20135, 2013, vol. 7859, pp. 239\u2013257","DOI":"10.1007\/978-3-642-39884-1_21"},{"key":"3692_CR28","doi-asserted-by":"crossref","unstructured":"Blanton, M., Steele, A., & Aliasgari, M. (2013). Data-oblivious graph algorithms for secure computation and outsourcing. In: Proceedings of 8th ACM Symposium on Information, Computer and Communications Security, (ASIACCS), Hangzhou, China\u2014May 08\u201310, 2013, pp. 207\u2013218","DOI":"10.1145\/2484313.2484341"},{"key":"3692_CR29","doi-asserted-by":"crossref","unstructured":"Keller, M., & Scholl, P. (2014). Efficient, oblivious data structures for MPC. In: Proceedings of 20th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT) 2014, Kaoshiung, Taiwan, R.O.C., December 7\u201311, 2014, vol. 8874, pp. 506\u2013525","DOI":"10.1007\/978-3-662-45608-8_27"},{"key":"3692_CR30","doi-asserted-by":"crossref","unstructured":"Gupta, D., Segal, A., Panda, A., Segev, G., Schapira, M., Feigenbaum, J., Rexford, J., & Shenker, S. (2012). A new approach to interdomain routing based on secure multi-party computation. In: Proceedings of 11th ACM Workshop on Hot Topics in Networks, Redmond, WA, USA\u2014October 29\u201330, 2012, pp. 37\u201342","DOI":"10.1145\/2390231.2390238"},{"key":"3692_CR31","unstructured":"Bayatbabolghani, F., Blanton, M., Aliasgari, M., & Goodrich, M.T. (2017). Secure fingerprint alignment and matching protocols. CoRR abs\/1702.03379"},{"issue":"4","key":"3692_CR32","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1109\/TIFS.2017.2774451","volume":"13","author":"M Shen","year":"2018","unstructured":"Shen, M., Ma, B., Zhu, L., Mijumbi, R., Du, X., & Hu, J. (2018). Cloud-based approximate constrained shortest distance queries over encrypted graphs with privacy protection. IEEE Transactions on Information Forensics and Security, 13(4), 940\u2013953.","journal-title":"IEEE Transactions on Information Forensics and Security"},{"key":"3692_CR33","doi-asserted-by":"crossref","unstructured":"Wu, D.J., Zimmerman, J., Planul, J., & Mitchell, J.C. (2016). Privacy-preserving shortest path computation. In: Proceedings of 23rd Annual Network and Distributed System Security Symposium (NDSS), San Diego, California, USA, February 21\u201324, 2016","DOI":"10.14722\/ndss.2016.23052"},{"key":"3692_CR34","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.ins.2019.07.082","volume":"506","author":"C Zhang","year":"2020","unstructured":"Zhang, C., Zhu, L., Xu, C., Sharif, K., Zhang, C., & Liu, X. (2020). PGAS: privacy-preserving graph encryption for accurate constrained shortest distance queries. Information Sciences, 506, 325\u2013345.","journal-title":"Information Sciences"},{"key":"3692_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.csi.2020.103484","volume":"74","author":"Y Chen","year":"2021","unstructured":"Chen, Y., Ku, H., & Zhang, M. (2021). PP-OCQ: A distributed privacy-preserving optimal closeness query scheme for social networks. Computer Standards and Interfaces, 74, 103484.","journal-title":"Computer Standards and Interfaces"},{"issue":"1","key":"3692_CR36","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1109\/TDSC.2018.2880981","volume":"18","author":"C Liu","year":"2021","unstructured":"Liu, C., Zhu, L., He, X., & Chen, J. (2021). Enabling privacy-preserving shortest distance queries on encrypted graph data. IEEE Transactions on Dependable and Secure Computing, 18(1), 192\u2013204.","journal-title":"IEEE Transactions on Dependable and Secure Computing"}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-024-03692-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11276-024-03692-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-024-03692-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T18:13:49Z","timestamp":1717006429000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11276-024-03692-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,29]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["3692"],"URL":"https:\/\/doi.org\/10.1007\/s11276-024-03692-7","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"value":"1022-0038","type":"print"},{"value":"1572-8196","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,29]]},"assertion":[{"value":"22 December 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 February 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}