{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:37:57Z","timestamp":1780054677111,"version":"3.54.0"},"publisher-location":"Singapore","reference-count":20,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819755615","type":"print"},{"value":"9789819755622","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-5562-2_2","type":"book-chapter","created":{"date-parts":[[2024,10,26]],"date-time":"2024-10-26T07:01:50Z","timestamp":1729926110000},"page":"20-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["SecGraph: Towards SGX-based Efficient and Confidentiality-Preserving Graph Search"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-4381-5026","authenticated-orcid":false,"given":"Qiuhao","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0094-6245","authenticated-orcid":false,"given":"Xu","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0394-4432","authenticated-orcid":false,"given":"Saiyu","family":"Qi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7682-5653","authenticated-orcid":false,"given":"Yong","family":"Qi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,10,27]]},"reference":[{"key":"2_CR1","unstructured":"Facebook. http:\/\/www.facebook.com"},{"key":"2_CR2","unstructured":"Instagram. https:\/\/www.instagram.com\/"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Cash, D., Jaeger, J., Jarecki, S., Jutla, C.S., Krawczyk, H., Rosu, M., Steiner, M.: Dynamic searchable encryption in very-large databases: Data structures and implementation. In: NDSS (2014)","DOI":"10.14722\/ndss.2014.23264"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Cash, D., Jarecki, S., Jutla, C.S., Krawczyk, H., Rosu, M., Steiner, M.: Highly-scalable searchable symmetric encryption with support for boolean queries. In: CRYPTO. pp. 353\u2013373 (2013)","DOI":"10.1007\/978-3-642-40041-4_20"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Chase, M., Kamara, S.: Structured encryption and controlled disclosure. In: ASIACRYPT. pp. 577\u2013594 (2010)","DOI":"10.1007\/978-3-642-17373-8_33"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Chen, X., Huo, H., Huan, J., Vitter, J.S., Zheng, W., Zou, L.: Msq-index: A succinct index for fast graph similarity search. IEEE TKDE. 33(6), 2654\u20132668 (2021)","DOI":"10.1109\/TKDE.2019.2954527"},{"key":"2_CR7","unstructured":"Costan, V., Devadas, S.: Intel sgx explained. In: Cryptology ePrint Archive (2016)"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Demmler, D., Schneider, T., Zohner, M.: ABY - A framework for efficient mixed-protocol secure two-party computation. In: NDSS (2015)","DOI":"10.14722\/ndss.2015.23113"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Fan, B., Andersen, D.G., Kaminsky, M., Mitzenmacher, M.: Cuckoo filter: Practically better than bloom. In: CoNEXT. pp. 75\u201388. ACM (2014)","DOI":"10.1145\/2674005.2674994"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Gao, C., Wang, X., He, X., Li, Y.: Graph neural networks for recommender system. In: WSDM. pp. 1623\u20131625 (2022)","DOI":"10.1145\/3488560.3501396"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Ghosh, E., Kamara, S., Tamassia, R.: Efficient graph encryption scheme for shortest path queries. In: CCS. pp. 516\u2013525 (2021)","DOI":"10.1145\/3433210.3453099"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Lai, S., Yuan, X., Sun, S., Liu, J.K., Liu, Y., Liu, D.: Graphse$${^2}$$: An encrypted graph database for privacy-preserving social search. In: AsiaCCS. pp. 41\u201354 (2019)","DOI":"10.1145\/3321705.3329803"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Patranabis, S., Mukhopadhyay, D.: Forward and backward private conjunctive searchable symmetric encryption. In: NDSS (2021)","DOI":"10.14722\/ndss.2021.23116"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Shen, M., Wang, M., Xu, K., Zhu, L.: Privacy-preserving approximate top-k nearest keyword queries over encrypted graphs. In: IWQOS. pp. 1\u201310 (2021)","DOI":"10.1109\/IWQOS52092.2021.9521317"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Wang, H., Zhao, Z., Yang, K., Song, H., Xiao, Y.: Approximate nearest neighbor search using query-directed dense graph. In: DASFAA Workshops. pp. 429\u2013444 (2021)","DOI":"10.1007\/978-3-030-73216-5_29"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Wang, Q., Yang, X., Qi, S., Qi, Y.: Secgraph: Towards sgx-based efficient and confidentiality-preserving graph search (full version)*. CoRR abs\/2403.19531 (2024)","DOI":"10.1007\/978-981-97-5562-2_2"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Wang, S., Zheng, Y., Jia, X., Yi, X.: Pegraph: A system for privacy-preserving and efficient search over encrypted social graphs. IEEE TIFS. 17, 3179\u20133194 (2022)","DOI":"10.1109\/TIFS.2022.3201392"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Zhang, F., Chen, H., Jin, H., Reviriego, P.: The logarithmic dynamic cuckoo filter. In: IEEE ICDE. pp. 948\u2013959 (2021)","DOI":"10.1109\/ICDE51399.2021.00087"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Zhang, K., Tong, Y., Shi, Y., Zeng, Y., Xu, Y., Chen, L., Zhou, Z., Xu, K., Lv, W., Zheng, Z.: Approximate k-nearest neighbor query over spatial data federation. In: DAFSAA. pp. 351\u2013368 (2023)","DOI":"10.1007\/978-3-031-30637-2_23"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Zhao, Z., Qian, P., Yang, X., Zeng, Z., Guan, C., Leong, T.W., Li, X.: Semignn-ppi: Self-ensembling multi-graph neural network for efficient and generalizable protein-protein interaction prediction. In: IJCAI. pp. 4984\u20134992 (2023)","DOI":"10.24963\/ijcai.2023\/554"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-5562-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T08:00:28Z","timestamp":1748073628000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-5562-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819755615","9789819755622"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-5562-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"27 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gifu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2024a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dasfaa2024.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}