{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T18:26:03Z","timestamp":1772043963525,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001778","name":"Deakin University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001778","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1145\/3634737.3656293","type":"proceedings-article","created":{"date-parts":[[2024,6,28]],"date-time":"2024-06-28T11:51:38Z","timestamp":1719575498000},"page":"1660-1674","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["CryptGraph: An Efficient Privacy-Enhancing Solution for Accurate Shortest Path Retrieval in Cloud Environments"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8216-3238","authenticated-orcid":false,"given":"Fuyi","family":"Wang","sequence":"first","affiliation":[{"name":"Deakin University, Geelong, --- Select One ---, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-7895-8291","authenticated-orcid":false,"given":"Zekai","family":"Chen","sequence":"additional","affiliation":[{"name":"Fuzhou University, Fuzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4691-8330","authenticated-orcid":false,"given":"Lei","family":"Pan","sequence":"additional","affiliation":[{"name":"Deakin University, Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9330-2662","authenticated-orcid":false,"given":"Leo Yu","family":"Zhang","sequence":"additional","affiliation":[{"name":"Griffith University, Gold Coast, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0594-0432","authenticated-orcid":false,"given":"Jianying","family":"Zhou","sequence":"additional","affiliation":[{"name":"Singapore University of Technology and Design, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,7]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"ICWE 2015, Rotterdam, The Netherlands, June 23-26, 2015, Proceedings 15","author":"Alarcon Rosa","year":"2015","unstructured":"Rosa Alarcon, Rodrigo Saffie, Nikolas Bravo, and Javiera Cabello. 2015. REST web service description for graph-based service discovery. In ICWE 2015, Rotterdam, The Netherlands, June 23-26, 2015, Proceedings 15. Springer, 461--478."},{"key":"e_1_3_2_1_2_1","volume-title":"Practical and Simple Shortest Path Protocol for Multiparty Computation","author":"Aly Abdelrahaman","unstructured":"Abdelrahaman Aly and Sara Cleemput. 2022. A Fast, Practical and Simple Shortest Path Protocol for Multiparty Computation. In ESORICS. Springer, 749--755."},{"key":"e_1_3_2_1_3_1","volume-title":"International Workshop on Data Privacy Management. Springer, 120--135","author":"Anagreh Mohammad","year":"2022","unstructured":"Mohammad Anagreh and Peeter Laud. 2022. A Parallel Privacy-Preserving Shortest Path Protocol from a Path Algebra Problem. In International Workshop on Data Privacy Management. Springer, 120--135."},{"key":"e_1_3_2_1_4_1","volume-title":"Advances in Cryptology","author":"Beaver Donald","unstructured":"Donald Beaver. 1991. Efficient multiparty protocols using circuit randomization. In Advances in Cryptology. Springer, Santa Barbara, United States, 420--432."},{"key":"e_1_3_2_1_5_1","volume-title":"Secure Outsourced Garbled Circuit Evaluation for Mobile Devices. In USENIX Security Symposium. USENIX Association, 289--304","author":"Carter Henry","unstructured":"Henry Carter, Benjamin Mood, Patrick Traynor, and Kevin R. B. Butler. 2013. Secure Outsourced Garbled Circuit Evaluation for Mobile Devices. In USENIX Security Symposium. USENIX Association, 289--304."},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. ACM","author":"Censor-Hillel Keren","year":"2020","unstructured":"Keren Censor-Hillel, Michal Dory, Janne H Korhonen, and Dean Leitersdorf. 2020. Fast approximate shortest paths in the congested clique. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. ACM, Toronto, Canada, 74--83."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_33"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403098"},{"key":"e_1_3_2_1_9_1","first-page":"3295","article-title":"GraphShield: Dynamic large graphs for secure queries with forward privacy","volume":"34","author":"Du Minxin","year":"2020","unstructured":"Minxin Du, Shuangke Wu, Qian Wang, Dian Chen, Peipei Jiang, and Aziz Mohaisen. 2020. GraphShield: Dynamic large graphs for secure queries with forward privacy. IEEE Transactions on Knowledge and Data Engineering 34, 7 (2020), 3295--3308.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_2_1_10_1","first-page":"136","article-title":"SPPS: A search pattern privacy system for approximate shortest distance query of encrypted graphs in IIoT","volume":"52","author":"Ge Xinrui","year":"2021","unstructured":"Xinrui Ge, Jia Yu, Hanlin Zhang, Jianli Bai, Jianxi Fan, and Neal N Xiong. 2021. SPPS: A search pattern privacy system for approximate shortest distance query of encrypted graphs in IIoT. IEEE Transactions on Systems, Man, and Cybernetics: Systems 52, 1 (2021), 136--150.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3433210.3453099"},{"key":"e_1_3_2_1_12_1","volume-title":"Foundations of cryptography","author":"Goldreich Oded","unstructured":"Oded Goldreich. 2009. Foundations of cryptography: volume 2, basic applications. Cambridge university press, Cambridge, United Kingdom."},{"key":"e_1_3_2_1_13_1","volume-title":"Cheetah: Lean and Fast Secure Two-Party Deep Neural Network Inference. In 31st USENIX Security Symposium. USENIX","author":"Huang Zhicong","year":"2022","unstructured":"Zhicong Huang, Wen-jie Lu, Cheng Hong, and Jiansheng Ding. 2022. Cheetah: Lean and Fast Secure Two-Party Deep Neural Network Inference. In 31st USENIX Security Symposium. USENIX, Boston, United State, 809--826."},{"key":"e_1_3_2_1_14_1","volume-title":"A privacy-enhanced and personalized safe route planner with crowdsourced data and computation","author":"Islam Fariha Tabassum","unstructured":"Fariha Tabassum Islam, Tanzima Hashem, and Rifat Shahriyar. 2021. A privacy-enhanced and personalized safe route planner with crowdsourced data and computation. In ICDE. IEEE, Chania, Greece, 229--240."},{"key":"e_1_3_2_1_15_1","first-page":"4961","article-title":"CrypTen: Secure multi-party computation meets machine learning","volume":"34","author":"Knott Brian","year":"2021","unstructured":"Brian Knott, Shobha Venkataraman, Awni Hannun, Shubho Sengupta, Mark Ibrahim, and Laurens van der Maaten. 2021. CrypTen: Secure multi-party computation meets machine learning. Advances in Neural Information Processing Systems 34 (2021), 4961--4973.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_16_1","volume-title":"2020 IEEE Symposium on Security and Privacy. IEEE","author":"Kumar Nishant","year":"2020","unstructured":"Nishant Kumar, Mayank Rathee, Nishanth Chandran, Divya Gupta, and Aseem Rastogi. 2020. CrypTFlow: Secure tensorflow inference. In 2020 IEEE Symposium on Security and Privacy. IEEE, San Francisco, United State, 336--353."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Shangqi Lai Xingliang Yuan Shi-Feng Sun Joseph K Liu Yuhong Liu and Dongxi Liu. 2019. GraphSE2: An encrypted graph database for privacy-preserving social search. In AsiaCCS. 41--54.","DOI":"10.1145\/3321705.3329803"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jisa.2023.103463"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2018.2880981"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2885282"},{"key":"e_1_3_2_1_21_1","volume-title":"Approximate Shortest Distance Queries with Advanced Graph Analytics over Large-scale Encrypted Graphs","author":"Luo Yuchuan","unstructured":"Yuchuan Luo, Dongsheng Wang, Shaojing Fu, Ming Xu, Yingwen Chen, and Kai Huang. 2022. Approximate Shortest Distance Queries with Advanced Graph Analytics over Large-scale Encrypted Graphs. In MSN. IEEE, 287--294."},{"key":"e_1_3_2_1_22_1","volume-title":"Grecs: Graph encryption for approximate shortest distance queries. In CCS. ACM, Denver Colorado, United States, 504--517.","author":"Meng Xianrui","year":"2015","unstructured":"Xianrui Meng, Seny Kamara, Kobbi Nissim, and George Kollios. 2015. Grecs: Graph encryption for approximate shortest distance queries. In CCS. ACM, Denver Colorado, United States, 504--517."},{"key":"e_1_3_2_1_23_1","volume-title":"International conference on the theory and applications of cryptographic techniques. Springer, Springer Berlin Heidelberg","author":"Paillier Pascal","year":"1999","unstructured":"Pascal Paillier. 1999. Public-key cryptosystems based on composite degree residuosity classes. In International conference on the theory and applications of cryptographic techniques. Springer, Springer Berlin Heidelberg, Berlin, Heidelberg, 223--238."},{"key":"e_1_3_2_1_24_1","volume-title":"Efficiently answering quality constrained shortest distance queries in large graphs","author":"Peng You","unstructured":"You Peng, Zhuo Ma, Wenjie Zhang, Xuemin Lin, Ying Zhang, and Xiaoshuang Chen. 2023. Efficiently answering quality constrained shortest distance queries in large graphs. In ICDE. IEEE, 856--868."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417274"},{"key":"e_1_3_2_1_26_1","volume-title":"28th USENIX Security Symposium. USENIX, 1501--1518","author":"Riazi M Sadegh","year":"2019","unstructured":"M Sadegh Riazi, Mohammad Samragh, Hao Chen, Kim Laine, Kristin Lauter, and Farinaz Koushanfar. 2019. XONN:XNOR-based oblivious deep neural network inference. In 28th USENIX Security Symposium. USENIX, 1501--1518."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.3390\/cryptography4040029"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.14445\/23488379\/IJEEE-V10I1P105","article-title":"Outsourced Analysis of Encrypted Graphs in the Cloud with Privacy Protection","volume":"10","author":"Selvaraj D","year":"2023","unstructured":"D Selvaraj, SM Sankar, D Dhinakaran, and TP Anish. 2023. Outsourced Analysis of Encrypted Graphs in the Cloud with Privacy Protection. SSRG International Journal of Electrical and Electronics Engineering 10, 1 (2023), 53--62.","journal-title":"SSRG International Journal of Electrical and Electronics Engineering"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2017.2774451"},{"key":"e_1_3_2_1_30_1","volume-title":"Privacy-Preserving Shortest Distance Query for Dynamic Large-Scale Road Network","author":"Sun Fangyuan","year":"2023","unstructured":"Fangyuan Sun, Jia Yu, Rong Hao, Ming Yang, and Fanyu Kong. 2023. Privacy-Preserving Shortest Distance Query for Dynamic Large-Scale Road Network. IEEE Systems Journal (2023)."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3616874"},{"key":"e_1_3_2_1_32_1","volume-title":"FC'17","author":"Wang Qian","year":"2017","unstructured":"Qian Wang, Kui Ren, Minxin Du, Qi Li, and Aziz Mohaisen. 2017. SecGDB: Graph encryption for exact shortest distance queries with efficient updates. In FC'17. Springer, 79--97."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2022.3201392"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2022.3184045"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.07.082"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2922277"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","first-page":"2501","DOI":"10.1109\/TDSC.2021.3061611","article-title":"Efficient and privacy-preserving similarity range query over encrypted time series data","volume":"19","author":"Zheng Yandong","year":"2021","unstructured":"Yandong Zheng, Rongxing Lu, Yunguo Guan, and Jun Shao. 2021. Efficient and privacy-preserving similarity range query over encrypted time series data. IEEE Transactions on Dependable and Secure Computing 19, 4 (2021), 2501--2516.","journal-title":"IEEE Transactions on Dependable and Secure Computing"}],"event":{"name":"ASIA CCS '24: 19th ACM Asia Conference on Computer and Communications Security","location":"Singapore Singapore","acronym":"ASIA CCS '24","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 19th ACM Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3634737.3656293","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:44:07Z","timestamp":1750290247000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3634737.3656293"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7]]},"references-count":37,"alternative-id":["10.1145\/3634737.3656293","10.1145\/3634737"],"URL":"https:\/\/doi.org\/10.1145\/3634737.3656293","relation":{},"subject":[],"published":{"date-parts":[[2024,7]]},"assertion":[{"value":"2024-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}