{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T04:06:17Z","timestamp":1750824377420,"version":"3.41.0"},"reference-count":17,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T00:00:00Z","timestamp":1746403200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T00:00:00Z","timestamp":1746403200000},"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":[[2025,5,5]]},"DOI":"10.1109\/cscwd64889.2025.11033541","type":"proceedings-article","created":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T17:24:40Z","timestamp":1750699480000},"page":"2083-2088","source":"Crossref","is-referenced-by-count":0,"title":["PSDMQ: A Parallel Method for Shortest Distances Multi-Querying on Encrypted Graph"],"prefix":"10.1109","author":[{"given":"Xiaotong","family":"Dong","sequence":"first","affiliation":[{"name":"Institute of Information Engineering, Chinese Academy of Sciences,Beijing,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaojie","family":"Zhu","sequence":"additional","affiliation":[{"name":"King Abdullah University of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chi","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Cyber Security, University of Chinese Academy of Sciences,Beijing,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Li","sequence":"additional","affiliation":[{"name":"Institute of Information Engineering, Chinese Academy of Sciences,Beijing,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiping","family":"Wang","sequence":"additional","affiliation":[{"name":"Institute of Information Engineering, Chinese Academy of Sciences,Beijing,China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-2011-0426"},{"key":"ref2","article-title":"Structured encryption and controlled disclosure","volume-title":"International conference on the theory and application of cryptology and information security","author":"Melissa","year":"2010"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-018-0517-6"},{"key":"ref4","article-title":"Highly-scalable searchable symmetric encryption with support for boolean queries","volume-title":"Annual cryptology conference","author":"David","year":"2013"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2019.2932775"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00133"},{"key":"ref7","first-page":"136","article-title":"SPPS: A search pattern privacy system for approximate shortest distance query of encrypted graphs in IIoT","volume":"52.1","author":"Xinrui","year":"2021","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.14778\/3015274.3015277"},{"key":"ref9","first-page":"192","article-title":"Enabling privacy-preserving shortest distance queries on encrypted graph data","volume":"18.1","author":"Chang","year":"2018","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"ref11","article-title":"Parallel and Dynamic Searchable Symmetric Encryption","volume-title":"International Conference on Financial Cryptog-raphy & Data Security Springer","author":"Seny","year":"2013"},{"key":"ref12","article-title":"SearchaStore: fast and secure searchable cloud services","volume":"21.2","author":"Goi","year":"2018","journal-title":"Cluster computing"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2014.23264"},{"journal-title":"SNAP Datasets: Stanford Large Network Dataset Collection","author":"Leskovec","key":"ref14"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1145\/1516360.1516417","article-title":"Online exact shortest distance query processing","author":"Cheng","year":"2009","journal-title":"EDBT"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33090-2_4"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_18"}],"event":{"name":"2025 28th International Conference on Computer Supported Cooperative Work in Design (CSCWD)","start":{"date-parts":[[2025,5,5]]},"location":"Compiegne, France","end":{"date-parts":[[2025,5,7]]}},"container-title":["2025 28th International Conference on Computer Supported Cooperative Work in Design (CSCWD)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11033175\/11033221\/11033541.pdf?arnumber=11033541","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T06:46:18Z","timestamp":1750747578000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11033541\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,5]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/cscwd64889.2025.11033541","relation":{},"subject":[],"published":{"date-parts":[[2025,5,5]]}}}