{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T16:32:59Z","timestamp":1772641979017,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031171390","type":"print"},{"value":"9783031171406","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-17140-6_16","type":"book-chapter","created":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T06:19:49Z","timestamp":1664000389000},"page":"325-345","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["An Efficient Query Recovery Attack Against a\u00a0Graph Encryption Scheme"],"prefix":"10.1007","author":[{"given":"Francesca","family":"Falzon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth G.","family":"Paterson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,25]]},"reference":[{"key":"16_CR1","volume-title":"Data Structures and Algorithms","author":"AV Aho","year":"1983","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.: Data Structures and Algorithms, 1st edn. Addison-Wesley Longman Publishing Co., Inc., Boston (1983)","edition":"1"},{"key":"16_CR2","unstructured":"Amazon: Amazon neptune (2021). https:\/\/aws.amazon.com\/neptune\/. Accessed 27 Oct 2021"},{"key":"16_CR3","unstructured":"Ambavi, H., Sharma, M., Gohil, V.: Densest-subgraph-discovery (2020). https:\/\/github.com\/varungohil\/Densest-Subgraph-Discovery"},{"key":"16_CR4","doi-asserted-by":"publisher","unstructured":"Cash, D., et al.: Dynamic searchable encryption in very-large databases: data structures and implementation. In: 21st Annual Network and Distributed System Security Symposium, NDSS 2014, San Diego, California, USA, 23\u201326 February 2014. The Internet Society (2014). https:\/\/doi.org\/10.14722\/ndss.2014.23264","DOI":"10.14722\/ndss.2014.23264"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/3-540-44436-X_10","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"M Charikar","year":"2000","unstructured":"Charikar, M.: Greedy approximation algorithms for finding dense components in a graph. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 84\u201395. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44436-X_10"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-642-17373-8_33","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"M Chase","year":"2010","unstructured":"Chase, M., Kamara, S.: Structured encryption and controlled disclosure. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 577\u2013594. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_33"},{"key":"16_CR7","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)","edition":"3"},{"key":"16_CR8","unstructured":"Developers, N.: Networkx, version 2.6.2 (2021). https:\/\/networkx.org\/"},{"key":"16_CR9","unstructured":"Developers, P.: Pycryptodome, version 3.10.1 (2021). https:\/\/www.pycryptodome.org\/"},{"key":"16_CR10","unstructured":"Falzon, F., Paterson, K.G.: An efficient query recovery attack against a graph encryption scheme. Cryptology ePrint Archive, Paper 2022\/838 (2022). https:\/\/eprint.iacr.org\/2022\/838"},{"issue":"6","key":"16_CR11","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd, R.W.: Algorithm 97: shortest path. Commun. ACM 5(6), 345 (1962). https:\/\/doi.org\/10.1145\/367766.368168","journal-title":"Commun. ACM"},{"key":"16_CR12","doi-asserted-by":"publisher","unstructured":"Ghosh, E., Kamara, S., Tamassia, R.: Efficient graph encryption scheme for shortest path queries. In: Proceedings of the 2021 ACM Asia CCS, pp. 516\u2013525. ASIA CCS 2021, ACM, New York (2021). https:\/\/doi.org\/10.1145\/3433210.3453099","DOI":"10.1145\/3433210.3453099"},{"key":"16_CR13","unstructured":"Goetschmann, A.: Design and Analysis of Graph Encryption Schemes. Master\u2019s thesis, ETH Z\u00fcrich (2020)"},{"key":"16_CR14","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection, June 2014. http:\/\/snap.stanford.edu\/data"},{"key":"16_CR15","doi-asserted-by":"publisher","unstructured":"Low, Y., Bickson, D., Gonzalez, J., Guestrin, C., Kyrola, A., Hellerstein, J.M.: Distributed GraphLab: a framework for machine learning and data mining in the cloud. Proc. VLDB Endow. 5(8), 716\u2013727 (2012). https:\/\/doi.org\/10.14778\/2212351.2212354","DOI":"10.14778\/2212351.2212354"},{"key":"16_CR16","doi-asserted-by":"publisher","unstructured":"Meng, X., Kamara, S., Nissim, K., Kollios, G.: GRECS: graph encryption for approximate shortest distance queries. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, pp. 504\u2013517. CCS 2015, ACM, New York (2015). https:\/\/doi.org\/10.1145\/2810103.2813672","DOI":"10.1145\/2810103.2813672"},{"key":"16_CR17","doi-asserted-by":"publisher","unstructured":"Mouratidis, K., Yiu, M.L.: Shortest path computation with no information leakage. Proc. VLDB Endow. 5(8), 692\u2013703 (2012). https:\/\/doi.org\/10.14778\/2212351.2212352","DOI":"10.14778\/2212351.2212352"},{"key":"16_CR18","unstructured":"Neo4j, I.: Neo4j (2021). https:\/\/neo4j.com\/. Accessed 27 Oct 2021"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-642-34117-5_7","volume-title":"Advances in Information and Computer Security","author":"GS Poh","year":"2012","unstructured":"Poh, G.S., Mohamad, M.S., Z\u2019aba, M.R.: Structured encryption for conceptual graphs. In: Hanaoka, G., Yamauchi, T. (eds.) IWSEC 2012. LNCS, vol. 7631, pp. 105\u2013122. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34117-5_7"},{"key":"16_CR20","doi-asserted-by":"publisher","unstructured":"Sala, A., Zhao, X., Wilson, C., Zheng, H., Zhao, B.Y.: Sharing graphs using differentially private graph models. In: Proceedings of the 2011 ACM SIGCOMM Conference on Internet Measurement Conference, pp. 81\u201398. IMC 2011, ACM, New York (2011). https:\/\/doi.org\/10.1145\/2068816.2068825","DOI":"10.1145\/2068816.2068825"},{"key":"16_CR21","doi-asserted-by":"publisher","unstructured":"Sealfon, A.: Shortest paths and distances with differential privacy. In: Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pp. 29\u201341. PODS 2016, ACM, New York (2016). https:\/\/doi.org\/10.1145\/2902251.2902291","DOI":"10.1145\/2902251.2902291"},{"key":"16_CR22","doi-asserted-by":"publisher","unstructured":"Shao, B., Wang, H., Li, Y.: Trinity: a distributed graph engine on a memory cloud. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pp. 505\u2013516. SIGMOD 2013, ACM, New York (2013). https:\/\/doi.org\/10.1145\/2463676.2467799","DOI":"10.1145\/2463676.2467799"},{"key":"16_CR23","doi-asserted-by":"publisher","unstructured":"Venkataramani, V., et al.: Tao: How facebook serves the social graph. In: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, pp. 791\u2013792. SIGMOD 2012. Association for Computing Machinery, New York (2012). https:\/\/doi.org\/10.1145\/2213836.2213957","DOI":"10.1145\/2213836.2213957"},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-319-70972-7_5","volume-title":"Financial Cryptography and Data Security","author":"Q Wang","year":"2017","unstructured":"Wang, Q., Ren, K., Du, M., Li, Q., Mohaisen, A.: SecGDB: graph encryption for exact shortest distance queries with efficient updates. In: Kiayias, A. (ed.) FC 2017. LNCS, vol. 10322, pp. 79\u201397. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70972-7_5"},{"key":"16_CR25","doi-asserted-by":"publisher","unstructured":"Wu, D.J., Zimmerman, J., Planul, J., Mitchell, J.C.: Privacy-preserving shortest path computation. In: 23rd Annual Network and Distributed System Security Symposium, NDSS 2016, San Diego, California, USA, 21\u201324 February 2016. The Internet Society (2016). https:\/\/doi.org\/10.14722\/ndss.2016.23052","DOI":"10.14722\/ndss.2016.23052"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-17140-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T06:23:47Z","timestamp":1664000627000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-17140-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031171390","9783031171406"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-17140-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/esorics2022.compute.dtu.dk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"562","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"104","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}