{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T04:53:26Z","timestamp":1743915206443,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031651717"},{"type":"electronic","value":"9783031651724"}],"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-3-031-65172-4_7","type":"book-chapter","created":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T12:02:41Z","timestamp":1720785761000},"page":"101-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Privacy-Preserving Graph Encryption Scheme Based on\u00a0Oblivious RAM"],"prefix":"10.1007","author":[{"given":"Seyni","family":"Kane","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9758-4617","authenticated-orcid":false,"given":"Anis","family":"Bkakria","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,13]]},"reference":[{"key":"7_CR1","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":"7_CR2","unstructured":"Costan, V., Devadas, S.: Intel SGX explained. Cryptology ePrint Archive (2016)"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Falzon, F., Paterson, K.G.: An efficient query recovery attack against a graph encryption scheme. In: Atluri, V., Di Pietro, R., Jensen, C.D., Meng, W. (eds.) Computer Security \u2013 ESORICS 2022. ESORICS 2022. LNCS, vol. 13554. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-17140-6_16","DOI":"10.1007\/978-3-031-17140-6_16"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-319-61176-1_22","volume-title":"Data and Applications Security and Privacy XXXI","author":"B Fuhry","year":"2017","unstructured":"Fuhry, B., Bahmani, R., Brasser, F., Hahn, F., Kerschbaum, F., Sadeghi, A.-R.: HardIDX: practical and secure index with SGX. In: Livraga, G., Zhu, S. (eds.) DBSec 2017. LNCS, vol. 10359, pp. 386\u2013408. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61176-1_22"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Ghosh, E., Kamara, S., Tamassia, R.: Efficient graph encryption scheme for shortest path queries. In: Proceedings of the 2021 ACM Asia Conference on Computer and Communications Security, pp. 516\u2013525 (2021)","DOI":"10.1145\/3433210.3453099"},{"issue":"3","key":"7_CR7","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/233551.233553","volume":"43","author":"O Goldreich","year":"1996","unstructured":"Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious rams. J. ACM (JACM) 43(3), 431\u2013473 (1996)","journal-title":"J. ACM (JACM)"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Kane, S., Bkakria, A.: A privacy preserving graph encryption scheme based on oblivious ram. https:\/\/github.com\/nserser\/graph_encryption (2024). online; 28 May 2024","DOI":"10.1007\/978-3-031-65172-4_7"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Lai, S., Yuan, X., Sun, S.F., Liu, J.K., Liu, Y., Liu, D.: $$\\text{Graphse}^2$$: an encrypted graph database for privacy-preserving social search. In: Proceedings of the 2019 ACM Asia Conference on Computer and Communications Security, pp. 41\u201354 (2019)","DOI":"10.1145\/3321705.3329803"},{"key":"7_CR10","doi-asserted-by":"crossref","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 (2015)","DOI":"10.1145\/2810103.2813672"},{"key":"7_CR11","unstructured":"Patel, S., Persiano, G., Yeo, K.: Recursive ORAMs with practical constructions. Cryptology ePrint Archive, Paper 2017\/964 (2017). https:\/\/eprint.iacr.org\/2017\/964, https:\/\/eprint.iacr.org\/2017\/964"},{"key":"7_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2019.101711","volume":"91","author":"MH Rachid","year":"2020","unstructured":"Rachid, M.H., Riley, R., Malluhi, Q.: Enclave-based oblivious ram using intel\u2019s SGX. Comput. Secur. 91, 101711 (2020)","journal-title":"Comput. Secur."},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Sasy, S., Gorbunov, S., Fletcher, C.W.: ZeroTrace: Oblivious memory primitives from intel SGX. Cryptology ePrint Archive (2017)","DOI":"10.14722\/ndss.2018.23239"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Stefanov, E., et al.: Path ORAM: an extremely simple oblivious ram protocol. J. ACM (JACM) 65(4), 1\u201326 (2018)","DOI":"10.1145\/3177872"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Will, N.C., Maziero, C.A.: Intel software guard extensions applications: a survey. ACM Comput. Surv. 55, 1\u201338 (2023)","DOI":"10.1145\/3593021"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Wu, D.J., Zimmerman, J., Planul, J., Mitchell, J.C.: Privacy-preserving shortest path computation (2016). arXiv preprint arXiv:1601.02281","DOI":"10.14722\/ndss.2016.23052"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Wu, Z., Li, R.: OBI: a multi-path oblivious ram for forward-and-backward-secure searchable encryption. In: NDSS (2023)","DOI":"10.14722\/ndss.2023.24423"}],"container-title":["Lecture Notes in Computer Science","Data and Applications Security and Privacy XXXVIII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-65172-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,24]],"date-time":"2024-11-24T00:08:11Z","timestamp":1732406891000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-65172-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031651717","9783031651724"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-65172-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"13 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DBSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP Annual Conference on Data and Applications Security and Privacy","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"San Jose, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"14 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"38","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dbsec2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dbsec2024.unimol.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}